Parallel Euclidean distance transformations in Zng

doi:10.1016/0167-8655(96)00017-7

Pattern Recognition Letters

Volume 17, Issue 7, 10 June 1996, Pages 751-757

https://doi.org/10.1016/0167-8655(96)00017-7 Get rights and content

Abstract

In this letter, it is proven that the parallel distance transformations of Yamada and Huang-Mitchell are Euclidean distance transformations for pictures in $Z$ ⁿ and in weighted grids $Z$ ⁿ_g. This result also holds for the sequential-ordered propagation method of Ragnemalm.

References (7)

G. Borgefors
Distance transformations in arbitrary dimensions
Computer Vision, Graphics, and Image Processing
(1984)
G. Borgefors
Distance transformations in digital images
Computer Vision, Graphics, and Image Processing
(1986)
I. Ragnemalm
Neighborhoods for distance transformations using ordered propagation
CVGIP: Image Understanding
(1992)

There are more references available in the full text version of this article.

Cited by (12)

Strongly normal sets of contractible tiles in N dimensions
2007, Pattern Recognition
The second and third authors and others have studied collections of (usually) convex “tiles”—a generalization of pixels or voxels—in $R^{2}$ and $R^{3}$ that have a property called strong normality (SN): for any tile P, only finitely many tiles intersect P, and any nonempty intersection of those tiles also intersects P. This paper extends basic results about strong normality to collections of contractible polyhedra in $R^{n}$ whose nonempty intersections are contractible. We also give sufficient (and trivially necessary) conditions on a locally finite collection of contractible polyhedra in $R^{2}$ or $R^{3}$ for their nonempty intersections to be contractible.
A pipelined array architecture for Euclidean distance transformation and its FPGA implementation
2005, Microprocessors and Microsystems
The Euclidean Distance Transform (EDT) is an important tool in image analysis and machine vision. This paper provides an area-efficient hardware solution to the computation of EDT on a binary image. An O(n) hardware algorithm for computing EDT of an n×n image is presented. A pipelined 2D array architecture for harware implementation is designed. The architecture has a regular structure with locally connected identical processing elements. Further, pipelining reduces hardware resources. Such an array architecture is easily scalable to handle images of different sizes and is suitable for implementation on reconfigurable devices like FPGAs. Results of FPGA-based implementation shows that the hardware can process about 6000 images of size 512×512 per second which is much higher than the video rate of 30 frames per second.
Constant-time algorithm for computing the Euclidean distance maps of binary images on 2D meshes with reconfigurable buses
1999, Information sciences
The computation of Euclidean distance maps (EDM), also called Euclidean distance transform, is a basic operation in computer vision, pattern recognition, and robotics. Fast computation of the EDM is needed since most of the applications using the EDM require real-time computation. It is shown in L. Chen and H.Y.H. Chuang [Information Processing Letters, 51, pp. 25–29 (1994)] that a lower bound $Ω(n^{2})$ is required for any sequential EDM algorithm due to the fact that in any EDM algorithm each of the $n^{2}$ pixels has to be scanned at least once. Recently, many parallel EDM algorithms have been proposed to speedup its computation. Chen and Chuang proposed an algorithm for computing the EDM on an $n×n$ mesh in $O (n)$ time [L. Chen and H.Y.H. Chuang Parallel Computing, 21, pp. 841–852 (1995)]. Clearly, the VLSI complexities of both the sequential and the mesh algorithm described in L. Chen and H.Y.H. Chuang [Parallel Computing, 21, pp. 841–852 (1995)] are $AT^{2} = O (n^{4})$ , where A is the VLSI layout area of the design and T is the computation time using area A when implemented in VLSI. In this paper, we propose a new and faster parallel algorithm for computing the EDM problem on the reconfigurable VLSI mesh model. For the same problem, our algorithm runs in $O (1)$ time on a two-dimensional $n^{2} ×n^{2}$ reconfigurable mesh. We show that the VLSI complexity of our algorithm is the same as those of the above sequential algorithm and the mesh algorithm, while it uses much less time. To our best knowledge, this is the first constant-time EDM algorithm on any parallel computational model.
Fast Euclidean distance transformation by propagation using multiple neighborhoods
1999, Computer Vision and Image Understanding
We propose a new exact Euclidean distance transformation (DT) by propagation, using bucket sorting. A fast but approximate DT is first computed using a coarse neighborhood. A sequence of larger neighborhoods is then used to gradually improve this approximation. Computations are kept short by restricting the use of these large neighborhoods to the tile borders in the Voronoi diagram of the image. We assess the computational cost of this new algorithm and show that it is both smaller and less image-dependent than all other DTs recently proposed. Contrary to all other propagation DTs, it appears to remain o(n²) even in the worst-case scenario.
Two Fast Euclidean Distance Transformations in ℤ<sup>2</sup> Based on Sufficient Propagation
1998, Computer Vision and Image Understanding
Two new error-free sequential Euclidean distance transformations (EDT) for binary images in Z²are introduced: sufficientd₁-propagation and sufficientd_∞-propagation. Both methods use ordered propagation, i.e. iterative propagation via contour pixels. However, we restrict the propagation to unique shortest Euclidean paths, the sufficient propagation paths. Moreover, we ensure error-free direct pixel update by adding a distance suggestion to each propagation pixel. Using these ideas, we avoid many unneccesary calculations. The computational tests show that our algorithms, used as signed and as unsigned methods, are significantly faster than other well-known signed and unsigned EDTs. Comparing both methods, sufficientd_∞-propagation yields the better average performance.
Image Analysis and Computer Vision: 1996
1997, Computer Vision and Image Understanding
This paper presents a bibliography of nearly 2150 references related to computer vision and image analysis, arranged by subject matter. The topics covered include computational techniques; feature detection and segmentation; image and scene analysis; two-dimensional shape; pattern; color and texture; matching and stereo; three-dimensional recovery and analysis; three-dimensional shape; and motion. A few references are also given on related topics, including geometry and graphics, compression and processing, sensors and optics, visual perception, neural networks, artificial intelligence and pattern recognition, as well as on applications.

View all citing articles on Scopus

View full text

Parallel Euclidean distance transformations in Zng

Abstract

Computer Vision, Graphics, and Image Processing

Computer Vision, Graphics, and Image Processing

CVGIP: Image Understanding

Parallel Euclidean distance transformations in $Z$ ⁿ_g