Circle-Based Ratio Loss for Person Reidentification

Complexity 2020:1-11 (2020)
  Copy   BIBTEX

Abstract

Person reidentification aims to recognize a specific pedestrian from uncrossed surveillance camera views. Most re-id methods perform the retrieval task by comparing the similarity of pedestrian features extracted from deep learning models. Therefore, learning a discriminative feature is critical for person reidentification. Many works supervise the model learning with one or more loss functions to obtain the discriminability of features. Softmax loss is one of the widely used loss functions in re-id. However, traditional softmax loss inherently focuses on the feature separability and fails to consider the compactness of within-class features. To further improve the accuracy of re-id, many efforts are conducted to shrink within-class discrepancy as well as between-class similarity. In this paper, we propose a circle-based ratio loss for person re-identification. Concretely, we normalize the learned features and classification weights to map these vectors in the hypersphere. Then we take the ratio of the maximal intraclass distance and the minimal interclass distance as an objective loss, so the between-class separability and within-class compactness can be optimized simultaneously during the training stage. Finally, with the joint training of an improved softmax loss and the ratio loss, the deep model could mine discriminative pedestrian information and learn robust features for the re-id task. Comprehensive experiments on three re-id benchmark datasets are carried out to illustrate the effectiveness of the proposed method. Specially, 83.12% mAP on Market-1501, 71.66% mAP on DukeMTMC-reID, and 66.26%/63.24% mAP on CUHK03 labeled/detected are achieved, respectively.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

On probabilities and loss aversion.Horst Zank - 2010 - Theory and Decision 68 (3):243-261.
Living in a Land of Epithets: Anonymity in Judges 19-21.Don Michael Hudson - 1994 - Journal for the Study of the Old Testament 62:49-66.
On Loss Aversion in Bimatrix Games.Bram Driesen, Andrés Perea & Hans Peters - 2010 - Theory and Decision 68 (4):367-391.
Rupture in the Ordinary.Geraldine Agnes Abbatiello - 1998 - Dissertation, Loyola University of Chicago
The Asymmetry: A Solution.Melinda A. Roberts - 2011 - Theoria 77 (4):333-367.

Analytics

Added to PP
2020-12-30

Downloads
6 (#1,430,516)

6 months
3 (#992,474)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Yang Zhao
University of Georgia