Journal Article10.1016/0020-0190(96)00049-X
A unified linear-time algorithm for computing distance maps
TL;DR: This paper gives a simple unified algorithm for computing distance maps in O(N 2 ) time for an imput of N×N binary image.
read more
About: This article is published in Information Processing Letters. The article was published on 13 May 1996. The article focuses on the topics: Distance transform & Time complexity.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Morphological segmentation of binary patterns
Pierre Soille,Peter Vogt +1 more
TL;DR: The proposed method depends on a single parameter only and can be used for characterising binary patterns with emphasis on connections between their parts as measured at varying analysis scales.
575
2D Euclidean distance transform algorithms: A comparative survey
TL;DR: In this paper, state-of-the-art sequential 2D EDT algorithms are reviewed and compared, in an effort to reach more solid conclusions regarding their differences in speed and their exactness.
502
2 2D Euclidean Distance Transform Algorithms: A Comparative Survey
Ricardo Fabbri,Luciano da Fontoura Costa,Julio Cesar Torelli,Odemir Martinez Bruno +3 more
- 01 Jan 2008
TL;DR: In this work, state-of-the-art sequential 2D EDT algorithms are reviewed and compared, in an effort to reach more solid conclusions regarding their differences in speed and their exactness.
487
Optimal Separable Algorithms to Compute the Reverse Euclidean Distance Transformation and Discrete Medial Axis in Arbitrary Dimension
TL;DR: This paper presents time optimal algorithms to solve the reverse Euclidean distance transformation and the reversible medial axis extraction problems for d-dimensional images and presents a d- dimensional medial axis filtering process that allows us to control the quality of the reconstructed shape.
Segmentation of 4D cardiac MRI: Automated method based on spatio-temporal watershed cuts
Jean Cousty,Laurent Najman,Michel Couprie,Stéphanie Clément-Guinaudeau,Thomas Goissen,J. Garot +5 more
TL;DR: A new watershed framework which allows for segmenting spatio-temporal images, that is applicable to medical image analysis, is introduced and it is shown that the proposed 4D procedure allows to keep the temporal coherency between the successive 3D segmentations obtained along the time sequence.
103
References
Distance transformations in digital images
TL;DR: Six different distance transformations, both old and new, are used for a few different applications, which show both that the choice of distance transformation is important, and that any of the six transformations may be the right choice.
2.1K
Euclidean distance mapping
TL;DR: It is shown that skeletons can be produced by simple procedures and since these are based on Euclidean distances it is assumed that they are superior to skeletons based on d4−, d8−, and even octagonal metrics.
2K
Sequential Operations in Digital Picture Processing
Azriel Rosenfeld,John L. Pfaltz +1 more
TL;DR: The relative merits of performing local operations on ~ digitized picture in parallel or sequentially are discussed and some applications of the connected component and distance functions are presented.
1.8K
A fast algorithm for Euclidean distance maps of a 2-D binary image
Ling Chen,Henry Y. H. Chuang +1 more
TL;DR: A parallel algorithm on an r-processor EREW PRAM with time complexity 0(n2/r + n log r) is presented, particularly, when r = 1, it is a sequential algorithm with 0((n2 log n)/r).
64
A unified distance transform algorithm and architecture
David W. Paglieroni
- 15 Jan 1992
TL;DR: A new unified algorithm that computes distance and related nearest feature transforms concurrently for arbitrary bit maps based on any distance function from a broad class is presented.