The Hausdorff distance measures the extent to which each point of a `model' set lies near some point of an `image' set and vice versa. Thus this distance can be used to determine the degree of resemblance between two objects that are superimposed on one another. In this paper we provide

comparing face images using a modified

Abstract. A quantized metric space is a matrix order unit space equipped with an operator space version of Rieffel’s Lip-norm. We develop for quantized metric spaces an operator space version of quantum Gromov-Hausdorff distance. We show that two quantized metric spaces are completely isometric

The purpose of object matching is to decide the similarity between two objects. This paper introduces 24 possible distance measures based on the Hausdorff distance between two point sets. These measures can be used to match two sets of edge points extracted from any two objects. Based on our

We consider planar curves where the arclength between any two points on the curve is at most a constant times their Euclidean distance, which we call κ-straight curves. We show that the Frechet distance of such curves is at most (1 + κ) times their Hausdorff distance.

on grayscale still images. The Hausdorff distance is used as a similarity measure between a general face model and possible instances of the object within the image. The paper describes an efficient implementation, making this approach suitable for real-time applications. A two-step process that allows both

ABSTRACT A number of Hausdorff-based algorithms have been proposed for finding objects in images. We evaluate different measures and argue that the Hausdorff Average distance measure outperforms other variants for model detection. This method has improved robustness properties with respect

The purpose of this paper is to study the relationship between measures of dissimilarity between shapes in Euclidean space. We first concentrate on the pair Gromov-Hausdorff distance (GH) versus Hausdorff distance under the action of Euclidean isometries (EH). Then, we (1) show they are comparable

Abstract not found

We describe new lower bounds for the complexity of the directed Hausdorff distance under translation and rigid motion. We exhibit lower bound constructions of \Omega\Gamma n 3 ) for point sets under translation, for the L 1 , L 2 and L1 norms, \Omega\Gamma n 4 ) for line segments under