TY - GEN
T1 - Discriminative dictionary learning with ranking metric embedded for person re-identification
AU - Cheng, De
AU - Chang, Xiaojun
AU - Liu, Li
AU - Hauptmann, Alexander G.
AU - Gong, Yihong
AU - Zheng, Nanning
PY - 2017
Y1 - 2017
N2 - The goal of person re-identification (Re-Id) is to match pedestrians captured from multiple nonoverlapping cameras. In this paper, we propose a novel dictionary learning based method with ranking metric embedded, for person Re-Id. A new and essential ranking graph Laplacian term is introduced, which minimizes the intra-personal compactness and maximizes the inter-personal dispersion in the objective. Different from the traditional dictionary learning based approaches and their extensions, which just use the same or not information, our proposed method can explore the ranking relationship among the person images, which is essential for such retrieval related tasks. Simultaneously, one distance measurement matrix has been explicitly learned in the model to further improve the performance. Since we have reformulated these ranking constraints into the graph Laplacian form, the proposed method is easy-to-implement but effective. We conduct extensive experiments on three widely used person Re-Id benchmark datasets, and achieve state-of-the-art performances.
AB - The goal of person re-identification (Re-Id) is to match pedestrians captured from multiple nonoverlapping cameras. In this paper, we propose a novel dictionary learning based method with ranking metric embedded, for person Re-Id. A new and essential ranking graph Laplacian term is introduced, which minimizes the intra-personal compactness and maximizes the inter-personal dispersion in the objective. Different from the traditional dictionary learning based approaches and their extensions, which just use the same or not information, our proposed method can explore the ranking relationship among the person images, which is essential for such retrieval related tasks. Simultaneously, one distance measurement matrix has been explicitly learned in the model to further improve the performance. Since we have reformulated these ranking constraints into the graph Laplacian form, the proposed method is easy-to-implement but effective. We conduct extensive experiments on three widely used person Re-Id benchmark datasets, and achieve state-of-the-art performances.
UR - https://www.scopus.com/pages/publications/85031916605
U2 - 10.24963/ijcai.2017/134
DO - 10.24963/ijcai.2017/134
M3 - 会议稿件
AN - SCOPUS:85031916605
T3 - IJCAI International Joint Conference on Artificial Intelligence
SP - 964
EP - 970
BT - 26th International Joint Conference on Artificial Intelligence, IJCAI 2017
A2 - Sierra, Carles
PB - International Joint Conferences on Artificial Intelligence
T2 - 26th International Joint Conference on Artificial Intelligence, IJCAI 2017
Y2 - 19 August 2017 through 25 August 2017
ER -