Feedback mechanism based iterative metric learning for person re-identification. (March 2018)

• Record Type: Journal Article
• Authors: Ren, Yutao; Li, Xuelong; Lu, Xiaoqiang
• Is Part Of: Pattern recognition. Volume 75(2018:Mar.)
• Page Start: 99
• Page End: 111
• Publication Date: 2018-03
• Subjects: Person re-identification -- Metric learning -- Feedback -- Iteration; Pattern perception -- Periodicals; Perception des structures -- Périodiques; Patroonherkenning; 006.4
• DOI: 10.1016/j.patcog.2017.04.012
• Languages: English
• ISSNs: 0031-3203

Abstract

Highlights: A feedback mechanism back propagates identification results to join into metric learning. Distances of multiple metric projections are combined to deal with the over fitting problem. A novel method learns distance metric in an iterative way. Abstract: Person re-identification problem is targeting to match people in the views of non-overlapped camera networks. It is an important task in the fields of computer vision and video surveillance. It shows great value in applications like surveillance and action recognition. Existing metric learning based methods measure the similarity of sample pairs by learning a metric space in which the positive pairs are closer than negative pairs. However, the appearance features undergo with drastic variation. Person re-identification is a typical small sample problem. It is hard to learn a robust projection of metric subspace that takes all the situations into consideration. The learned metric subspace is usually over-fitting to training dataset due to the strict metric learning constraint. And the hard pairs in training dataset will weaken the discrimination of matching pairs' similarity. To address these problems, a feedback mechanism based iterative metric learning method is proposed. The proposed method introduces a mean distance of multi-metric subspace to deal with the over-fitting problem. The joint discriminant optimal model on feedback top ranks matching pairs will enhance the discrimination of matching pairs' similarity. It is a robust and discriminative distance metric which measures the matching pairs similarity with distances of multiple metric projections learned by a set of training datasets. Aiming to learn the multi-metric subspace, the proposed method gives a feedback mechanism based approach which back propagates the top ranks identification results as pseudo training datasets. The effectiveness of proposed mean distance of multi-metric projection is analyzed and proved theoretically. And extensive experiments on three challenging datasets, VIPeR, GRID and CUHK01 are conducted. The results show that the proposed method achieves the best performance and improves the state-of-the-art rank-1 identification rates by 18.48%, 2.00% and 5.41% on three datasets respectively.