Hyperbolic Hausdorff Distance for Medial Axis Transform

Although the Hausdorff distance is a popular device to measure the differences between sets, it is not natural for some specific classes of sets, especially for the medial axis transform which is defined as the set of all pairs of the centers and the radii of the maximal balls contained in another set. In spite of its many advantages and possible applications, the medial axis transform has one great weakness, namely its instability under the Hausdorff distance when the boundary of the original set is perturbed. Though many attempts have been made for the resolution of this phenomenon, most of them are heuristic in nature and lack precise error analysis. In this paper, we show that this instability can be remedied by introducing a new metric called the hyperbolic Hausdorff distance, which is most natural for measuring the differences between medial axis transforms. Using the hyperbolic Hausdorff distance, we obtain error bounds, which make the operation of medial axis transform almost an isometry. By various examples, we also show that the bounds obtained are sharp. In doing so, we show that bounding both the Hausdorff distance between domains and the Hausdorff distance between their boundaries is necessary and sufficient for bounding the hyperbolic Hausdorff distance between their medial axis transforms. These results drastically improve the previous results and open a new way to practically control the Hausdorff distance error of the domains under its medial axis transform error, and vice versa.

[1]  G. Naber The geometry of Minkowski spacetime : an introduction to the mathematics of the special theory of relativity , 1992 .

[2]  Q.-Z. Ye,et al.  Inspection of Printed Circuit Boards by Connectivity Preserving Shrinking , 1988, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  Christoph M. Hoffmann,et al.  How to Construct the Skeleton of CSG Objects , 1990 .

[4]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[5]  Erdal Panayirci,et al.  Extension of the Cox-Lewis method for testing multi-dimensional data , 1988 .

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

[7]  R. Farouki,et al.  Voronoi diagram and medial axis algorithm for planar domains with curved boundaries I. Theoretical foundations , 1999 .

[8]  Hwan Pyo Moon,et al.  MATHEMATICAL THEORY OF MEDIAL AXIS TRANSFORM , 1997 .

[9]  S. Levialdi,et al.  Basics of cellular logic with some applications in medical image processing , 1979, Proceedings of the IEEE.

[10]  Georges Voronoi Nouvelles applications des paramètres continus à la théorie des formes quadratiques. Deuxième mémoire. Recherches sur les parallélloèdres primitifs. , 1908 .

[11]  Ching Y. Suen,et al.  Veinerization: A New Shape Description for Flexible Skeletonization , 1998, IEEE Trans. Pattern Anal. Mach. Intell..

[12]  Farzin Mokhtarian,et al.  A Theory of Multiscale, Curvature-Based Shape Representation for Planar Curves , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

[13]  Seong-Whan Lee,et al.  Stability analysis of medial axis transform under relative Hausdorff distance , 2000, Proceedings 15th International Conference on Pattern Recognition. ICPR-2000.

[14]  Rida T. Farouki,et al.  Curves and surfaces in geometrical optics , 1992 .

[15]  Nicholas M. Patrikalakis,et al.  Differential and Topological Properties of Medial Axis Transforms , 1996, CVGIP Graph. Model. Image Process..

[16]  Ching Y. Suen,et al.  The State of the Art in Online Handwriting Recognition , 1990, IEEE Trans. Pattern Anal. Mach. Intell..

[17]  King-Sun Fu,et al.  A syntactic approach to fingerprint pattern recognition , 1975, Pattern Recognit..

[18]  R. Farouki,et al.  Voronoi diagram and medial axis algorithm for planar domains with curved boundaries — II: Detailed algorithm description , 1999 .

[19]  Alfred M. Bruckstein,et al.  Pruning Medial Axes , 1998, Comput. Vis. Image Underst..

[20]  Rida T. Farouki,et al.  Exact equations of simple wavefronts , 1992 .

[21]  Michael F. Barnsley,et al.  Fractals everywhere , 1988 .

[22]  J. Sethian Numerical algorithms for propagating interfaces: Hamilton-Jacobi equations and conservation laws , 1990 .

[23]  M. Grayson The heat equation shrinks embedded plane curves to round points , 1987 .

[24]  M. Berthod,et al.  Automatic recognition of handprinted characters—The state of the art , 1980, Proceedings of the IEEE.

[25]  Martin Held,et al.  On the Computational Geometry of Pocket Machining , 1991, Lecture Notes in Computer Science.