A linear-time algorithm for Euclidean feature transform sets

Information Processing Letters

Volumn 102, Issue 5, 2007, Pages 181-186

  Hesselink, Wim H ^a  

^a UNIVERSITY OF GRONINGEN   (Netherlands)

Author keywords

Algorithms; Computational geometry; Distance transform; Feature transform; Image processing

Indexed keywords

COMPUTATIONAL GEOMETRY; FEATURE EXTRACTION; IMAGE PROCESSING; MATHEMATICAL TRANSFORMATIONS; SET THEORY;

BACKGROUND PIXELS; DISTANCE TRANSFORM; EUCLIDEAN FEATURE; FEATURE TRANSFORM; LINEAR-TIME ALGORITHM;

ALGORITHMS;

EID: 33947528909     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2006.12.005     Document Type: Article

References (11)

1. Borgefors G. Distance transformations in arbitrary dimensions. Comput. Vision, Graphics, Image Process. 27 (1984) 321-345
2. Breu H., Gil J., Kirkpatrick D., and Werman M. Linear time Euclidean distance transform algorithms. IEEE Trans. Pattern Anal. Machine Intell. 17 (1995) 529-533
3. Chen L., and Chuang H.Y.H. A fast algorithm for Euclidean distance maps of a 2-d binary image. Inform. Process. Lett. 51 (1994) 25-29
4. Couprie M., and Zrour R. Discrete bisector function and Euclidean skeleton. In: Andres E., Damiand G., and Lienhardt P. (Eds). Discrete Geometry for Computer Imagery 2005. Lecture Notes in Comput. Sci. vol. 3429 (2005), Springer, Berlin 216-227
5. Danielsson P.-E. Euclidean distance mapping. Comput. Graphics, Image Process. 14 (1980) 227-248
6. Hesselink W.H., Visser M., and Roerdink J.B.T.M. Euclidean skeletons of 3D data sets in linear time by the integer medial axis transform. In: Ronse C., Najman L., and Decencière E. (Eds). Mathematical Morphology: 40 Years On, Proc. 7th Internat. Symp. on Mathematical Morphology. April 18-20 (2005), Springer, Berlin 259-268
7. Hirata T. A unified linear-time algorithm for computing distance maps. Inform. Process. Lett. 58 (1996) 129-133
8. Maurer Jr. C.R., Qi R., and Raghavan V. A linear time algorithm for computing the Euclidean distance transform in arbitrary dimensions. IEEE Trans. Pattern Anal. Machine Intell. 25 (2003) 265-270
9. Meijster A., Roerdink J.B.T.M., and Hesselink W.H. A general algorithm for computing distance transforms in linear time. In: Goutsias J., Vincent L., and Bloomberg D.S. (Eds). Mathematical Morphology and its Applications to Image and Signal Processing, Proc. 5th Internat. Conf. (2000), Kluwer, Dordrecht 331-340
10. Paglieroni D.W. A unified distance transform algorithm and architecture. Machine Vision Appl. 5 (1992) 47-55
11. Rosenfeld A., and Pfaltz J.L. Sequential operations in digital picture processing. J. ACM 13 (1966) 471-494