Pedestrian recognition with a learned metric

Mert Dikmen, Emre Akbas, Thomas S. Huang, Narendra Ahuja

Research output: Chapter in Book/Report/Conference proceedingConference contribution


This paper presents a new method for viewpoint invariant pedestrian recognition problem. We use a metric learning framework to obtain a robust metric for large margin nearest neighbor classification with rejection (i.e., classifier will return no matches if all neighbors are beyond a certain distance). The rejection condition necessitates the use of a uniform threshold for a maximum allowed distance for deeming a pair of images a match. In order to handle the rejection case, we propose a novel cost similar to the Large Margin Nearest Neighbor (LMNN) method and call our approach Large Margin Nearest Neighbor with Rejection (LMNN-R). Our method is able to achieve significant improvement over previously reported results on the standard Viewpoint Invariant Pedestrian Recognition (VIPeR [1]) dataset.

Original languageEnglish (US)
Title of host publicationComputer Vision, ACCV 2010 - 10th Asian Conference on Computer Vision, Revised Selected Papers
Number of pages12
EditionPART 4
StatePublished - 2011
Event10th Asian Conference on Computer Vision, ACCV 2010 - Queenstown, New Zealand
Duration: Nov 8 2010Nov 12 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 4
Volume6495 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other10th Asian Conference on Computer Vision, ACCV 2010
Country/TerritoryNew Zealand

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Pedestrian recognition with a learned metric'. Together they form a unique fingerprint.

Cite this