Hangyuan Yang

Dr. Hangyuan Yang

orcid

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
2 August 2023 in Electronics
Verified
Journal Article
Open access
PDF file
SYShan Yang
Shan Yang
YZYongfei Zhang
Yongfei Zhang
QZQinghua Zhao
Qinghua Zhao
YPYanglin Pu
Yanglin Pu
HYHangyuan Yang
Hangyuan Yang
Deep metric learning aims to learn a mapping function that projects input data into a high-dimensional embedding space, facilitating the clustering of similar data points while ensuring dissimilar ones are far apart. The most recent studies focus on designing a batch sampler and mining online triplets to achieve this purpose. Conventionally, hard negative mining schemes serve as the preferred batch sampler. However, most hard negative mining schemes search for hard examples in randomly selected mini-batches at each epoch, which often results in less-optimal hard examples and thus sub-optimal performances. Furthermore, Triplet Loss is commonly adopted to perform online triplet mining by pulling the hard positives close to and pushing the negatives away from the anchor. However, when the anchor in a triplet is an outlier, the positive example will be pulled away from the centroid of the cluster, thus resulting in a loose cluster and inferior performance. To address the above challenges, we propose the Prototype-based Support Example Miner (pSEM) and Triplet Loss (pTriplet Loss). First, we present a support example miner designed to mine the support classes on the prototype-based nearest neighbor graph of classes. Following this, we locate the support examples by searching for instances at the intersection between clusters of these support classes. Second, we develop a variant of Triplet Loss, referred to as a Prototype-based Triplet Loss. In our approach, a dynamically updated prototype is used to rectify outlier anchors, thus reducing their detrimental effects and facilitating a more robust formulation for Triplet Loss. Extensive experiments on typical Computer Vision (CV) and Natural Language Processing (NLP) tasks, namely person re-identification and few-shot relation extraction, demonstrated the effectiveness and generalizability of the proposed scheme, which consistently outperforms the state-of-the-art models.

15 October 2026 in Electronics
Verified
Journal Article
Open access
PDF file
HYHangyuan Yang
Hangyuan Yang
YZYongfei Zhang
Yongfei Zhang
SCSiyu Chen
Siyu Chen
YLYao Liu
Yao Liu
XWXin Wang
Xin Wang
Normalization narrows visual domain gaps but moves discriminative cues into its residual. Many normalization-residual decomposition methods for domain generalization (DG) and unsupervised domain adaptation (UDA) rely primarily on channel-wise modeling, while existing spatial-channel variants treat spatial and channel cues independently, and symmetric losses judge recovery only against the normalized feature, possibly less discriminative than the original. We propose Interaction-Calibrated Attention-Based Asymmetric Feature Decomposition and Recovery (ICAA). Its Interaction-Calibrated Attention-Based Feature Decomposition and Recovery (IAFDR) module uses Spatial-Channel Interactive Calibration to jointly calibrate spatial and channel evidence and selectively recover task-relevant information from normalization residuals, and an explicit correspondence between convolutional networks and vision transformers extends it to patch tokens. The Asymmetric Task-relevant Feature Decomposition loss encourages recovered features to be more certain than original ones and their complements less certain than normalized ones. ICAA improves every evaluated host across classification, segmentation, and detection: DAEL by 3.9/5.4 percentage points (pp) to 87.3%/71.5% on PACS/Office-Home (1.4/2.2 pp above the best CNN competitor), M3SDA by 9.8 pp to 52.4% on DomainNet, CSFDA by 3.1/4.1 pp to 55.7%/48.7% mIoU on GTA5/SYNTHIA→Cityscapes, and Faster R-CNN by 4.9 pp to 23.7% mAP on Foggy Cityscapes.


11 February 2026 in SSRN Electronic Journal
Verified
Preprint
Open access
YWYongjun Wang
Yongjun Wang
XHXiaohui Hao
Xiaohui Hao
HYHangyuan Yang
Hangyuan Yang
Robust visual tracking under severe occlusions remains challenging due to the lack of explicit occlusion detection mechanisms and adaptive feature compensation strategies in existing methods. To address this problem, we propose EntropyTrack, a unified transformer-based framework that exploits attention entropy for occlusion-aware tracking. Our approach introduces an Attention Entropy Occlusion Detector that quantifies attention distribution uncertainty to explicitly identify occlusion states with spatial consistency regularization. Building upon this detection, an Adaptive Feature Compensation module performs intelligent feature repair through dynamic fusion of spatial inpainting and temporal information based on detected occlusion patterns. Furthermore, a Multi-Scale Contrastive Learning module enhances feature discriminability via attention-guided sampling across multiple scales for robust target-background separation. Extensive experiments on seven challenging benchmarks including LaSOT, GOT-10k, TrackingNet, LaSOText, VOT2020, TNL2K, and OTB100 demonstrate that EntropyTrack achieves state-of-the-art performance while maintaining real-time efficiency at 42 fps. The synergistic integration of entropy-driven occlusion detection, adaptive compensation, and multi-scale contrastive learning provides a principled solution for robust visual tracking under challenging conditions.