Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Hang Di

dblp:305/9148 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2023
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Video understanding and tracking · 42% Learning paradigms · 32% Deep learning architectures and training · 21%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Deep learning architectures and training
autoencoder
0.712023
Human Motion Segmentation via Velocity-Sensitive Dual-Side Auto-Encoder · IEEE Trans. Image Process. 2023
Computer vision › Video understanding and tracking › motion segmentation
human motion segmentation
0.712023
Human Motion Segmentation via Velocity-Sensitive Dual-Side Auto-Encoder · IEEE Trans. Image Process. 2023
Computer vision › Video understanding and tracking › temporal modeling
temporal feature learning
0.712023
Human Motion Segmentation via Velocity-Sensitive Dual-Side Auto-Encoder · IEEE Trans. Image Process. 2023
Machine learning › Learning paradigms
multi-label classification
0.512021
Semi-Supervised Dual Relation Learning for Multi-Label Classification · IEEE Trans. Image Process. 2021
Machine learning › Learning paradigms › multi-label classification
semi-supervised multi-label learning
0.512021
Semi-Supervised Dual Relation Learning for Multi-Label Classification · IEEE Trans. Image Process. 2021
Machine learning › Transfer learning and domain adaptation
domain adaptation
0.112021
Semi-Supervised Dual Relation Learning for Multi-Label Classification · IEEE Trans. Image Process. 2021

Methods — techniques the papers use, named apart from their topics

velocity-sensitive guidance · 0.7unsupervised clustering · 0.7long-short distance encoding · 0.7pseudo-labeling · 0.5label relation tensor · 0.5dual classifier · 0.5
YearPublicationVenuePosition
2023 Human Motion Segmentation via Velocity-Sensitive Dual-Side Auto-Encoder
abstract
Human motion segmentation (HMS) aims to segment a long human action video into a bunch of short and meaningful action clips. Existing supervised learning approaches need a large amount of training data which may be costly in real-world scenario, while most unsupervised clustering methods cannot fully explore the temporal correlations among human motions and hard to achieve promising performances. In our paper, we design a novel unsupervised framework, called Velocity-Sensitive Dual-Side Auto-Encoder (VSDA), for HMS task. Specifically, a multi-neighbor auto-encoder (MNA) is proposed to extract informative temporal features, which fully explores the local temporal patterns of human motions. In addition, a long-short distance encoding (LSE) strategy is designed. It constrains the encoded representations of close (short-distance) frames becoming similar while the representations of far-away (long-distance) frames becoming distinctive. Similarly, this strategy is also deployed on the decoded outputs as the long-short distance decoding (LSD) module. The LSE/LSD guides the learning process explicitly and implicitly to achieve the dual-side structure. Moreover, we consider the energy variations during the human motion to propose the velocity-sensitive (VS) guidance mechanism for further model improvement. VSDA leverages the temporal characteristics of human motion and derives promising HMS performance. Comprehensive experiments on six real-world human motion datasets illustrate the effectiveness of our proposed model.
Lichen Wang, Yunyu Liu, Yu Yin 0001, Hang Di, Yun Fu 0001
IEEE Trans. Image Process.5
2021 Semi-Supervised Dual Relation Learning for Multi-Label Classification
abstract
In a real-world scenario, an object could contain multiple tags instead of a single categorical label. To this end, multi-label learning (MLL) emerged. In MLL, the feature distributions are long-tailed and the complex semantic label relation and the long-tailed training samples are the main challenges. Semi-supervised learning is a potential solution. While, existing methods are mainly designed for single class scenario while ignoring the latent label relations. In addition, they cannot well handle the distribution shift commonly existing across source and target domains. To this end, a Semi-supervised Dual Relation Learning (SDRL) framework for multi-label classification is proposed. SDRL utilizes a few labeled samples as well as large scale unlabeled samples in the training stage. It jointly explores the inter-instance feature-level relation and the intra-instance label-level relation even from the unlabeled samples. In our model, a dual-classifier structure is deployed to obtain domain invariant representations. The prediction results from the classifiers are further compared and the most confident predictions are extracted as pseudo labels. A trainable label relation tensor is designed to explicitly explore the pairwise latent label relations and refine the predicted labels. SDRL is able to effectively and efficiently explore the feature-label relation as well as the label-label relation knowledge without any extra semantic knowledge. We evaluated SDRL in general and zero-shot multi-label classification tasks and we concluded that SDRL is superior to other SOTA baselines. Furthermore, extensive ablation studies have been done which reveal the effectiveness of each component in our framework.
Lichen Wang, Yunyu Liu, Hang Di, Can Qin, Gan Sun, Yun Fu 0001
IEEE Trans. Image Process.3