Lujian Yao

Lujian Yao

Auto-generated profile, based on publicly available information

Lujian Yao

East China University of Science and Technology, Shanghai, China

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
28 September 2022 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
ZHZhengwei Hu
Zhengwei Hu
Haitao ZhaoHaitao Zhao
Haitao Zhao
LYLujian Yao
Lujian Yao
JPJingchao Peng
Jingchao Peng
In the traditional fault diagnosis task, it is difficult to collect training samples to exhaust all fault classes. There are massive target faults that can not be collected in advance, which may restrict the performance of fault diagnosis methods. In this paper, a novel method named semantic-consistent embedding (SCE) is proposed for zero-shot industrial fault diagnosis. SCE tries to classify unseen class faults only by using seen class faults for training. The fault samples and their human-specified attribute vectors are embedded into a semantic-consistent space and then reconstructed from that space. A specific Barlow matrix is designed to measure the consistency between the embedding of fault samples and the embedding of attribute vectors. The diagonal elements and the off-diagonal elements of the Barlow matrix encode the within-dimension consistency and between-dimension consistency of the cross-modal embeddings, respectively. Through optimizing the Barlow matrix to an identity matrix, SCE learns a significant space where the cross-modal embeddings have consistent representation while reducing the redundant components. Extensive experiments show that SCE gets significant superiority on the three-phase transmission system (26.9% gains) and the Tennessee Eastman process (15.5% gains). Moreover, SCE even gets competitive results with supervised learning methods. The code of SCE can be found at https://github.com/htz-ecust/Semantic-consistent-Embedding .

17 July 2023 in Expert Systems with Applications
Verified
Journal Article
Closed access
JPJingchao Peng
Jingchao Peng
Haitao ZhaoHaitao Zhao
Haitao Zhao
KZKaijie Zhao
Kaijie Zhao
ZWZhongze Wang
Zhongze Wang
LYLujian Yao
Lujian Yao

26 February 2024 in IEEE Transactions on Multimedia
Verified
Journal Article
Closed access
ZWZhongze Wang
Zhongze Wang
Haitao ZhaoHaitao Zhao
Haitao Zhao
LYLujian Yao
Lujian Yao
JPJingchao Peng
Jingchao Peng
KZKaijie Zhao
Kaijie Zhao
In the image dehazing task, the haze density is a key feature that affects the performance of dehazing methods. The haze density difference, which has rarely been utilized in previous methods, can guide networks to perceive different global densities and focus on local areas with high density or that are difficult to dehaze. In this paper, we propose a density-aware dehazing method named the Density Feature Refinement Network (DFR-Net), which extracts haze density features from density differences and leverages density differences to refine density features. In DFR-Net, we first generate a proposal image that has a lower overall density than the hazy input, resulting in global density differences. Additionally, the dehazing residual of the proposal image reflects the level of dehazing performance and provides local density differences that indicate localized hard dehazing or high-density areas. Subsequently, we introduce a Global Branch (GB) and a Local Branch (LB) to achieve density awareness. In GB, we use Siamese networks for feature extraction of hazy inputs and proposal images, and we propose a Global Density Feature Refinement (GDFR) module that can refine features by pushing features with different global densities further away. In LB, we explore local density features from the dehazing residuals between hazy inputs and proposal images and introduce an Intermediate Dehazing Residual Feedforward (IDRF) module to update local features and pull them close to clear image features. Sufficient experiments demonstrate that the proposed method outperforms state-of-the-art methods on various datasets.

8 June 2024 in Engineering Applications of Artificial Intelligence
Verified
Journal Article
Closed access
JPJingchao Peng
Jingchao Peng
HZHaitao Zhao
Haitao Zhao
KZKaijie Zhao
Kaijie Zhao
ZWZhongze Wang
Zhongze Wang
LYLujian Yao
Lujian Yao

24 March 2024 in Proceedings of the AAAI Conference on Artificial Intelligence
Verified
Journal Article
Open access
PDF file
LYLujian Yao
Lujian Yao
Haitao ZhaoHaitao Zhao
Haitao Zhao
JPJingchao Peng
Jingchao Peng
ZWZhongze Wang
Zhongze Wang
KZKaijie Zhao
Kaijie Zhao
Early smoke segmentation (ESS) enables the accurate identification of smoke sources, facilitating the prompt extinguishing of fires and preventing large-scale gas leaks. But ESS poses greater challenges than conventional object and regular smoke segmentation due to its small scale and transparent appearance, which can result in high miss detection rate and low precision. To address these issues, a Focus and Separation Network (FoSp) is proposed. We first introduce a Focus module employing bidirectional cascade which guides low-resolution and high-resolution features towards mid-resolution to locate and determine the scope of smoke, reducing the miss detection rate. Next, we propose a Separation module that separates smoke images into a pure smoke foreground and a smoke-free background, enhancing the contrast between smoke and background fundamentally, improving segmentation precision. Finally, a Domain Fusion module is developed to integrate the distinctive features of the two modules which can balance recall and precision to achieve high F_beta. Futhermore, to promote the development of ESS, we introduce a high-quality real-world dataset called SmokeSeg, which contains more small and transparent smoke than the existing datasets. Experimental results show that our model achieves the best performance on three available smoke segmentation datasets: SYN70K (mIoU: 83.00%), SMOKE5K (F_beta: 81.6%) and SmokeSeg (F_beta: 72.05%). The code can be found at https://github.com/LujianYao/FoSp.

20 October 2025 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
ZWZhongze Wang
Zhongze Wang
JPJingchao Peng
Jingchao Peng
Haitao ZhaoHaitao Zhao
Haitao Zhao
LYLujian Yao
Lujian Yao
KZKaijie Zhao
Kaijie Zhao
Unpaired image restoration (UIR) is a significant task due to the difficulty of acquiring paired degraded/clear images with identical backgrounds. In this paper, we propose a novel UIR method based on the assumption that an image contains both degradation-related features, which affect the level of degradation, and degradation-unrelated features, such as texture and semantic information. Our method aims to ensure that the degradation-related features of the restoration result closely resemble those of the clear image, while the degradation-unrelated features align with the input degraded image. Specifically, we introduce a Feature Orthogonalization Module optimized on Stiefel manifold to decouple image features, ensuring feature uncorrelation. A task-driven Depth-wise Feature Classifier is proposed to assign weights to uncorrelated features based on their relevance to degradation prediction. To avoid the dependence of the training process on the quality of the clear image in a single pair of input data, we propose to maintain several degradation-related proxies describing the degradation level of clear images to enhance the model’s robustness. Finally, a weighted PatchNCE loss is introduced to pull degradation-related features in the output image toward those of clear images, while bringing degradation-unrelated features close to those of the degraded input.