Journal Article10.1007/S10851-010-0232-4
Linear Time Algorithms for Exact Distance Transform
TL;DR: The theoretical and practical version of the signed distance transform algorithm, GBDT, returns the exact value of the distance from the geometrically defined object boundary, and it is proved that this algorithm can be used to find, in linear time, the largest possible distance between any two of its elements.
read more
Abstract: In 2003, Maurer et al. (IEEE Trans. Pattern Anal. Mach. Intell. 25:265---270, 2003) published a paper describing an algorithm that computes the exact distance transform in linear time (with respect to image size) for the rectangular binary images in the k-dimensional space ? k and distance measured with respect to L p -metric for 1?p??, which includes Euclidean distance L 2. In this paper we discuss this algorithm from theoretical and practical points of view. On the practical side, we concentrate on its Euclidean distance version, discuss the possible ways of implementing it as signed distance transform, and experimentally compare implemented algorithms. We also describe the parallelization of these algorithms and discuss the computational time savings associated with them. All these implementations will be made available as a part of the CAVASS software system developed and maintained in our group (Grevera et al. in J. Digit. Imaging 20:101---118, 2007). On the theoretical side, we prove that our version of the signed distance transform algorithm, GBDT, returns the exact value of the distance from the geometrically defined object boundary. We provide a complete proof (which was not given of Maurer et al. (IEEE Trans. Pattern Anal. Mach. Intell. 25:265---270, 2003) that all these algorithms work correctly for L p -metric with 1<p<?. We also point out that the precise form of the algorithm from Maurer et al. (IEEE Trans. Pattern Anal. Mach. Intell. 25:265---270, 2003) is not well defined for L 1 and L ? metrics. In addition, we show that the algorithm can be used to find, in linear time, the exact value of the diameter of an object, that is, the largest possible distance between any two of its elements.
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
An Efficient Algorithm for Calculating the Exact Hausdorff Distance
Abdel Aziz Taha,Allan Hanbury +1 more
TL;DR: A novel efficient algorithm for computing the exact Hausdorff distance that has efficient performance for large point set sizes as well as for large grid size; performs equally for sparse and dense point sets; and is general without restrictions on the characteristics of the point set.
3D automatic anatomy segmentation based on iterative graph-cut-ASM.
Xinjian Chen,Ulas Bagci +1 more
TL;DR: The experimental results showed the feasibility and efficacy of the proposed automatic anatomy segmentation system: the incorporation of shape priors into the GC framework is feasible in 3D as demonstrated previously for 2D images; the hybrid strategy IGCASM seems to be more robust and accurate than ASM and GC individually.
Estimation of Feret's diameter from pixel coverage representation of a shape
TL;DR: A method for Feret's diameter estimation from digital images that utilizes pixel coverage and derives a correction term for improving accuracy of the coverage based estimator, which provides significant improvement over existing methods.
56
Efficient algorithm for finding the exact minimum barrier distance
TL;DR: This paper presents a polynomial time algorithm, that provably calculates the exact values of MBD for the digital images and compares this new algorithm, theoretically and experimentally, with the algorithm presented in [1] , which computes the approximate values of the MBD.
48
Spatial logics and model checking for medical imaging
TL;DR: In this article, the authors introduce the logical language ImgQL (Image Query Language) which extends SLCS with logical operators describing distance and region similarity, based on notions from statistical texture analysis.
46
References
New Guidelines to Evaluate the Response to Treatment in Solid Tumors
Patrick Therasse,Susan G. Arbuck,Elizabeth Eisenhauer,Jantien Wanders,Richard Kaplan,Larry Rubinstein,Jaap Verweij,Martine Van Glabbeke,Allan T. van Oosterom,Michaele C. Christian,S. Gwyther +10 more
TL;DR: A model by which a combined assessment of all existing lesions, characterized by target lesions and nontarget lesions, is used to extrapolate an overall response to treatment is proposed, which is largely validated by the Response Evaluation Criteria in Solid Tumors Group and integrated into the present guidelines.
A linear time algorithm for computing exact Euclidean distance transforms of binary images in arbitrary dimensions
TL;DR: The algorithm, which is based on dimensionality reduction and partial Voronoi diagram construction, can be used for computing the DT for a wide class of distance functions, including the L/sub p/ and chamfer metrics.
Distance transformations: fast algorithms and applications to medical image processing
O. Cuisenaire
- 01 Jan 1999
TL;DR: This thesis describes a new exact Euclidean distance transformation using ordered propagation and derives a rule defining, for any pixel location, the size of the neighborhood that guarantees the exactness of the DT.
234
Mutual information in coupled multi-shape model for medical image segmentation
TL;DR: Extensions which improve the performance of the shape-based deformable active contour model presented earlier in [IEEE Conf. Comput. Vision Pattern Recog. 1 (2001) 463] for medical image segmentation are presented.
165