CVJul 28, 2018

Maximum Margin Metric Learning Over Discriminative Nullspace for Person Re-identification

arXiv:1807.10908v130 citations
Originality Highly original
AI Analysis

This addresses the challenge of identifying individuals across non-overlapping camera views, with a significant performance improvement that is not incremental.

The paper tackles the small sample size problem in person re-identification by proposing a novel metric learning framework, achieving 99.8% rank-1 accuracy on the VIPeR dataset compared to the previous state-of-the-art of 63.92%.

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%.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes