Abstract
Person Re-Identification (Re-ID) is often hindered by the "granularity gap," where predefined semantic attributes are insufficient to distinguish between many individuals in large-scale datasets. This paper introduces Deep Hidden Attributes (DHA), an unsupervised approach to discover discriminative person features. By integrating a specialized ISO (Identity-preserving, Sparse, and Orthogonal) module into standard Re-ID networks, the proposed DHA-Net significantly improves matching accuracy across major benchmarks without requiring additional manual labels.
Introduction: The Granularity Gap
The task of matching the same individual across non-overlapping camera views typically relies on low-level visual features (color, texture) or high-level semantic attributes (gender, clothing). However, low-level features are sensitive to lighting and viewpoint changes, while semantic attributes are expensive to annotate and often lack the resolution needed for large populations.
The authors identify a critical "granularity gap": as the number of individuals in a dataset grows, the number of people sharing the same set of predefined attributes increases. Even with 15 semantic attributes, the average number of people sharing the same profile remains high, making unique identification difficult.
To address this, DHA-Net "mines" additional hidden attributes automatically from the data to provide the necessary discriminative power.
Proposed Method: DHA-Net and the ISO Module
The core of the proposed method is the ISO Module, an auto-encoder integrated into a baseline deep Re-ID network (e.g., ResNet-50). This module is governed by three specific constraints designed to learn effective hidden attributes:
- Orthogonal Generation (O): To prevent redundancy among hidden attributes, the model employs Singular Vector Decomposition (SVD) during training. This ensures that each learned attribute captures unique information.
- Identity-Preserving (I): Hidden attributes are constrained to be useful for identification. A cross-entropy loss ensures that the attribute profile for a specific person remains consistent across different images.
- Sparsity Constraint (S): An L1-like sparsity loss is applied to ensure that each person is defined by a unique, sparse "fingerprint" of active attributes, rather than a dense, non-discriminative feature vector.
DHA-Net optimizes four losses simultaneously: identification loss, semantic attribute prediction loss, visual reconstruction loss, and hidden attribute discrimination loss.
Experimental Evaluation
The researchers evaluated DHA-Net on major benchmarks, including Market-1501 and DukeMTMC-reID.
Key Results
- Market-1501: Achieved 91.27% Rank-1 accuracy and 75.95% mAP, outperforming previous state-of-the-art methods like HACNN.
- DukeMTMC-reID: Reached 81.32% Rank-1 accuracy.
- Ablation Study: Adding the DHA module to a baseline ResNet-50 improved Rank-1 accuracy by approximately 3-4%, confirming that hidden attributes provide a significant performance boost over standard visual features alone.
Discussion and Insights
A key finding is that the network discovers "physical" meaning without human intervention. Visualization via Class Activation Maps showed that hidden attributes often focus on specific regions like backpack straps or shoe types—details that are highly discriminative but often omitted from standard semantic labeling schemas.
However, the method introduces some training complexity due to the SVD operation and the need to balance multiple loss functions. Future work may involve extending this "Identity-Preserved Hidden Attribute" framework to other domains, such as vehicle re-identification, where unique semantic markers are even more difficult to predefine.
Conclusion
DHA-Net effectively bridges the granularity gap in person Re-ID by automatically discovering sparse, orthogonal, and identity-preserving hidden attributes. This unsupervised feature mining approach provides a scalable way to enhance the discriminative power of deep Re-ID models without the burden of exhaustive manual annotation.
Summary updated