Maximum Margin Metric Learning Over Discriminative Nullspace for Person Re-identification
Not on the map. Why?
Abstract (arXiv)
In this paper we propose a novel metric learning framework called Nullspace Kernel Maximum Margin Metric Learning (NK3ML) which efficiently addresses the small sample size (SSS) problem inherent in person re-identification and offers a significant performance gain over existing state-of-the-art methods. Taking advantage of the very high dimensionality of the feature space, the metric is learned using a maximum margin criterion (MMC) over a discriminative nullspace where all training sample points of a given class map onto a single point, minimizing the within class scatter. A kernel version of MMC is used to obtain a better between class separation. Extensive experiments on four challenging benchmark datasets for person re-identification demonstrate that the proposed algorithm outperforms all existing methods. We obtain 99.8% rank-1 accuracy on the most widely accepted and challenging dataset VIPeR, compared to the previous state of the art being only 63.92%.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). First posted on arXiv 28 Jul 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2.
2 papers.