# Rapid Person Re-Identification via Sub-space Consistency Regularization

arXiv: https://arxiv.org/abs/2207.05933 · HTML: https://mlsanity.com/paper/2207.05933/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 26 of its 63 references that are in the map.
- First posted on arXiv 13 Jul 2022.

## Builds on (most cited first, 26 of 26)

- [Deep Residual Learning for Image Recognition](https://mlsanity.com/paper/1512.03385/) (2015)
- [Very Deep Convolutional Networks for Large-Scale Image Recognition](https://mlsanity.com/paper/1409.1556/) (2014)
- [Beyond Part Models: Person Retrieval with Refined Part Pooling (and a Strong Convolutional Baseline)](https://mlsanity.com/paper/1711.09349/) (2017)
- [Bag of Tricks and A Strong Baseline for Deep Person Re-identification](https://mlsanity.com/paper/1903.07071/) (2019)
- [Unlabeled Samples Generated by GAN Improve the Person Re-identification Baseline in vitro](https://mlsanity.com/paper/1701.07717/) (2017)
- [Person Re-identification: Past, Present and Future](https://mlsanity.com/paper/1610.02984/) (2016)
- [HashNet: Deep Learning to Hash by Continuation](https://mlsanity.com/paper/1702.00758/) (2017)
- [High-Order Information Matters: Learning Relation and Topology for Occluded Person Re-Identification](https://mlsanity.com/paper/2003.08177/) (2020)
- [RGB-Infrared Cross-Modality Person Re-Identification via Joint Pixel and Feature Alignment](https://mlsanity.com/paper/1910.05839/) (2019)
- [Human Semantic Parsing for Person Re-identification](https://mlsanity.com/paper/1804.00216/) (2018)
- [Non-Salient Region Object Mining for Weakly Supervised Semantic Segmentation](https://mlsanity.com/paper/2103.14581/) (2021)
- [Jo-SRC: A Contrastive Approach for Combating Noisy Labels](https://mlsanity.com/paper/2103.13029/) (2021)
- [A Pose-Sensitive Embedding for Person Re-Identification with Expanded Cross Neighborhood Re-Ranking](https://mlsanity.com/paper/1711.10378/) (2017)
- [Cross-Modality Paired-Images Generation for RGB-Infrared Person Re-Identification](https://mlsanity.com/paper/2002.04114/) (2020)
- [Pose-Normalized Image Generation for Person Re-identification](https://mlsanity.com/paper/1712.02225/) (2017)
- [Camera Style Adaptation for Person Re-identification](https://mlsanity.com/paper/1711.10295/) (2017)
- [Perceive Where to Focus: Learning Visibility-aware Part-level Features for Partial Person Re-identification](https://mlsanity.com/paper/1904.00537/) (2019)
- [Cross-Dataset Person Re-Identification via Unsupervised Pose Disentanglement and Adaptation](https://mlsanity.com/paper/1909.09675/) (2019)
- [Graph Sampling Based Deep Metric Learning for Generalizable Person Re-Identification](https://mlsanity.com/paper/2104.01546/) (2021)
- [Faster Person Re-Identification](https://mlsanity.com/paper/2008.06826/) (2020)
- [Camera-Conditioned Stable Feature Generation for Isolated Camera Supervised Person Re-IDentification](https://mlsanity.com/paper/2203.15210/) (2022)
- [Bit-Scalable Deep Hashing with Regularized Similarity Learning for Image Retrieval and Person Re-identification](https://mlsanity.com/paper/1508.04535/) (2015)
- [Feature Affinity based Pseudo Labeling for Semi-supervised Person Re-identification](https://mlsanity.com/paper/1805.06118/) (2018)
- [Structured Deep Hashing with Convolutional Neural Networks for Fast Person Re-identification](https://mlsanity.com/paper/1702.04179/) (2017)
- [Part-based Deep Hashing for Large-scale Person Re-identification](https://mlsanity.com/paper/1705.02145/) (2017)
- [Adversarial Binary Coding for Efficient Person Re-identification](https://mlsanity.com/paper/1803.10914/) (2018)

## Abstract (arXiv)

Person Re-Identification (ReID) matches pedestrians across disjoint cameras. Existing ReID methods adopting real-value feature descriptors have achieved high accuracy, but they are low in efficiency due to the slow Euclidean distance computation as well as complex quick-sort algorithms. Recently, some works propose to yield binary encoded person descriptors which instead only require fast Hamming distance computation and simple counting-sort algorithms. However, the performances of such binary encoded descriptors, especially with short code (e.g., 32 and 64 bits), are hardly satisfactory given the sparse binary space. To strike a balance between the model accuracy and efficiency, we propose a novel Sub-space Consistency Regularization (SCR) algorithm that can speed up the ReID procedure by 0.25 times than real-value features under the same dimensions whilst maintaining a competitive accuracy, especially under short codes. SCR transforms real-value features vector (e.g., 2048 float32) with short binary codes (e.g., 64 bits) by first dividing real-value features vector into M sub-spaces, each with C clustered centroids. Thus the distance between two samples can be expressed as the summation of the respective distance to the centroids, which can be sped up by offline calculation and maintained via a look-up table. On the other side, these real-value centroids help to achieve significantly higher accuracy than using binary code. Lastly, we convert the distance look-up table to be integer and apply the counting-sort algorithm to speed up the ranking stage. We also propose a novel consistency regularization with an iterative framework. Experimental results on Market-1501 and DukeMTMC-reID show promising and exciting results. Under short code, our proposed SCR enjoys Real-value-level accuracy and Hashing-level speed.