Chang Niu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Chang Niu has a total of 40 co-authors. Here are the top co-authors by number of shared publications:
- Zhiheng Zhou
South China University of Technology
10 shared publications - Junyuan Shang
School of Electronic and Information Engineering, South China University of Technology, Guangzhou, China
7 shared publications - Junmei Yang
School of Electronic and Information Engineering, South China University of Technology, Guangzhou, Guangdong, China
4 shared publications - Wenlve Zhou
School of Electronic and Information Engineering, South China University of Technology, Guangzhou, China
3 shared publications - Junchu Huang
School of Electronic and Information Engineering, South China University of Technology, China and Key Laboratory of Big Data and Intelligent Robot, South China University of Technology, Ministry of Education, Guangzhou City, Guangdong Province, China
2 shared publications - Qingru Wu
School of Electronic and Information Engineering, South China University of Technology, Guangzhou, China
2 shared publications
Latest Publications
- 14 September 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 352
Perturbated Model Consistency for generalization-enhanced domain adaptive object detection
- 14 September 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 352
Perturbated Model Consistency for generalization-enhanced domain adaptive object detection
- Open Access
- 4 September 2026
- Published by Elsevier in SSRN Electronic Journal
Affinity-Guided Group Discovery for Social Activity Understanding in Videos
Embodied agents operating in human-populated environments need structured social perception: they must identify who interacts with whom, distinguish social groups from outliers, and recognize what each group is doing. Existing query-based methods infer group membership mainly from latent group tokens and activity semantics, leaving the underlying actor-actor structure implicit. We propose AGGD, an affinity-guided framework that makes this structure explicit. Its pairwise affinity branch estimates same-group relations from actor appearance and spatial cues, and connected component decomposition converts the resulting affinity graph into group instances and outliers. The learned structure also guides the query-based membership representation through an affinity-guided contrastive objective, linking discovered groups to group-level activity semantics. A LoRA-adapted visual foundation encoder supplies actor-centric features for both structural and semantic reasoning. Experiments on Café and Social-CAD show state-of-the-art performance in group detection and group activity prediction. The results indicate that explicit actor-actor affinity provides reliable structural guidance for social activity understanding in complex multi-group scenes.
- 4 September 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessAffinity-Guided Group Discovery for Social Activity Understanding in Videos
Embodied agents operating in human-populated environments need structured social perception: they must identify who interacts with whom, distinguish social groups from outliers, and recognize what each group is doing. Existing query-based methods infer group membership mainly from latent group tokens and activity semantics, leaving the underlying actor-actor structure implicit. We propose AGGD, an affinity-guided framework that makes this structure explicit. Its pairwise affinity branch estimates same-group relations from actor appearance and spatial cues, and connected component decomposition converts the resulting affinity graph into group instances and outliers. The learned structure also guides the query-based membership representation through an affinity-guided contrastive objective, linking discovered groups to group-level activity semantics. A LoRA-adapted visual foundation encoder supplies actor-centric features for both structural and semantic reasoning. Experiments on Café and Social-CAD show state-of-the-art performance in group detection and group activity prediction. The results indicate that explicit actor-actor affinity provides reliable structural guidance for social activity understanding in complex multi-group scenes.
- Open Access
- 1 January 2026
- Published by Wiley in Applied Computational Intelligence and Soft Computing
- Vol. 2026 (1) , 4260698
CC‐AFL: Contrastive Clustering–Based Asynchronous Federated Learning With Dynamic Client Scheduling for Industrial Defect Detection
The non‐independent and identically distributed (non‐IID) nature of data across different sites and the dynamic participation of client nodes represent two critical challenges faced by distributed industrial visual defect detection systems. While asynchronous federated learning (AFL) reduces training inefficiencies, its asynchronous update process makes the global model more vulnerable to data heterogeneity. This research proposes a contrastive clustering–based asynchronous federated learning (CC‐AFL) framework. The method integrates contrastive learning into the client clustering process, working simultaneously across instance‐level and cluster‐level spaces to identify hidden similarity patterns among participating clients. The server maintains update queues for each cluster and then applies staleness‐weighted aggregation based on the combined timestamp. Meanwhile, the framework uses client scheduling based on cluster queue lengths, giving priority to clusters with fewer updates to balance update frequencies across different clusters. Without requiring raw data sharing, the framework achieves improvements in both convergence speed and stability of AFL under changing scenarios. On the furniture board dataset, CC‐AFL achieves better performance with an average area under the receiver operating characteristic curve (I‐AUROC) of 74.38%, showing a 2.22% improvement over AFL‐DCS under different non‐IID settings. Experimental results show that CC‐AFL maintains stable convergence under different conditions, confirming the effectiveness and practical value of contrastive clustering and scheduling in AFL.
- 1 January 2026
- Published by Wiley in Applied Computational Intelligence and Soft Computing
- Vol. 2026 (1) , 4260698
Open AccessCC‐AFL: Contrastive Clustering–Based Asynchronous Federated Learning With Dynamic Client Scheduling for Industrial Defect Detection
The non‐independent and identically distributed (non‐IID) nature of data across different sites and the dynamic participation of client nodes represent two critical challenges faced by distributed industrial visual defect detection systems. While asynchronous federated learning (AFL) reduces training inefficiencies, its asynchronous update process makes the global model more vulnerable to data heterogeneity. This research proposes a contrastive clustering–based asynchronous federated learning (CC‐AFL) framework. The method integrates contrastive learning into the client clustering process, working simultaneously across instance‐level and cluster‐level spaces to identify hidden similarity patterns among participating clients. The server maintains update queues for each cluster and then applies staleness‐weighted aggregation based on the combined timestamp. Meanwhile, the framework uses client scheduling based on cluster queue lengths, giving priority to clusters with fewer updates to balance update frequencies across different clusters. Without requiring raw data sharing, the framework achieves improvements in both convergence speed and stability of AFL under changing scenarios. On the furniture board dataset, CC‐AFL achieves better performance with an average area under the receiver operating characteristic curve (I‐AUROC) of 74.38%, showing a 2.22% improvement over AFL‐DCS under different non‐IID settings. Experimental results show that CC‐AFL maintains stable convergence under different conditions, confirming the effectiveness and practical value of contrastive clustering and scheduling in AFL.
- 30 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 36 (4) , 5173-5187
Revisiting Semantic Gap in U-Shaped Networks From a Performance Oriented Perspective: Quantification, Visualization, and Optimization
Automatic medical image segmentation is a fundamental component of computer-aided diagnosis. U-shaped networks (U-Nets) remain the most widely adopted architecture due to their suitability for the unique challenges of medical imaging. However, recent studies have shown that U-Nets fuse low-level visual features from the encoder with high-level semantic features from the decoder using direct skip connections (DSC), which are likely to degrade segmentation performance due to the semantic gap, thereby limiting their ability to meet high-precision clinical requirements. This paper revisits the semantic gap from a performance-oriented perspective and conceptualizes it as a learnable task. A key characteristic of this semantic gap is revealed through comprehensive quantification and visualization, demonstrating its significant negative impact on segmentation performance. Further analysis indicates that a contributing factor is the substantial channel noise present in low-level pixel features, which is transmitted to the decoder via DSC, thereby disrupting the modeling of high-level semantic representations. In response, this paper proposes a self-disambiguating skip connection (SDSC), which incorporates a self-guided filter leveraging spatial features for channel filtering, a multi-layer fusion Transformer to capture long-range contextual dependencies, and Jensen-Shannon divergence as a constraint to enhance learning. The proposed method, referred to as SDSC-UNet, is evaluated through extensive experiments on four challenging benchmarks. The results demonstrate that replacing DSC with our SDSC yields an improvement of 5.91% in mean Intersection over Union (mIoU), 4.58% in Dice coefficient, and 1.32 in Hausdorff Distance, achieving state-of-the-art performance and highlighting the effectiveness of SDSC.
- 30 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 36 (4) , 5173-5187
Revisiting Semantic Gap in U-Shaped Networks From a Performance Oriented Perspective: Quantification, Visualization, and Optimization
Automatic medical image segmentation is a fundamental component of computer-aided diagnosis. U-shaped networks (U-Nets) remain the most widely adopted architecture due to their suitability for the unique challenges of medical imaging. However, recent studies have shown that U-Nets fuse low-level visual features from the encoder with high-level semantic features from the decoder using direct skip connections (DSC), which are likely to degrade segmentation performance due to the semantic gap, thereby limiting their ability to meet high-precision clinical requirements. This paper revisits the semantic gap from a performance-oriented perspective and conceptualizes it as a learnable task. A key characteristic of this semantic gap is revealed through comprehensive quantification and visualization, demonstrating its significant negative impact on segmentation performance. Further analysis indicates that a contributing factor is the substantial channel noise present in low-level pixel features, which is transmitted to the decoder via DSC, thereby disrupting the modeling of high-level semantic representations. In response, this paper proposes a self-disambiguating skip connection (SDSC), which incorporates a self-guided filter leveraging spatial features for channel filtering, a multi-layer fusion Transformer to capture long-range contextual dependencies, and Jensen-Shannon divergence as a constraint to enhance learning. The proposed method, referred to as SDSC-UNet, is evaluated through extensive experiments on four challenging benchmarks. The results demonstrate that replacing DSC with our SDSC yields an improvement of 5.91% in mean Intersection over Union (mIoU), 4.58% in Dice coefficient, and 1.32 in Hausdorff Distance, achieving state-of-the-art performance and highlighting the effectiveness of SDSC.
- 28 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 21 (6) , 4388-4399
Small Object Few-Shot Segmentation for Vision-Based Industrial Inspection
Vision-based industrial inspection (VII) aims to locate defects quickly and accurately. Supervised learning under a close-set setting and industrial anomaly detection, as two common paradigms in VII, face different problems in practical applications. The former is that various and sufficient defects are difficult to obtain, while the latter is that specific defects cannot be located. To solve these problems, in this article, we focus on the few-shot semantic segmentation (FSS) method, which can locate unseen defects conditioned on a few annotations without retraining. Compared to common objects in natural images, the defects in VII are small. This brings two problems to current FSS methods: first, distortion of target semantics and second, many false positives for backgrounds. To alleviate these problems, we propose a small object few-shot segmentation (SOFS) model. The key idea for alleviating, first, is to avoid the resizing of the original image and correctly indicate the intensity of target semantics. SOFS achieves this idea via the nonresizing procedure and the prototype intensity downsampling of support annotations. To alleviate, second, we design an abnormal prior map in SOFS to guide the model in reducing false positives and propose a mixed normal dice loss to prevent the model from predicting false positives preferentially. SOFS can achieve FSS and few-shot anomaly detection determined by support masks. Diverse experiments substantiate the superior performance of SOFS.
- 28 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 21 (6) , 4388-4399
Small Object Few-Shot Segmentation for Vision-Based Industrial Inspection
Vision-based industrial inspection (VII) aims to locate defects quickly and accurately. Supervised learning under a close-set setting and industrial anomaly detection, as two common paradigms in VII, face different problems in practical applications. The former is that various and sufficient defects are difficult to obtain, while the latter is that specific defects cannot be located. To solve these problems, in this article, we focus on the few-shot semantic segmentation (FSS) method, which can locate unseen defects conditioned on a few annotations without retraining. Compared to common objects in natural images, the defects in VII are small. This brings two problems to current FSS methods: first, distortion of target semantics and second, many false positives for backgrounds. To alleviate these problems, we propose a small object few-shot segmentation (SOFS) model. The key idea for alleviating, first, is to avoid the resizing of the original image and correctly indicate the intensity of target semantics. SOFS achieves this idea via the nonresizing procedure and the prototype intensity downsampling of support annotations. To alleviate, second, we design an abnormal prior map in SOFS to guide the model in reducing false positives and propose a mixed normal dice loss to prevent the model from predicting false positives preferentially. SOFS can achieve FSS and few-shot anomaly detection determined by support masks. Diverse experiments substantiate the superior performance of SOFS.
- 18 February 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 273
Class-agnostic adaptive feature adaptation method for anomaly detection of aero-engine blade
- 18 February 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 273
Class-agnostic adaptive feature adaptation method for anomaly detection of aero-engine blade
- 28 September 2024
- Published by Elsevier in Expert Systems with Applications
- Vol. 261
BiPC: Bidirectional Probability Calibration for Unsupervised Domain Adaption
- 28 September 2024
- Published by Elsevier in Expert Systems with Applications
- Vol. 261
BiPC: Bidirectional Probability Calibration for Unsupervised Domain Adaption
- 27 August 2024
- Published by Elsevier in Expert Systems with Applications
- Vol. 258
Superclass-aware visual feature disentangling for generalized zero-shot learning
- 27 August 2024
- Published by Elsevier in Expert Systems with Applications
- Vol. 258
Superclass-aware visual feature disentangling for generalized zero-shot learning
- 13 August 2024
- Published by Elsevier in Neurocomputing
- Vol. 606
Consistent representation joint adaptive adjustment for incremental zero-shot learning
- 13 August 2024
- Published by Elsevier in Neurocomputing
- Vol. 606
Consistent representation joint adaptive adjustment for incremental zero-shot learning
- 27 July 2024
- Published by Elsevier in Knowledge-Based Systems
- Vol. 301
Generalized zero-shot action recognition through reservation-based gate and semantic-enhanced contrastive learning
- 27 July 2024
- Published by Elsevier in Knowledge-Based Systems
- Vol. 301
Generalized zero-shot action recognition through reservation-based gate and semantic-enhanced contrastive learning