Abstract

The problem of person re-identification has attracted a lot of attention in the field of machine vision. In practice, the non-overlapping sample images change drastically and the sample size is small, which makes the metric model overfitting phenomenon. In this paper, based on the k-NN and the sample normality property, we propose a resampling linear discriminant analysis (LDA) algorithm to suppress the local constraints caused by small samples, then train it to obtain the person re-identification metric learning model. A semi-supervised LDA algorithm with semi-supervised characteristics is developed by optimizing the inter-class scatter for weighting. A joint distance metric-based approach is also proposed to learn both the Mahalanobis distance and Euclidean distance. The improved algorithm is tested on the VIPeR and CUHK01 datasets, and the results indicate that, despite the change in the total number of training samples, the algorithm in this paper shows high recognition accuracy.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call