Easy Identification from Better Constraints: Multi-Shot Person Re-Identification from Reference Constraints

被引:9
作者
Zhou, Jiahuan [1 ]
Su, Bing [2 ]
Wu, Ying [1 ]
机构
[1] Northwestern Univ, Elect Engn & Comp Sci, Evanston, IL 60208 USA
[2] Chinese Acad Sci, Inst Software, Beijing, Peoples R China
来源
2018 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR) | 2018年
基金
美国国家科学基金会; 中国国家自然科学基金;
关键词
D O I
10.1109/CVPR.2018.00563
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Multi-shot person re-identification (MsP-RID) utilizes multiple images from the same person to facilitate identification. Considering the fact that motion information may not be discriminative nor reliable enough for MsP-RID, this paper is focused on handling the large variations in the visual appearances through learning discriminative visual metrics for identification. Existing metric learning-based methods usually exploit pair-wise or triple-wise similarity constraints, that generally demands intensive optimization in metric learning, or leads to degraded performances by using sub-optimal solutions. In addition, as the training data are significantly imbalanced, the learning can be largely dominated by the negative pairs and thus produces unstable and non-discriminative results. In this paper, we propose a novel type of similarity constraint. It assigns the sample points to a set of reference points to produce a linear number of reference constraints. Several optimal transport-based schemes for reference constraint generation are proposed and studied. Based on those constraints, by utilizing a typical regressive metric learning model, the closed-form solution of the learned metric can be easily obtained. Extensive experiments and comparative studies on several public MsP-RID benchmarks have validated the effectiveness of our method and its significant superiority over the state-of-the-art MsP-RID methods in terms of both identification accuracy and running speed.
引用
收藏
页码:5373 / 5381
页数:9
相关论文
共 39 条
[1]  
[Anonymous], 2015, CVPR
[2]  
[Anonymous], 2013, CVPR
[3]  
[Anonymous], 2016, CVPR
[4]  
[Anonymous], 2016, CVPR
[5]  
[Anonymous], AMSTER658
[6]  
[Anonymous], 2014, CVPR
[7]  
[Anonymous], 2017, ICCV
[8]  
[Anonymous], NIPS
[9]  
[Anonymous], 2015, ICCV
[10]  
[Anonymous], 2012, ECCV