The equivalence of the chessboard distance transform and the medial axis transformFootnote^∗

^∗ The correspondence address is: Prof. Shi-Jinn Horng, Department of Electrical Engineering, National Taiwan Institute of Technology, 43, Section 4, Kee-Lung Road, Taipei, Taiwan, R. O. C. Tel:(02) 737-6700, FAX:(02) 737-6699. [email protected] or horng@mouse. ee. ntit. edu. tw.

References

• Blum , H. 1967 . “ A transformation for extracting new descriptors of shape ” . In Models for the Perception of Speech and Visual Form , Edited by: Wathen-Dunn , W. 362 – 380 . Cambridge Mass : MIT Press .
   Google Scholar
• Borgefors , G. 1991 . A note on ‘Distance transformations in digital images . CVGIP: Image Understanding , 54 : 301 – 306 . Another comment on
   Google Scholar
• Chandran , S. , Kwon Kim , S. and Mount , D . M. 1992 . Parallel computational geometry of rectangles . Algorithmica , 7 : 25 – 49 .
   Google Scholar
• Chen , L. and Chuang , H. Y. H. 1994 . A fast algorithm for Euclidean distance maps of a 2-D binary image . Information Processing Letters , 51 : 25 – 29 .
   Web of Science ®Google Scholar
• Danielsson , P. E. 1980 . Euclidean distance mapping . Computer Vision, Graphics, and Image Processing , 14 : 227 – 248 .
   Google Scholar
• Ferreira , A. and Ubéda , S. 1995 . Parallel complexity of the medial axis computation . Proc IEEE International Conference on Image Processing , V-2 : 105 – 108 .
   Google Scholar
• Fuji , A. , Masuzawa , T. and Fujiwara , H. 1995 . An optimal parallel algorithm for the Euclidean distance maps on 2-D binary images . Information Processing Letters , 54 : 295 – 300 .
   Google Scholar
• Jenq , J. F. and Sahni , S. 1992 . Serial and parallel algorithms for the medial axis transform . IEEE Transactions on Pattern Analysis and Machine Intelligence , 14 : 1218 – 1224 .
   Google Scholar
• Kolountzakis , M. N. and Kutulakos , K. N. 1992 . Fast computation of the Euclidean distance maps for binary images . Information Processing Letters , 43 : 181 – 184 .
   Google Scholar
• Lam , L. , Lee , S. W. and Suen , C. Y. 1992 . Thinning methodologies-a comprehensive survey . IEEE Tran. on Pattern Analysis and Machine Intelligence , 14 : 869 – 885 .
   Web of Science ®Google Scholar
• Rosenfeld , A. and Pfalz , J. L. 1968 . Distance function on digital pictures . Pattern Recognition , 1 : 33 – 61 .
   Web of Science ®Google Scholar
• Schwarzkopf , O. 1991 . Parallel computation of distance transforms . Algorithmica , 6 : 685 – 697 .
   Google Scholar
• Shih , F. Y. and Pu , C. C. 1990 . Proc. International Conference on Pattern Recognition . Medial axis transform with single-pixel and connectivity preservation using Euclidean distance computation . 1990 . pp. 723 – 725 .
   Google Scholar
• Vo , K. P. 1982 . Prob 80-4 . J. Algorithms , 4 366 – 368 .
   Google Scholar
• Yamada , H. 1984 . Complete Euclidean distance transformation by parallel operation . Proc. International Conference on Pattern Recognition , V-1 69 – 71 .
   Google Scholar