Re-ranking person re-identification with k-reciprocal encoding

Publication Type:
Conference Proceeding
Citation:
Proceedings - 30th IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2017, 2017, 2017-January pp. 3652 - 3661
Issue Date:
2017-11-06
Full metadata record
Files in This Item:
Filename Description Size
1701.08398.pdfPublished version1.44 MB
Adobe PDF
© 2017 IEEE. When considering person re-identification (re-ID) as a retrieval process, re-ranking is a critical step to improve its accuracy. Yet in the re-ID community, limited effort has been devoted to re-ranking, especially those fully automatic, unsupervised solutions. In this paper, we propose a k-reciprocal encoding method to re-rank the re-ID results. Our hypothesis is that if a gallery image is similar to the probe in the k-reciprocal nearest neighbors, it is more likely to be a true match. Specifically, given an image, a k- reciprocal feature is calculated by encoding its k-reciprocal nearest neighbors into a single vector, which is used for reranking under the Jaccard distance. The final distance is computed as the combination of the original distance and the Jaccard distance. Our re-ranking method does not require any human interaction or any labeled data, so it is applicable to large-scale datasets. Experiments on the largescale Market-1501, CUHK03, MARS, and PRW datasets confirm the effectiveness of our method1.
Please use this identifier to cite or link to this item: