/Minimum Risk Distance Measure for Object Recognition

Minimum Risk Distance Measure for Object Recognition

Shyjan Mahamud and Martial Hebert
Conference Paper, IEEE International Conference on Computer Vision (ICCV), January, 2003

Download Publication (PDF)

Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author’s copyright. These works may not be reposted without the explicit permission of the copyright holder.


Recently, the optimal distance measure for a given object discrimination task under the nearest neighbor framework was derived. For ease of implementation and efficiency considerations, the optimal distance measure was approximated by combining more elementary distance measures defined on simple feature spaces. In this paper, we address two important issues that arise in practice for such an approach: (a) What form should the elementary distance measure in each feature space take? We motivate the need to use optimal distance measures in simple feature spaces as the elementary distance measures; such distance measures have the desirable property that they are invariant to distance-respecting transformations. (b) How do we combine the elementary distance measures? We present the precise statistical assumptions under which a linear logistic model holds exactly. We benchmark our model with three other methods on a challenging face discrimination task and show that our approach is competitive with the state of the art.

BibTeX Reference
author = {Shyjan Mahamud and Martial Hebert},
title = {Minimum Risk Distance Measure for Object Recognition},
booktitle = {IEEE International Conference on Computer Vision (ICCV)},
year = {2003},
month = {January},