Hashreid: Dynamic Network With Binary Codes For Efficient Person Re-identification

Abstract

Biometric applications, such as person re-identification (ReID), are often deployed on energy constrained devices. While recent ReID methods prioritize high retrieval performance, they often come with large computational costs and high search time, rendering them less practical in real-world settings. In this work, we propose an input-adaptive network with multiple exit blocks, that can terminate computation early if the retrieval is straightforward or noisy, saving a lot of computation. To assess the complexity of the input, we introduce a temporal-based classifier driven by a new training strategy. Furthermore, we adopt a binary hash code generation approach instead of relying on continuous-valued features, which significantly improves the search process by a factor of 20. To ensure similarity preservation, we utilize a new ranking regularizer that bridges the gap between continuous and binary features. Extensive analysis of our proposed method is conducted on three datasets: Market1

Stats

• citations9
• S2 citations—
• github stars0
• HF likes0
• heat score7.50
• arxiv keynikhal2023hashreid

Related papers

• Faster Person Re-identification (2020)18.14
• Structured Deep Hashing With Convolutional Neural Networks For Fast Person Re-identification (2017)12.87
• BIT: Matching-based Bi-directional Interaction Transformation Network For Visible-infrared Person Re-identification (2026)0.00
• Compact Hash Code Learning With Binary Deep Neural Network (2017)9.03
• Specialized Re-ranking: A Novel Retrieval-verification Framework For Cloth Changing Person Re-identification (2022)9.03
• Binary Constrained Deep Hashing Network For Image Retrieval Without Manual Annotation (2018)5.84
• Re-ranking Person Re-identification With K-reciprocal Encoding (2017)23.09
• Online Hashing With Efficient Updating Of Binary Codes (2019)8.09