Line-Based Recognition Using A Multidimensional Hausdorff Distance

A line-feature-based approach for model based recognition using a four-dimensional Hausdorff distance is proposed. This approach reduces the problem of finding the rotation, scaling, and translation transformations between a model and an image to the problem of finding a single translation minimizing the Hausdorff distance between two sets of points in a four-dimensional space. The implementation of the proposed algorithm can be naturally extended to higher dimensional spaces to efficiently find correspondences between n-dimensional patterns. The method performance and sensitivity to segmentation problems are quantitatively characterized using an experimental protocol with simulated data. It is shown that the algorithm performs well, is robust to occlusion and outliers, and that it degrades nicely as the segmentation problems increase. Experiments with real images are also presented.

[1]  David W. Paglieroni,et al.  Distance transforms: Properties and machine vision applications , 1992, CVGIP Graph. Model. Image Process..

[2]  Anil K. Jain,et al.  A modified Hausdorff distance for object matching , 1994, Proceedings of 12th International Conference on Pattern Recognition.

[3]  W. J. Rucklidge.  E?cient Computation of the Minimum Hausdorfi Distance for Visual Recognition , 1994 .

[4]  P. Danielsson.  Euclidean distance mapping , 1980 .

[5]  Rakesh Mohan,et al.  Multidimensional Indexing for Recognizing Visual Shapes , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[6]  Daniel P. Huttenlocher,et al.  Comparing images using the Hausdorff distance under translation , 1992, Proceedings 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[7]  Daniel P. Huttenlocher,et al.  Comparing Images Using the Hausdorff Distance , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[8]  Ching-Shoei Chiang.  The Euclidean distance transform , 1992 .

[9]  Rakesh Mohan,et al.  Multidimensional indexing for recognizing visual shapes , 1991, Proceedings. 1991 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[10]  William Rucklidge,et al.  Locating objects using the Hausdorff distance , 1995, Proceedings of IEEE International Conference on Computer Vision.

[11]  Jun-ichiro Toriwaki,et al.  New algorithms for euclidean distance transformation of an n-dimensional digitized picture with applications , 1994, Pattern Recognit..

[12]  Frederic Fol Leymarie,et al.  Fast raster scan distance propagation on the discrete rectangular lattice , 1992, CVGIP Image Underst..

[13]  James C. Mullikin,et al.  The vector distance transform in two and three dimensions , 1992, CVGIP Graph. Model. Image Process..

[14]  A. V. Karzanov.  A fast algorithm for determining the distances of the points of a given set in an integral lattice from its complement , 1992 .

[15]  Gunilla Borgefors,et al.  Hierarchical Chamfer Matching: A Parametric Edge Matching Algorithm , 1988, IEEE Trans. Pattern Anal. Mach. Intell..

[16]  G. Borgefors.  Distance transformations in arbitrary dimensions , 1984 .

[17]  Ingemar Ragnemalm,et al.  The Euclidean distance transform in arbitrary dimensions , 1992, Pattern Recognit. Lett..

[18]  Xilin Yi,et al.  Line feature-based recognition using Hausdorff distance , 1995, Proceedings of International Symposium on Computer Vision - ISCV.

[19]  E. Pissaloux,et al.  A guided image matching approach using Hausdorff distance with interesting points detection , 1994, Proceedings of 1st International Conference on Image Processing.