TL;DR
This paper introduces Dual-Refinement, a novel approach for unsupervised domain adaptive person re-identification that jointly refines pseudo labels and features to improve discriminability and reduce noise, leading to state-of-the-art results.
Contribution
The paper proposes a hierarchical clustering scheme for label refinement and an instant memory regularization for feature learning, jointly enhancing UDA re-ID performance.
Findings
Outperforms existing methods significantly.
Reduces impact of noisy pseudo labels.
Improves feature discriminability in target domain.
Abstract
Unsupervised domain adaptive (UDA) person re-identification (re-ID) is a challenging task due to the missing of labels for the target domain data. To handle this problem, some recent works adopt clustering algorithms to off-line generate pseudo labels, which can then be used as the supervision signal for on-line feature learning in the target domain. However, the off-line generated labels often contain lots of noise that significantly hinders the discriminability of the on-line learned features, and thus limits the final UDA re-ID performance. To this end, we propose a novel approach, called Dual-Refinement, that jointly refines pseudo labels at the off-line clustering phase and features at the on-line training phase, to alternatively boost the label purity and feature discriminability in the target domain for more reliable re-ID. Specifically, at the off-line phase, a new hierarchical…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
