Abstract
If two vectors originate from the same underlying distribution, the distance between them could be computed with the Mahalanobis distance, a generalization of the Euclidean one. Also, it can be defined as the Euclidean distance computed in the Mahalanobis space. Moreover, there exist also the city block-based Mahalanobis distance and other versions including the angle- and cosine-based ones. Largely employed for face recognition with bi-dimensional facial data, Mahalanobis gains very good performances with PCA algorithms.
Keywords: Mahalanobis distance, Mahalanobis angle, Mahalanobis cosine measure.
About this chapter
Cite this chapter as:
Enrico Vezzetti, Federica Marcolin ;Mahalanobis Distance for Face Recognition, Similarity Measures for Face Recognition (2015) 1: 31. https://doi.org/10.2174/9781681080444115010005
DOI https://doi.org/10.2174/9781681080444115010005 |
Publisher Name Bentham Science Publisher |