Chapter 4

Hausdorff Distance for Face Recognition

Enrico Vezzetti and Federica Marcolin

Abstract

When two sets are differently sized, the Hausdorff distance can be computed between them, even if the cardinality of one set is infinite. Different versions of this distance have been proposed and employed for face verification, among which the modified Hausdorff distance is the most famous. The important point to be noted is that, among the most commonly used similarity measures, the Hausdorff distance is the only one that has been widely applied to 3D data.

Total Pages: 39-46 (8)

Purchase Chapter  Book Details