Shoudong Han
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Shoudong Han has a total of 67 co-authors. Here are the top co-authors by number of shared publications:
- En Yu
Huazhong University of Science and Technology
6 shared publications Huilin Ding
Huazhong University of Science and Technology
5 shared publicationsChenfei Xia
3 shared publicationsHongwei Wang
3 shared publicationsMengyu He
3 shared publicationsZhuoling Li
Tsinghua University
3 shared publications
Latest Publications
- 21 October 2026
- Published by Elsevier in Pattern Recognition
- Vol. 183
VOGUE: Sequence-adaptive online graph tracking with virtual long-term memory
- 21 October 2026
- Published by Elsevier in Pattern Recognition
- Vol. 183
VOGUE: Sequence-adaptive online graph tracking with virtual long-term memory
- 11 April 2026
- Published by Elsevier in Neurocomputing
- Vol. 685
Focusing on temporal feature variations: Improving the adaptability of Re-identification in multi-object tracking
- 11 April 2026
- Published by Elsevier in Neurocomputing
- Vol. 685
Focusing on temporal feature variations: Improving the adaptability of Re-identification in multi-object tracking
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Multimedia
- Vol. 28, 14470-14481
SCING: Toward More Efficient and Robust Person Re-Identification Through Selective Cross-Modal Prompt Tuning
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Multimedia
- Vol. 28, 14470-14481
SCING: Toward More Efficient and Robust Person Re-Identification Through Selective Cross-Modal Prompt Tuning
- 20 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 35 (10) , 10367-10381
DfTrack: Deconfused Data Association Framework for Multi-Object Tracking
Accurate data association plays a crucial role in Multi-Object Tracking (MOT) as it helps reduce confusion such as identity switches and assignment errors. However, many existing advanced methods often overlook the diversity among trajectories and the ambiguity and conflicts present in various types of cues. Consequently, when performing simple global data association, confusion arises between detections, trajectories, and associations. To address this problem, we propose a simple, versatile, and highly interpretable Deconfused Data Association Framework (DDAF). DDAF decomposes the traditional association problem into multiple sub-problems using a series of non-learnable modules, and selectively resolves confusion in each sub-problem by strategically utilizing new cues. Building upon DDAF, we design a powerful multi-object tracker named DfTrack, which specifically targets confusion in MOT. Furthermore, we discuss different specific implementations of DDAF to tackle challenging environments characterized by low frame rate, camera motion, and cross-domain scenarios. Correspondingly, we also develop several variants of DfTrack, demonstrating the remarkable scalability and adaptability of DDAF. Extensive experiments conducted on the MOT17, MOT20, and DanceTrack datasets demonstrate that DDAF significantly outperforms simple global association methods, and its variants can adapt to various challenging environments. Furthermore, DfTrack achieves state-of-the-art performance on multiple datasets, with HOTA of 65.2%, 63.9%, and 64.4% on MOT17, MOT20, and DanceTrack, respectively. The DfTrack-Hybrid variant further improves the performance on this basis. These results validate that our DDAF can effectively decompose and resolve various confusion in global association without any learning cost.
- 20 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 35 (10) , 10367-10381
DfTrack: Deconfused Data Association Framework for Multi-Object Tracking
Accurate data association plays a crucial role in Multi-Object Tracking (MOT) as it helps reduce confusion such as identity switches and assignment errors. However, many existing advanced methods often overlook the diversity among trajectories and the ambiguity and conflicts present in various types of cues. Consequently, when performing simple global data association, confusion arises between detections, trajectories, and associations. To address this problem, we propose a simple, versatile, and highly interpretable Deconfused Data Association Framework (DDAF). DDAF decomposes the traditional association problem into multiple sub-problems using a series of non-learnable modules, and selectively resolves confusion in each sub-problem by strategically utilizing new cues. Building upon DDAF, we design a powerful multi-object tracker named DfTrack, which specifically targets confusion in MOT. Furthermore, we discuss different specific implementations of DDAF to tackle challenging environments characterized by low frame rate, camera motion, and cross-domain scenarios. Correspondingly, we also develop several variants of DfTrack, demonstrating the remarkable scalability and adaptability of DDAF. Extensive experiments conducted on the MOT17, MOT20, and DanceTrack datasets demonstrate that DDAF significantly outperforms simple global association methods, and its variants can adapt to various challenging environments. Furthermore, DfTrack achieves state-of-the-art performance on multiple datasets, with HOTA of 65.2%, 63.9%, and 64.4% on MOT17, MOT20, and DanceTrack, respectively. The DfTrack-Hybrid variant further improves the performance on this basis. These results validate that our DDAF can effectively decompose and resolve various confusion in global association without any learning cost.
- Open Access
- 1 May 2025
- Published by KEAI Publishing in Fundamental Research
- Vol. 5 (3) , 1214-1220
ORT: Occlusion-robust for multi-object tracking
Although the joint-detection-and-tracking paradigm has promoted the development of multi-object tracking (MOT) significantly, the long-term occlusion problem is still unsolved. After a period of trajectory inactivation due to occlusion, it is difficult to achieve trajectory reconnection with appearance features because they are no longer reliable. Although using motion cues does not suffer from occlusion, the commonly used Kalman Filter is also ineffective in its long-term inertia prediction in cases of no observation updates or wrong updates. Besides, occlusion is prone to cause multiple track-detection pairs to have close similarity scores during the data association phase. The direct use of the Hungarian algorithm to give the global optimal solution may generate the identity switching problem. In this paper, we propose the Long-term Spatio-Temporal Prediction (LSTP) module and the Ordered Association (OA) module to alleviate the occlusion problem in terms of motion prediction and data association, respectively. The LSTP module estimates the states of all tracked objects over time using a combination of spatial and temporal Transformers. The spatial Transformer models crowd interaction and learns the influence of neighbors, while the temporal Transformer models the temporal continuity of historical trajectories. Besides, the LSTP module also predicts the visibilities of the motion prediction boxes, which denote the occlusion attributes of trajectories. Based on the occlusion attribute and active state, the association priority is defined in the OA module to associate trajectories in order, which helps to alleviate the identity switching problem. Comprehensive experiments on the MOT17 and MOT20 benchmarks indicate the superiority of the proposed MOT framework, namely Occlusion-Robust Tracker (ORT). Without using any appearance information, our ORT can achieve competitive performance beyond other state-of-the-art trackers in terms of trajectory accuracy and purity.
- 1 May 2025
- Published by KEAI Publishing in Fundamental Research
- Vol. 5 (3) , 1214-1220
Open AccessORT: Occlusion-robust for multi-object tracking
Although the joint-detection-and-tracking paradigm has promoted the development of multi-object tracking (MOT) significantly, the long-term occlusion problem is still unsolved. After a period of trajectory inactivation due to occlusion, it is difficult to achieve trajectory reconnection with appearance features because they are no longer reliable. Although using motion cues does not suffer from occlusion, the commonly used Kalman Filter is also ineffective in its long-term inertia prediction in cases of no observation updates or wrong updates. Besides, occlusion is prone to cause multiple track-detection pairs to have close similarity scores during the data association phase. The direct use of the Hungarian algorithm to give the global optimal solution may generate the identity switching problem. In this paper, we propose the Long-term Spatio-Temporal Prediction (LSTP) module and the Ordered Association (OA) module to alleviate the occlusion problem in terms of motion prediction and data association, respectively. The LSTP module estimates the states of all tracked objects over time using a combination of spatial and temporal Transformers. The spatial Transformer models crowd interaction and learns the influence of neighbors, while the temporal Transformer models the temporal continuity of historical trajectories. Besides, the LSTP module also predicts the visibilities of the motion prediction boxes, which denote the occlusion attributes of trajectories. Based on the occlusion attribute and active state, the association priority is defined in the OA module to associate trajectories in order, which helps to alleviate the identity switching problem. Comprehensive experiments on the MOT17 and MOT20 benchmarks indicate the superiority of the proposed MOT framework, namely Occlusion-Robust Tracker (ORT). Without using any appearance information, our ORT can achieve competitive performance beyond other state-of-the-art trackers in terms of trajectory accuracy and purity.
- 5 February 2025
- Published by Springer Nature
- p. 179-187
AM-SCNet: Activation Mask Sparse Convolutional Network for Skeleton-Based Action Recognition
- 5 February 2025
- Published by Springer Nature
- p. 179-187
AM-SCNet: Activation Mask Sparse Convolutional Network for Skeleton-Based Action Recognition
- 5 February 2025
- Published by Springer Nature
- p. 238-246
Pedestrian Attribute Distillation Fusion Model
- 6 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Sensors Journal
- Vol. 25 (4) , 6894-6904
Enhance Heads in Vision Transformer for Occluded Person Re-Identification
Occlusion scenarios pose a great challenge to person re-identification (ReID) task because various occlusions may weaken the discriminative features and introduce interference. Recently, Transformer-based networks, which can aggregate features of all the image patches to construct global features adaptively, have shown advantages in occluded person ReID. Existing methods mainly adopted Transformer as a feature extractor and enhanced local features from the output of the Transformer encoder. However, during the processing of self-attention blocks, disturbing features from occlusions may be diffused into all the tokens, making it difficult to enhance local features effectively. On the other hand, the different heads in self-attention remain isolated during image encoding. Therefore, we consider applying feature enhancement strategies in the channel dimensions instead of the spatial dimensions. First, we divide the heads into groups to enhance diversity and strengthen the robustness of some patterns in occlusion scenarios. Then during training we iteratively suppress the most salient patterns, forcing the model to mine more salient patterns. Finally, we assign adaptive weights for different head groups to compute a robust distance matrix. Our method enhances the model’s ability to extract discriminative and diverse head features and achieves the state-of-the-art performance on occluded person ReID benchmarks, e.g. , Rank-1 of 73.2% on Occluded-DukeMTMC.
- 6 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Sensors Journal
- Vol. 25 (4) , 6894-6904
Enhance Heads in Vision Transformer for Occluded Person Re-Identification
Occlusion scenarios pose a great challenge to person re-identification (ReID) task because various occlusions may weaken the discriminative features and introduce interference. Recently, Transformer-based networks, which can aggregate features of all the image patches to construct global features adaptively, have shown advantages in occluded person ReID. Existing methods mainly adopted Transformer as a feature extractor and enhanced local features from the output of the Transformer encoder. However, during the processing of self-attention blocks, disturbing features from occlusions may be diffused into all the tokens, making it difficult to enhance local features effectively. On the other hand, the different heads in self-attention remain isolated during image encoding. Therefore, we consider applying feature enhancement strategies in the channel dimensions instead of the spatial dimensions. First, we divide the heads into groups to enhance diversity and strengthen the robustness of some patterns in occlusion scenarios. Then during training we iteratively suppress the most salient patterns, forcing the model to mine more salient patterns. Finally, we assign adaptive weights for different head groups to compute a robust distance matrix. Our method enhances the model’s ability to extract discriminative and diverse head features and achieves the state-of-the-art performance on occluded person ReID benchmarks, e.g. , Rank-1 of 73.2% on Occluded-DukeMTMC.
- 5 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 22 (15455955) , 8794-8804
Head-Dominant Enhancement With Local Count for Better Human Detection in Crowds
In crowded scenes, it is difficult to extract discriminating human features due to occlusion. Some human detectors have improved this issue by introducing head detection. However, a complex problem still exists in associating full-body detection with its corresponding head detection. Instead of learning the association, we propose a Head-dominant Enhancement Module ( HDEM ) that uses the full-body proposal to regress the head bounding box. To embed the head information into the target human feature, we further propose a Consistent Weighted ( CW ) loss. Additionally, existing Non-Maximum Suppression (NMS) algorithms do not consider density changes with the selection of detection boxes, which leads to false and missed detection. Similar to human visual habits in occluded scenarios, we propose a Count-aware Dynamic Threshold Module ( CADTM ) that utilizes head context information to predict local count, which is associated with crowd density. CADTM can solve the inherent defects of Greedy-NMS in crowded scenes by adjusting the Intersection over Union (IoU) threshold dynamically. Ultimately, through the combination of HDEM and CADTM , we achieve state-of-the-art performance on CrowdHuman with a small computational cost. Our method achieves 4.6% AP gains, 2.2% MR$^{-2}$ gains, and 3.2% JI gains over a Cascade R-CNN baseline. Furthermore, the proposed method is flexible and can be used with most proposal-based detection frameworks and various IoU-based NMS. Note to Practitioners —The motivation for this study arises from a prevalent issue encountered in human detection applications, particularly in densely populated areas such as shopping malls, streets, and subway stations, where occlusion poses a significant challenge. Employing a generic object detector results in numerous missed detections, thereby significantly compromising the overall performance of the detector. This research proposes a convenient plugin that achieves significant performance improvements at a very small cost. To validate its efficacy, our proposed method is thoroughly evaluated on proposal-based detection frameworks. The experimental results demonstrate the robustness of our approach and its ability to adapt to diverse crowded scenarios.- 5 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 22 (15455955) , 8794-8804
Head-Dominant Enhancement With Local Count for Better Human Detection in Crowds
In crowded scenes, it is difficult to extract discriminating human features due to occlusion. Some human detectors have improved this issue by introducing head detection. However, a complex problem still exists in associating full-body detection with its corresponding head detection. Instead of learning the association, we propose a Head-dominant Enhancement Module ( HDEM ) that uses the full-body proposal to regress the head bounding box. To embed the head information into the target human feature, we further propose a Consistent Weighted ( CW ) loss. Additionally, existing Non-Maximum Suppression (NMS) algorithms do not consider density changes with the selection of detection boxes, which leads to false and missed detection. Similar to human visual habits in occluded scenarios, we propose a Count-aware Dynamic Threshold Module ( CADTM ) that utilizes head context information to predict local count, which is associated with crowd density. CADTM can solve the inherent defects of Greedy-NMS in crowded scenes by adjusting the Intersection over Union (IoU) threshold dynamically. Ultimately, through the combination of HDEM and CADTM , we achieve state-of-the-art performance on CrowdHuman with a small computational cost. Our method achieves 4.6% AP gains, 2.2% MR$^{-2}$ gains, and 3.2% JI gains over a Cascade R-CNN baseline. Furthermore, the proposed method is flexible and can be used with most proposal-based detection frameworks and various IoU-based NMS. Note to Practitioners —The motivation for this study arises from a prevalent issue encountered in human detection applications, particularly in densely populated areas such as shopping malls, streets, and subway stations, where occlusion poses a significant challenge. Employing a generic object detector results in numerous missed detections, thereby significantly compromising the overall performance of the detector. This research proposes a convenient plugin that achieves significant performance improvements at a very small cost. To validate its efficacy, our proposed method is thoroughly evaluated on proposal-based detection frameworks. The experimental results demonstrate the robustness of our approach and its ability to adapt to diverse crowded scenarios.