Junzhu Mao

Junzhu Mao

Auto-generated profile, based on publicly available information

Junzhu Mao

Nanjing University of Science and Technology

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
6 April 2023 in IEEE Transactions on Multimedia
Verified
Journal Article
Closed access
JMJunzhu Mao
Junzhu Mao
YYYazhou Yao
Yazhou Yao
ZSZeren Sun
Zeren Sun
XHXingguo Huang
Xingguo Huang
FSFumin Shen
Fumin Shen
HSHeng-Tao Shen
Heng-Tao Shen
Due to its significant capability of modeling long-range dependencies, vision transformer (ViT) has achieved promising success in both holistic and occluded person re-identification (Re-ID) tasks. However, the inherent problems of transformers such as the huge computational cost and memory footprint are still two unsolved issues that will block the deployment of ViT based person Re-ID models on resource-limited edge devices. Our goal is to reduce both the inference complexity and model size without sacrificing the comparable accuracy on person Re-ID, especially for tasks with occlusion. To this end, we propose a novel attention map guided (AMG) transformer pruning method, which removes both redundant tokens and heads with the guidance of the attention map in a hardware-friendly way. We first calculate the entropy in the key dimension and sum it up for the whole map, and the corresponding head parameters of maps with high entropy will be removed for model size reduction. Then we combine the similarity and first-order gradients of key tokens along the query dimension for token importance estimation and remove redundant key and value tokens to further reduce the inference complexity. Comprehensive experiments on Occluded DukeMTMC and Market-1501 demonstrate the effectiveness of our proposals. For example, our proposed pruning strategy on ViT-Base enjoys 29.4% FLOPs savings with 0.2% drop on Rank-1 and 0.4% improvement on mAP, respectively. Code and models have been made available at https://github.com/NUST-Machine-Intelligence-Laboratory/AMG .

27 January 2025 in IEEE Transactions on Multimedia
Verified
Journal Article
Closed access
JMJunzhu Mao
Junzhu Mao
YSYang Shen
Yang Shen
Jinyang GuoJinyang Guo
Jinyang Guo
YYYazhou Yao
Yazhou Yao
XHXiansheng Hua
Xiansheng Hua
HSHengtao Shen
Hengtao Shen
Token compression is essential for reducing the computational and memory requirements of transformer models, enabling their deployment in resource-constrained environments. In this work, we propose an efficient and hardware-compatible token compression method called Prune and Merge. Our approach integrates token pruning and merging operations within transformer models to achieve layer-wise token compression. By introducing trainable merge and reconstruct matrices and utilizing shortcut connections, we efficiently merge tokens while preserving important information and enabling the restoration of pruned tokens. Additionally, we introduce a novel gradient-weighted attention scoring mechanism that computes token importance scores during the training phase, eliminating the need for separate computations during inference and enhancing compression efficiency. We also leverage gradient information to capture the global impact of tokens and automatically identify optimal compression structures. Extensive experiments on the ImageNet-1k and ADE20K datasets validate the effectiveness of our approach, achieving significant speed-ups with minimal accuracy degradation compared to state-of-the-art methods. For instance, on DeiT-Small, we achieve a 1.64× speed-up with only a 0.2% drop in accuracy on ImageNet-1k. Moreover, by compressing segmenter models and comparing with existing methods, we demonstrate the superior performance of our approach in terms of efficiency and effectiveness. Code and models have been made available at https://github.com/NUST-Machine-Intelligence-Laboratory/prune_and_merge.

12 September 2026
Verified
Book Chapter
Closed access
PDF file
HGHaowen Gu
Haowen Gu
GPGensheng Pei
Gensheng Pei
JMJunzhu Mao
Junzhu Mao
QWQiong Wang
Qiong Wang
MRMingwu Ren
Mingwu Ren
YYYazhou Yao
Yazhou Yao

12 September 2026
Verified
Book Chapter
Closed access
PDF file
ZYZhenyu Yang
Zhenyu Yang
GPGensheng Pei
Gensheng Pei
JMJunzhu Mao
Junzhu Mao
XCXinhao Cai
Xinhao Cai
TCTao Chen
Tao Chen
YYYazhou Yao
Yazhou Yao

30 July 2025 in IEEE Transactions on Consumer Electronics
Verified
Journal Article
Closed access
SYShuai Yan
Shuai Yan
WZWang Zhang
Wang Zhang
SPShiyu Peng
Shiyu Peng
JMJunzhu Mao
Junzhu Mao
TCTao Chen
Tao Chen
YYYazhou Yao
Yazhou Yao
Automated battery defect detection is essential for ensuring quality and safety in consumer electronics manufacturing, enabling enhanced edge-level decision-making and operational efficiency. However, existing methods struggle to achieve both high accuracy and real-time performance required by edge-based industrial scenarios. This paper introduces a lightweight, multi-domain feature integration approach designed specifically for edge deployment, significantly enhancing the practical applicability of battery defect classification. Firstly, a bilateral scanning projection module is developed for precise and rapid battery localization, segmenting battery images efficiently into inner circle, inner ring, and outer ring regions. Subsequently, a spatial-statistical feature fusion module effectively captures structural defects in the spatial domain. To streamline feature extraction and ensure consistent classification accuracy, the annular regions undergo polar coordinate transformation, resulting in simplified geometric representation. Additionally, we propose a frequency-enhanced optimization strategy tailored for lightweight edge networks, utilizing Fast Fourier Transform and frequency filtering methods to accurately identify complex texture defects. To further meet real-time requirements and minimize computational overhead, we apply Taylor pruning techniques to optimize network performance, facilitating efficient deployment using the OpenVINO framework on edge devices. The proposed lightweight AI framework achieves a classification accuracy of 98.8% while maintaining a rapid inference speed of 20ms per image, substantially outperforming current battery defect detection approaches and demonstrating significant potential for edge-enhanced decision-making in consumer electronics manufacturing. Our code is available at https://github.com/NUST-Machine-Intelligence-Laboratory/MDFI.

17 December 2025 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
JMJunzhu Mao
Junzhu Mao
ZSZeren Sun
Zeren Sun
YYYazhou Yao
Yazhou Yao
Tianfei ZhouTianfei Zhou
Tianfei Zhou
LNLiqiang Nie
Liqiang Nie
XHXiansheng Hua
Xiansheng Hua
The substantial successes achieved by diffusion probabilistic models have prompted the study of their employment in resource-limited scenarios. Pruning methods have been proven effective in compressing discriminative models relying on the correlation between training losses and model performances. However, diffusion models employ an iterative process for generating high-quality images, leading to a breakdown of such connections. To address this challenge, we propose a simple yet effective method, named NiCI-Pruning (Noise in Clean Image Pruning), for the compression of diffusion models. NiCI-Pruning capitalizes the noise predicted by the model based on clean image inputs, favoring it as a feature for establishing reconstruction losses. Accordingly, Taylor expansion is employed for the proposed reconstruction loss to evaluate the parameter importance effectively. Moreover, we propose an interval sampling strategy that incorporates a timestep-weighted schema, alleviating the risk of misleading information obtained at later timesteps. We provide comprehensive experimental results to affirm the superiority of our proposed approach. Notably, our method achieves a remarkable average reduction of 30.4% in FID score increase across five different datasets compared to the state-of-the-art diffusion pruning method at equivalent pruning rates. Our code and models have been made available at https://github.com/ NUST-Machine-Intelligence-Laboratory/NiCI-Pruning.