The equivalence of the chessboard distance transform and the medial axis transform

International Journal of Computer Mathematics

Volumn 65, Issue 3-4, 1997, Pages 165-177

  Lee, Yu Hua ^a   Horng, Shi Jinn ^a  

^a NATIONAL TAIWAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

Author keywords

Algorithms; Computer vision; Distance transform; Image processing; Medial axis transform; Parallel algorithm

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER VISION; EQUIVALENCE CLASSES; FEATURE EXTRACTION; IMAGE ANALYSIS; IMAGE QUALITY; IMAGE RECONSTRUCTION; MATHEMATICAL MODELS; PARALLEL ALGORITHMS;

CHESSBOARD DISTANCE TRANSFORMS (CDT); MEDIAL AXIS TRANSFORMS (MAT);

MATHEMATICAL TRANSFORMATIONS;

EID: 0031327234     PISSN: 00207160     EISSN: None     Source Type: Journal    
DOI: 10.1080/00207169708804608     Document Type: Article

References (15)

1. Blum, H. (1967). A transformation for extracting new descriptors of shape, In WathenDunn, W. editor, Models for the Perception of Speech and Visual Form, MIT Press, Cambridge Mass., 362-380.
2. Borgefors, G. (1991). Another comment on "A note on 'Distance transformations in digital images", CVGIP: Image Understanding, 54, 301-306.
3. Chandran, S., Kwon Kim, S. and Mount, D . M. (1992). Parallel computational geometry of rectangles, Algorithmica, 7, 25-49.
4. 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.
5. Danielsson, P. E. (1980). Euclidean distance mapping, Computer Vision, Graphics, and Image Processing, 14, 227-248.
6. 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.
7. 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.
8. 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.
9. Kolountzakis, M. N. and Kutulakos, K. N. (1992). Fast computation of the Euclidean distance maps for binary images. Information Processing Letters, 43, 181-184.
10. 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.
11. Rosenfeld, A. and Pfalz, J. L. (1968). Distance function on digital pictures, Pattern Recognition, 1, 33-61.
12. Schwarzkopf, O. (1991). Parallel computation of distance transforms, Algorithmica, 6, 685-697.
13. Shih, F. Y. and Pu, C. C. (1990). Medial axis transform with single-pixel and connectivity preservation using Euclidean distance computation, Proc. International Conference on Pattern Recognition, 723-725.
14. Vo, K. P. (1982). Prob 80-4, J. Algorithms, 4, 366-368.
15. Yamada, H. (1984). Complete Euclidean distance transformation by parallel operation, Proc. International Conference on Pattern Recognition, V-1, 69-71.