Bangjun Wang
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
Bangjun Wang has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Fanzhang Li
School of Computer Science & Technology, Soochow University, Suzhou, China
4 shared publications - Fei Zhu
School of Computer Science and Technology, Soochow University, Suzhou, Jiangsu, 215006, China
3 shared publications Fanzhang Li
Beijing Jiaotong University
2 shared publicationsLi Zhang
School of Computer Science and Technology, Soochow University Suzhou 215006 People's Republic of China
2 shared publications- Li Zhang
School of Computer Science and Technology, Soochow University, Suzhou, China
2 shared publications - Quan Liu
School of Computer Science and Technology, Soochow University, Suzhou, China
2 shared publications
Latest Publications
- 16 June 2026
- Published by Elsevier in Neurocomputing
- Vol. 698
Skill extraction facilitated by meta-policy fine-tuned with multi-task
- 16 June 2026
- Published by Elsevier in Neurocomputing
- Vol. 698
Skill extraction facilitated by meta-policy fine-tuned with multi-task
- Open Access
- 28 May 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Multimedia Computing, Communications, and Applications
Complementarily Learning Decoupled Category-Region-aware Prototype for Few-shot Classification
Open-world few-shot classification is restricted by inadequate image-level content representation capabilities when the training and testing sets have significant differences in categories. Recently, many studies show the effectiveness of deep local descriptor-based methods, which attempt to select out dominating contents and discard noisy ones. However, aforementioned methods focus more on external relevance of support and query sets to filter features and ignore internal relevance among support sets, leading to unsatisfying classification performance. To relieve the issue, in this paper, we propose the complementary learning Decoupling Category-Region-aware Network (DCRNet) to simultaneously learn the correlation between internal members, and then interact with the external sets. Specifically, we first propose an effective learnable Category Prototype-generated Feature Decoupling Module (CPFDM) to mine co-existing representations and generate comprehensive global class prototype. Then, to adaptively filter out discriminative local descriptors, we present a Category-Aware Selection Module (CASM) and introduce the Category-Aware Contrastive Loss (CACL) to highlight local information that is highly relative to the current category. In addition, the Region-Aware Contrastive Loss (RACL) is designed to encourage the model to concentrate on local regions, yielding powerful ability to distinguish foreground regions from between various categories. Finally, we leverage the filtered support descriptors to adaptively refine query descriptors through the descriptor selection strategy. Extensive experiments demonstrate that the proposed solution outperforms state-of-the-arts on five mainstream general and fine-grained Few-shot Classification datasets. We have released the training and testing code on https://github.com/jjfang007/DCRNet .
- 28 May 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Multimedia Computing, Communications, and Applications
Open AccessComplementarily Learning Decoupled Category-Region-aware Prototype for Few-shot Classification
Open-world few-shot classification is restricted by inadequate image-level content representation capabilities when the training and testing sets have significant differences in categories. Recently, many studies show the effectiveness of deep local descriptor-based methods, which attempt to select out dominating contents and discard noisy ones. However, aforementioned methods focus more on external relevance of support and query sets to filter features and ignore internal relevance among support sets, leading to unsatisfying classification performance. To relieve the issue, in this paper, we propose the complementary learning Decoupling Category-Region-aware Network (DCRNet) to simultaneously learn the correlation between internal members, and then interact with the external sets. Specifically, we first propose an effective learnable Category Prototype-generated Feature Decoupling Module (CPFDM) to mine co-existing representations and generate comprehensive global class prototype. Then, to adaptively filter out discriminative local descriptors, we present a Category-Aware Selection Module (CASM) and introduce the Category-Aware Contrastive Loss (CACL) to highlight local information that is highly relative to the current category. In addition, the Region-Aware Contrastive Loss (RACL) is designed to encourage the model to concentrate on local regions, yielding powerful ability to distinguish foreground regions from between various categories. Finally, we leverage the filtered support descriptors to adaptively refine query descriptors through the descriptor selection strategy. Extensive experiments demonstrate that the proposed solution outperforms state-of-the-arts on five mainstream general and fine-grained Few-shot Classification datasets. We have released the training and testing code on https://github.com/jjfang007/DCRNet .
- 21 February 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 274
Conservative reward enhancement through the nearest neighbor integration in model-based Offline Policy Optimization
- 21 February 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 274
Conservative reward enhancement through the nearest neighbor integration in model-based Offline Policy Optimization
- 30 October 2023
- Published by Elsevier in Expert Systems with Applications
- Vol. 238
Personalized federated reinforcement learning: Balancing personalization and experience sharing via distance constraint
- 30 October 2023
- Published by Elsevier in Expert Systems with Applications
- Vol. 238
Personalized federated reinforcement learning: Balancing personalization and experience sharing via distance constraint
- 1 September 2018
- Published by Elsevier in Pattern Recognition
- Vol. 81, 388-403
Feature weight estimation based on dynamic representation and neighbor sparse reconstruction
- 1 September 2018
- Published by Elsevier in Pattern Recognition
- Vol. 81, 388-403
Feature weight estimation based on dynamic representation and neighbor sparse reconstruction
- 26 October 2017
- Published by Springer Nature
- p. 510-519
Low-Frequency Representation for Face Recognition
- 26 October 2017
- Published by Springer Nature
- p. 510-519
Low-Frequency Representation for Face Recognition
- Open Access
- 4 October 2017
- Published by Institution of Engineering and Technology (IET) in IET Image Processing
- Vol. 11 (11) , 1050-1058
Supervised orthogonal discriminant projection based on double adjacency graphs for image classification
This study proposes a supervised orthogonal discriminant projection (SODP) based on double adjacency graphs (DAGs). SODP based on DAG (SODP‐DAG) aims to minimise the local within‐class scatter and simultaneously maximise both the local between‐class scatter and the non‐local scatter, where the local between‐class scatter and the local within‐class scatter are constructed by applying the DAG structure. By doing so, SODP‐DAG can keep the local within‐class structure for original data and find the optimal discriminant directions effectively. Moreover, four schemes are designed for constructing weight matrices in SODP‐DAG. To validate the performance of SODP‐DAG, the authors compared it with orthogonal discriminant projection, SODP and others on several publicly available datasets. Experimental results show the feasibility and effectiveness of SODP‐DAG.
- 4 October 2017
- Published by Institution of Engineering and Technology (IET) in IET Image Processing
- Vol. 11 (11) , 1050-1058
Open AccessSupervised orthogonal discriminant projection based on double adjacency graphs for image classification
This study proposes a supervised orthogonal discriminant projection (SODP) based on double adjacency graphs (DAGs). SODP based on DAG (SODP‐DAG) aims to minimise the local within‐class scatter and simultaneously maximise both the local between‐class scatter and the non‐local scatter, where the local between‐class scatter and the local within‐class scatter are constructed by applying the DAG structure. By doing so, SODP‐DAG can keep the local within‐class structure for original data and find the optimal discriminant directions effectively. Moreover, four schemes are designed for constructing weight matrices in SODP‐DAG. To validate the performance of SODP‐DAG, the authors compared it with orthogonal discriminant projection, SODP and others on several publicly available datasets. Experimental results show the feasibility and effectiveness of SODP‐DAG.
- 8 September 2015
- Published by Springer Nature in Pattern Analysis and Applications
- Vol. 20 (2) , 495-506
Spectral clustering based on similarity and dissimilarity criterion
- 8 September 2015
- Published by Springer Nature in Pattern Analysis and Applications
- Vol. 20 (2) , 495-506
Spectral clustering based on similarity and dissimilarity criterion