Kaijie Zhao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Kaijie Zhao has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Haitao Zhao
School of Information Science and Engineering, East China University of Science and Technology, Shanghai, China
8 shared publications - Jingchao Peng
School of Information Science and Engineering, East China University of Science and Technology, Shanghai, China
8 shared publications - Zhongze Wang
East China University of Science and Technology, Shanghai, China
8 shared publications - Lujian Yao
East China University of Science and Technology, Shanghai, China
7 shared publications - Zhengwei Hu
Automation Department, School of Information Science and Engineering, East China University of Science and Technology, Shanghai, China
2 shared publications
Latest Publications
- 3 November 2025
- Published by Elsevier in Knowledge-Based Systems
- Vol. 331
Bridging element fragmentation and inter-view discontinuity via directional geometric embeddings for cross-modal map construction
- 3 November 2025
- Published by Elsevier in Knowledge-Based Systems
- Vol. 331
Bridging element fragmentation and inter-view discontinuity via directional geometric embeddings for cross-modal map construction
- 20 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Pattern Analysis and Machine Intelligence
- Vol. 48 (2) , 1842-1859
Orthogonal Decoupling Contrastive Regularization: Toward Uncorrelated Feature Decoupling for Unpaired Image Restoration
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.
- 20 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Pattern Analysis and Machine Intelligence
- Vol. 48 (2) , 1842-1859
Orthogonal Decoupling Contrastive Regularization: Toward Uncorrelated Feature Decoupling for Unpaired Image Restoration
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.
- 15 April 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 281
PBMA: Enhancing 3D point cloud tracking with Point-to-Box Motion Augmentation
- 15 April 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 281
PBMA: Enhancing 3D point cloud tracking with Point-to-Box Motion Augmentation
- 7 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Instrumentation and Measurement
- Vol. 74 (00189456) , 1-11
Enhancing Point Cloud Tracking With Spatio-Temporal Triangle Optimization
Single Object Tracking (SOT) is a critical task in computer vision, playing a substantial role in fields such as autonomous driving. It represents a spatio-temporal learning challenge, aimed at tracking a designated target, indicated by a bounding box (BBox), in video sequences of 3D point cloud data. Recent developments in the target-motion-estimation (TME) paradigm for SOT have achieved significant performance improvements. This paradigm involves predicting the relative target motion (RTM), which captures the shifts in the target’s center and orientation between consecutive frames. However, existing TME-based methods utilize separate and complex optimizations to regress the RTM, with the RTM’s coordinates shift and rotation angle representing motion properties. Furthermore, RTM fails to offer a comprehensive representation of target motion, such as the motion patterns of objects with varying sizes and movement ranges. Additionally, the current paradigm for multiframe tracking is sensitive to noise and distractors, due to the unrobust proposal selection method based on point counting. To address these limitations, a spatio-temporal triangle optimization method is proposed. All optimization steps from existing TME-based methods are integrated into a spatio-temporal triangle optimization, simplifying the process and improving integration. Diagonals (BBox corners) are used to denote the BBox parameters, allowing the RTM to be represented as a spatiotemporal area swept by diagonals, thus providing a consistent motion measurement and comprehensive motion patterns. A novel proposal selection method is introduced, selecting proposals based on the highest Intersection over Union (IoU) with the ground truth (GT), ensuring more robust tracking in scenarios with multiple distractors. Extensive experiments demonstrate that the proposed spatio-temporal triangle optimization method significantly enhances tracking performance, resulting in improvements of ↑1.5/↑2.2 on the KITTI dataset and ↑2.22/↑2.45 on nuScenes for the two-frame model, and ↑2.8/↑2.4 on KITTI and ↑3.46/↑4.47 on nuScenes for the multi-frame model, achieving state-of-the-art results on both datasets.
- 7 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Instrumentation and Measurement
- Vol. 74 (00189456) , 1-11
Enhancing Point Cloud Tracking With Spatio-Temporal Triangle Optimization
Single Object Tracking (SOT) is a critical task in computer vision, playing a substantial role in fields such as autonomous driving. It represents a spatio-temporal learning challenge, aimed at tracking a designated target, indicated by a bounding box (BBox), in video sequences of 3D point cloud data. Recent developments in the target-motion-estimation (TME) paradigm for SOT have achieved significant performance improvements. This paradigm involves predicting the relative target motion (RTM), which captures the shifts in the target’s center and orientation between consecutive frames. However, existing TME-based methods utilize separate and complex optimizations to regress the RTM, with the RTM’s coordinates shift and rotation angle representing motion properties. Furthermore, RTM fails to offer a comprehensive representation of target motion, such as the motion patterns of objects with varying sizes and movement ranges. Additionally, the current paradigm for multiframe tracking is sensitive to noise and distractors, due to the unrobust proposal selection method based on point counting. To address these limitations, a spatio-temporal triangle optimization method is proposed. All optimization steps from existing TME-based methods are integrated into a spatio-temporal triangle optimization, simplifying the process and improving integration. Diagonals (BBox corners) are used to denote the BBox parameters, allowing the RTM to be represented as a spatiotemporal area swept by diagonals, thus providing a consistent motion measurement and comprehensive motion patterns. A novel proposal selection method is introduced, selecting proposals based on the highest Intersection over Union (IoU) with the ground truth (GT), ensuring more robust tracking in scenarios with multiple distractors. Extensive experiments demonstrate that the proposed spatio-temporal triangle optimization method significantly enhances tracking performance, resulting in improvements of ↑1.5/↑2.2 on the KITTI dataset and ↑2.22/↑2.45 on nuScenes for the two-frame model, and ↑2.8/↑2.4 on KITTI and ↑3.46/↑4.47 on nuScenes for the multi-frame model, achieving state-of-the-art results on both datasets.
- 30 September 2024
- Published by Springer Nature
- p. 467-484
DSA: Discriminative Scatter Analysis for Early Smoke Segmentation
- 30 September 2024
- Published by Springer Nature
- p. 467-484
DSA: Discriminative Scatter Analysis for Early Smoke Segmentation
- 26 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Multimedia
- Vol. 26 (15209210) , 7673-7686
DFR-Net: Density Feature Refinement Network for Image Dehazing Utilizing Haze Density Difference
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.
- 26 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Multimedia
- Vol. 26 (15209210) , 7673-7686
DFR-Net: Density Feature Refinement Network for Image Dehazing Utilizing Haze Density Difference
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.
- 23 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Multimedia
- Vol. 26 (15209210) , 3007-3017
Object-Preserving Siamese Network for Single-Object Tracking on Point Clouds
Undoubtedly, the object is the primary factor in 3D single-object tracking (SOT) tasks. However, prior Siamese-based trackers overlook the adverse effects resulting from randomly dropped object points during backbone sampling, hindering the prediction of accurate bounding boxes (BBoxes). Therefore, developing an approach that maximizes the preservation of object points and their object-aware features is of the utmost significance. To address this, we propose an object-preserving Siamese network ( OPSNet ) that can effectively maintain object integrity and boost tracking performance. First, an object highlighting module amplifies the object-aware features and extracts discriminative features from the template and search area. Next, object-preserving sampling selects object candidates, obtains object-preserving search area seeds, and discards background points that have less impact on tracking. Finally, an object localization network accurately locates 3D BBoxes based on the object-preserving search area seeds. Extensive experiments demonstrate that the performance of OPSNet exceeds the state-of-the-art performance, achieving success gains of $\sim$ 9.4% and $\sim$ 2.5% on the
- 23 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Multimedia
- Vol. 26 (15209210) , 3007-3017
Object-Preserving Siamese Network for Single-Object Tracking on Point Clouds
Undoubtedly, the object is the primary factor in 3D single-object tracking (SOT) tasks. However, prior Siamese-based trackers overlook the adverse effects resulting from randomly dropped object points during backbone sampling, hindering the prediction of accurate bounding boxes (BBoxes). Therefore, developing an approach that maximizes the preservation of object points and their object-aware features is of the utmost significance. To address this, we propose an object-preserving Siamese network ( OPSNet ) that can effectively maintain object integrity and boost tracking performance. First, an object highlighting module amplifies the object-aware features and extracts discriminative features from the template and search area. Next, object-preserving sampling selects object candidates, obtains object-preserving search area seeds, and discards background points that have less impact on tracking. Finally, an object localization network accurately locates 3D BBoxes based on the object-preserving search area seeds. Extensive experiments demonstrate that the performance of OPSNet exceeds the state-of-the-art performance, achieving success gains of $\sim$ 9.4% and $\sim$ 2.5% on the
- 17 July 2023
- Published by Elsevier in Expert Systems with Applications
- Vol. 233
CourtNet: Dynamically balance the precision and recall rates in infrared small target detection
- 17 July 2023
- Published by Elsevier in Expert Systems with Applications
- Vol. 233
CourtNet: Dynamically balance the precision and recall rates in infrared small target detection