Faster Person Re-identification
2020 · Guan'An Wang, Shaogang Gong, Jian Cheng, et al.
Abstract
Fast person re-identification (ReID) aims to search person images quickly and accurately. The main idea of recent fast ReID methods is the hashing algorithm, which learns compact binary codes and performs fast Hamming distance and counting sort. However, a very long code is needed for high accuracy (e.g. 2048), which compromises search speed. In this work, we introduce a new solution for fast ReID by formulating a novel Coarse-to-Fine (CtF) hashing code search strategy, which complementarily uses short and long codes, achieving both faster speed and better accuracy. It uses shorter codes to coarsely rank broad matching similarities and longer codes to refine only a few top candidates for more accurate instance ReID. Specifically, we design an All-in-One (AiO) framework together with a Distance Threshold Optimization (DTO) algorithm. In AiO, we simultaneously learn and enhance multiple codes of different lengths in a single model. It learns multiple codes in a pyramid structure, and enc
Authors
(none)
Tags
Stats
Related papers
- Hashreid: Dynamic Network With Binary Codes For Efficient Person Re-identification (2023)7.50
- Structured Deep Hashing With Convolutional Neural Networks For Fast Person Re-identification (2017)12.87
- Adaptive Re-ranking Of Deep Feature For Person Re-identification (2018)0.00
- Person Re-identification: Past, Present And Future (2016)0.00
- Re-ranking Person Re-identification With K-reciprocal Encoding (2017)23.09
- Specialized Re-ranking: A Novel Retrieval-verification Framework For Cloth Changing Person Re-identification (2022)9.03
- Deep Co-attention Based Comparators For Relative Representation Learning In Person Re-identification (2018)13.34
- Advancing Person Re-identification: Tensor-based Feature Fusion And Multilinear Subspace Learning (2023)2.26