Person re-identification by modelling principal component analysis coefficients of image dissimilarities

Signature-based matching has been the dominant choice for state-of-the-art person re-identification across multiple disjoint cameras. An approach that exploits image dissimilarities is proposed, treating re-identification as a binary classification problem. To achieve the objective, the person re-identification problem is addressed as follows: (i) first, compute the image dissimilarity between a pair of images acquired from two disjoint cameras; (ii) then learn the linear subspace where the image dissimilarities lie in an unsupervised fashion and (iii) lastly train a binary classifier in the linear subspace to discriminate between image dissimilarities computed for a positive pair (images are for the same person) and a negative pair (images are for different persons). An approach on two publicly available benchmark datasets is evaluated and compared with state-of-the-art methods for person re-identification.

[1]  Kenji Mase,et al.  Local Distance Comparison for Multiple-shot People Re-identification , 2012, ACCV.

[2]  Niki Martinel,et al.  Re-identify people in wide area camera network , 2012, 2012 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops.

[3]  Ehud Rivlin,et al.  Color Invariants for Person Reidentification , 2013, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  Horst Bischof,et al.  Relaxed Pairwise Learned Metric for Person Re-identification , 2012, ECCV.

[5]  Eric O. Postma,et al.  Dimensionality Reduction: A Comparative Review , 2008 .

[6]  Yoshua Bengio,et al.  Exploring Strategies for Training Deep Neural Networks , 2009, J. Mach. Learn. Res..