Contextual Similarity Regularized Metric Learning for person re-identification

• Published in: 2016 23rd International Conference on Pattern Recognition (ICPR) pp. 2048 - 2053
• Main Authors: Jin Wang, Junkang Zhu, Zheng Wang, Changxin Gao, Nong Sang, Rui Huang
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.12.2016
• Subjects: Cameras; Context; Matrix decomposition; Measurement; Probes; Robustness; Visualization
• DOI: 10.1109/ICPR.2016.7899937

Person re-identification, aiming to match a specific person among non-overlapping cameras, has attracted plenty of attention in recent years. It can be regarded as a visual retrieval task, namely given a query person image, ranking all gallery images according to their similarities to the query. Conventionally, this similarity function is learnt by forcing intra-distances to be small while inter-distances to be large, which are referred to as individual similarity constraints. In this paper, we propose to learn the similarity function by taking into account of both individual similarity constraints and contextual similarity constraints. The context of a query is defined as its k-nearest neighbors in the gallery. We argue that if two images are from the same person, apart from the visual likeness between them, denoted as the individual similarity, they should also possess similar k-nearest neighbors in the gallery, denoted as the contextual similarity. Motivated by this assumption, we propose a new Contextual Similarity Regularized Metric Learning (CSRML) method for person re-identification. The contextual similarity regularization term forces two images of the same person to share similar context. Both individual and contextual similarity constraints are encoded by a large margin logistic loss function and the final problem is solved by the stochastic gradient descent algorithm. Experiments on the challenging VIPeR and CUHK01 datasets show that our approach achieves very competitive performance.