Bo Jiang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Bo Jiang has a total of 28 co-authors. Here are the top co-authors by number of shared publications:
- Guangming Lu
Harbin Institute of Technology, Shenzhen, Shenzhen, China
8 shared publications - Yao Lu
Department of Computer Science and Technology, Harbin Institute of Technology (Shenzhen), Shenzhen, China
7 shared publications - Huaibo Song
College of Mechanical and Electronic Engineering, Northwest A&F University, Yangling, Xianyang 712100, China
5 shared publications - Bob Zhang
University of Macau, Macau SAR, China
4 shared publications - David Zhang
The Chinese University of Hong Kong
3 shared publications Huaibo Song
College of Mechanical and Electronic Engineering, Northwest Agriculture and Forestry University, Yangling, China
2 shared publications
Latest Publications
- 7 February 2026
- Published by Elsevier in Pattern Recognition
- Vol. 176
CSAFNet: Cross-modal spatial alignment and fusion network for RGB-T crowd counting
- 7 February 2026
- Published by Elsevier in Pattern Recognition
- Vol. 176
CSAFNet: Cross-modal spatial alignment and fusion network for RGB-T crowd counting
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Image Processing
- Vol. 35, 9128-9142
Fuzzy-Clustering Attentive Network With Context-Aware Enhancement for Image Denoising
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Image Processing
- Vol. 35, 9128-9142
Fuzzy-Clustering Attentive Network With Context-Aware Enhancement for Image Denoising
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 36 (10) , 1
Clustered Adaptive Graph Priors Network for Few-shot Image Denoising
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 36 (10) , 1
Clustered Adaptive Graph Priors Network for Few-shot Image Denoising
- 17 November 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 301
HDFENet: High-frequency and dual-directional feature enhancement network for maize tassels counting
- 17 November 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 301
HDFENet: High-frequency and dual-directional feature enhancement network for maize tassels counting
- 4 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 35 (12) , 12564-12578
Adaptive Clustering and Frequency Division Network for Efficient Monocular Depth Estimation
Monocular depth estimation infers the relative depth of objects by analyzing visual cues in images, ultimately enhancing the comprehension of complex scenes in computer vision systems. Although existing Transformer architectures effectively capture long-range visual dependencies, two significant challenges persist: (a) insufficient integration of spatial context leads to inconsistent depth estimation, particularly under varying perspectives or lighting conditions; (b) the model’s difficulty in capturing global features hinders the parsing of subtle object differences, causing confusion in depth information and reducing sensitivity to variations in object distance and scene layout. To address the aforementioned issues, an Adaptive Clustering Mechanism (ACM) module coupled with a Deformable Frequency Division Fusion (DFDF) module was introduced. Specifically, the ACM module refines and adjusts features via cosine similarity, thereby enhancing cluster center similarity and stabilizing depth estimation. The DFDF module leverages frequency decomposition to extract differential features between objects, enhancing high-frequency information to improve the discrimination of subtle features. Integrating these components, the Frequency Division Adaptive Clustering Enhancement (FDACE) module emerges as the decoder’s core within the Adaptive Clustering and Frequency Division Network (ACFD-Net), facilitating both the precise generation of depth information and the efficient recovery of spatial resolution. Furthermore, we present a progressive depth estimation strategy that seamlessly integrates non-gradient output features from FDACE modules across various scales, and conducts independent optimizations, merging multi-scale information with localized details, and progressively calibrating depth estimates to enhance congruence with actual scenes. The ACM and DFDF modules concentrate on pivotal features, selectively enhancing high-frequency information, thereby minimizing redundant computations and optimizing resource allocation, which significantly boosts computational efficiency. Experimental results demonstrate that ACFD-Net significantly improves both the accuracy and efficiency of depth estimation. Code is released at https://github.com/Songlei7664/ACFD-Net.
- 4 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 35 (12) , 12564-12578
Adaptive Clustering and Frequency Division Network for Efficient Monocular Depth Estimation
Monocular depth estimation infers the relative depth of objects by analyzing visual cues in images, ultimately enhancing the comprehension of complex scenes in computer vision systems. Although existing Transformer architectures effectively capture long-range visual dependencies, two significant challenges persist: (a) insufficient integration of spatial context leads to inconsistent depth estimation, particularly under varying perspectives or lighting conditions; (b) the model’s difficulty in capturing global features hinders the parsing of subtle object differences, causing confusion in depth information and reducing sensitivity to variations in object distance and scene layout. To address the aforementioned issues, an Adaptive Clustering Mechanism (ACM) module coupled with a Deformable Frequency Division Fusion (DFDF) module was introduced. Specifically, the ACM module refines and adjusts features via cosine similarity, thereby enhancing cluster center similarity and stabilizing depth estimation. The DFDF module leverages frequency decomposition to extract differential features between objects, enhancing high-frequency information to improve the discrimination of subtle features. Integrating these components, the Frequency Division Adaptive Clustering Enhancement (FDACE) module emerges as the decoder’s core within the Adaptive Clustering and Frequency Division Network (ACFD-Net), facilitating both the precise generation of depth information and the efficient recovery of spatial resolution. Furthermore, we present a progressive depth estimation strategy that seamlessly integrates non-gradient output features from FDACE modules across various scales, and conducts independent optimizations, merging multi-scale information with localized details, and progressively calibrating depth estimates to enhance congruence with actual scenes. The ACM and DFDF modules concentrate on pivotal features, selectively enhancing high-frequency information, thereby minimizing redundant computations and optimizing resource allocation, which significantly boosts computational efficiency. Experimental results demonstrate that ACFD-Net significantly improves both the accuracy and efficiency of depth estimation. Code is released at https://github.com/Songlei7664/ACFD-Net.
- 25 June 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 293
Local plane estimation network with multi-scale fusion for efficient monocular depth estimation
- 25 June 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 293
Local plane estimation network with multi-scale fusion for efficient monocular depth estimation
- 28 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ASME Transactions on Mechatronics
- Vol. 29 (5) , 3324-3335
Force-Closure Analysis of Multilink Cable-Driven Redundant Manipulators Considering Cable Coupling and Friction Effects
Multilink cable-driven redundant manipulators (MCDRMs) offer numerous advantages over conventional manipulators, making them well suited for operation in narrow and confined environments. However, MCDRMs face limitations in terms of cable quantity and cable routing scheme, which are crucial for achieving full constraint. Force closure, a crucial parameter for evaluating the performance of MCDRMs, ensures that the manipulator can exert sufficient force and torque to stably perform tasks within its workspace. In this article, we propose a novel force-closure analysis method for MCDRMs that considers both cable coupling and friction effects. First, we utilize the Euler–Eytelwein equation to analyze the effect of friction between cables and cable routing holes on the tension of different cable subsegments. Then, utilizing the reciprocal screw theory, we elucidate the cable coupling in MCDRMs and calculate the active joint torques provided by the cable tension, as well as passive joint torques generated by external wrenches. Furthermore, we analyze the force closure of the MCDRM by balancing the passive and active joint torques. Finally, simulations and experiments are conducted using a planar MCDRM. The results demonstrate that the proposed method enables systematic and accurate analysis of the force closure of MCDRDs with arbitrary cable routing schemes.
- 28 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ASME Transactions on Mechatronics
- Vol. 29 (5) , 3324-3335
Force-Closure Analysis of Multilink Cable-Driven Redundant Manipulators Considering Cable Coupling and Friction Effects
Multilink cable-driven redundant manipulators (MCDRMs) offer numerous advantages over conventional manipulators, making them well suited for operation in narrow and confined environments. However, MCDRMs face limitations in terms of cable quantity and cable routing scheme, which are crucial for achieving full constraint. Force closure, a crucial parameter for evaluating the performance of MCDRMs, ensures that the manipulator can exert sufficient force and torque to stably perform tasks within its workspace. In this article, we propose a novel force-closure analysis method for MCDRMs that considers both cable coupling and friction effects. First, we utilize the Euler–Eytelwein equation to analyze the effect of friction between cables and cable routing holes on the tension of different cable subsegments. Then, utilizing the reciprocal screw theory, we elucidate the cable coupling in MCDRMs and calculate the active joint torques provided by the cable tension, as well as passive joint torques generated by external wrenches. Furthermore, we analyze the force closure of the MCDRM by balancing the passive and active joint torques. Finally, simulations and experiments are conducted using a planar MCDRM. The results demonstrate that the proposed method enables systematic and accurate analysis of the force closure of MCDRDs with arbitrary cable routing schemes.
- 9 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 20 (3) , 4753-4764
AGP-Net: Adaptive Graph Prior Network for Image Denoising
Image denoising is a critical problem in industrial information applications since noisy images can have adverse effects on the performance of many industrial tasks. Currently, Transformer structures and graph convolutional networks (GCNs) have been widely employed in image denoising to capture long-range dependencies for the performance promotion. These methods, however, severely suffer from three major problems. Initially, the long-range dependencies captured by Transformers and GCNs are only focused on the pixel level and patch level, respectively. This leads to the coarse retrieved feature, hindering further performance promotion. In addition, due to the limited training data, especially for the noisy images with highly diverse and complex noise, the denoising process may lack sufficient feature for reconstructing denoised images. Eventually, the limited training data may also results in over-fitting, leading to poor generalization in the denoising process. This article first proposes adaptive graph prior network (AGP-Net) using a novel graph construction method to capture the long-range dependencies on both the pixel and patch levels. Then, we propose graph supplementary prior and graph noise prior in AGP-Net to adaptively generate supplementary feature and regularization noise for improving the performance and generalization of image denoising. Extensive ablation and benchmark tests show our AGP-Net achieve the most advanced image denoising performance.
- 9 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 20 (3) , 4753-4764
AGP-Net: Adaptive Graph Prior Network for Image Denoising
Image denoising is a critical problem in industrial information applications since noisy images can have adverse effects on the performance of many industrial tasks. Currently, Transformer structures and graph convolutional networks (GCNs) have been widely employed in image denoising to capture long-range dependencies for the performance promotion. These methods, however, severely suffer from three major problems. Initially, the long-range dependencies captured by Transformers and GCNs are only focused on the pixel level and patch level, respectively. This leads to the coarse retrieved feature, hindering further performance promotion. In addition, due to the limited training data, especially for the noisy images with highly diverse and complex noise, the denoising process may lack sufficient feature for reconstructing denoised images. Eventually, the limited training data may also results in over-fitting, leading to poor generalization in the denoising process. This article first proposes adaptive graph prior network (AGP-Net) using a novel graph construction method to capture the long-range dependencies on both the pixel and patch levels. Then, we propose graph supplementary prior and graph noise prior in AGP-Net to adaptively generate supplementary feature and regularization noise for improving the performance and generalization of image denoising. Extensive ablation and benchmark tests show our AGP-Net achieve the most advanced image denoising performance.
- 21 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 53 (11) , 7077-7088
Graph Attention in Attention Network for Image Denoising
Image denoising aims to remove the noise from noisy images. With the increasing complexity of the noise within the noisy images, current denoising methods cannot satisfactorily address this issue. This article proposes a graph attention in attention network (GAiA-Net) for image denoising. First, we introduce a novel approach to graph construction for the GAiA-Net. In the process of such graph construction, the noisy images are divided into patches to formulate the nodes in a graph. The edges are initialized using $ k $ -nearest neighbors. Hence, through iterative transformation and learning, both the pixel-level and structure-level features can be captured by different information exchanges and aggregation within (pixel-level) and outside (structure-level) of the nodes, respectively. Second, we propose the graph attention in attention (GAiA) in the GAiA-Net. The proposed GAiA produces the pixel-level attention within nodes to be further induced to the nodes with various distances to generate the final attention. Therefore, our GAiA-Net can capture the long dependencies on both the pixel-level and structure-level features, which can effectively reduce the complex noise in the denoising process. Comprehensive experiments demonstrate that the proposed GAiA-Net produces state-of-the-art performances on both synthetic noise image and real noise image datasets. Especially, when experimenting on complex noisy Nam datasets, our GAiA-Net achieves a PSNR of 40.40 dB and SSIM of 0.989. These results prove the satisfactory potential and effectiveness of our GAiA-Net.
- 21 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 53 (11) , 7077-7088
Graph Attention in Attention Network for Image Denoising
Image denoising aims to remove the noise from noisy images. With the increasing complexity of the noise within the noisy images, current denoising methods cannot satisfactorily address this issue. This article proposes a graph attention in attention network (GAiA-Net) for image denoising. First, we introduce a novel approach to graph construction for the GAiA-Net. In the process of such graph construction, the noisy images are divided into patches to formulate the nodes in a graph. The edges are initialized using $ k $ -nearest neighbors. Hence, through iterative transformation and learning, both the pixel-level and structure-level features can be captured by different information exchanges and aggregation within (pixel-level) and outside (structure-level) of the nodes, respectively. Second, we propose the graph attention in attention (GAiA) in the GAiA-Net. The proposed GAiA produces the pixel-level attention within nodes to be further induced to the nodes with various distances to generate the final attention. Therefore, our GAiA-Net can capture the long dependencies on both the pixel-level and structure-level features, which can effectively reduce the complex noise in the denoising process. Comprehensive experiments demonstrate that the proposed GAiA-Net produces state-of-the-art performances on both synthetic noise image and real noise image datasets. Especially, when experimenting on complex noisy Nam datasets, our GAiA-Net achieves a PSNR of 40.40 dB and SSIM of 0.989. These results prove the satisfactory potential and effectiveness of our GAiA-Net.