Minimum Risk Distance Measure for Object Recognition

Recently, the optimal distance measure for a given object discrimination task under the nearest neighbor framework was derived [1]. 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 comp...

• Type: Conference
• Year: 2003
• Where: ICCV
• Authors: Shyjan Mahamud, Martial Hebert
• Keywords: Computer Vision, Elementary Distance Measures, Face Discrimination Task, ICCV 2003, Object Discrimination Task, Optimal Distance Measures, Simple Feature Spaces