TL;DR
This paper proposes a novel self-supervised target relation regularization method using dynamic target relation graphs for fine-grained classification, improving robustness and performance on imbalanced and sparse data.
Contribution
Introduces dynamic target relation graphs (DTRG), a self-generated structural regularization scheme that models inter-class relations for better fine-grained classification.
Findings
Achieves state-of-the-art results on fine-grained benchmarks.
Enhances robustness against data sparsity and imbalance.
Effectively models inter-class dependencies through DTRG.
Abstract
Fine-grained visual classification can be addressed by deep representation learning under supervision of manually pre-defined targets (e.g., one-hot or the Hadamard codes). Such target coding schemes are less flexible to model inter-class correlation and are sensitive to sparse and imbalanced data distribution as well. In light of this, this paper introduces a novel target coding scheme -- dynamic target relation graphs (DTRG), which, as an auxiliary feature regularization, is a self-generated structural output to be mapped from input images. Specifically, online computation of class-level feature centers is designed to generate cross-category distance in the representation space, which can thus be depicted by a dynamic graph in a non-parametric manner. Explicitly minimizing intra-class feature variations anchored on those class-level centers can encourage learning of discriminative…
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.
Taxonomy
MethodsMixup
