✦ LIBER ✦

Efficient Computation of the Euclidean Distance Transform

✍ Scribed by Laurence Boxer; Russ Miller

Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 31 KB
Volume: 80
Category: Article
ISSN: 1077-3142
DOI: 10.1006/cviu.2000.0880

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Corrigendum to “Efficient Computation of

Corrigendum to “Efficient Computation of the Euclidean Distance Transform”

✍ Laurence Boxer; Russ Miller 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 52 KB

An algorithm for the distance transform of a binary image was presented in L. Boxer and R. Miller (Comput. Vision Image Understand. 80, 2000, 379-383). The algorithm was stated for the Euclidean metric. In this Corrigendum, we show that the algorithm of Boxer and Miller (2000) is correct for the L 1

Constant-Time Algorithm for the Euclidea

Constant-Time Algorithm for the Euclidean Distance Transform on Reconfigurable Meshes

✍ Amitava Datta; Subbiah Soundaralakshmi 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 288 KB

The Euclidean distance transform (EDT) is an operation to convert a binary image consisting of black and white pixels to a representation where each pixel has the Euclidean distance of the nearest black pixel. The EDT has many applications in computer vision and image processing. In this paper, we p

Optimal Computing the Chessboard Distanc

Optimal Computing the Chessboard Distance Transform on Parallel Processing Systems

✍ Yu-Hua Lee; Shi-Jinn Horng 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 290 KB

The distance transform (DT) is an image computation tool which can be used to extract the information about the shape and the position of the foreground pixels relative to each other. It converts a binary image into a grey-level image, where each pixel has a value corresponding to the distance to th

Fast computation of the discrete Hartley

Fast computation of the discrete Hartley transform

✍ Priyanka Jain; Balbir Kumar; S. B. Jain 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 143 KB

On the computation of Mahalanobis' gener

On the computation of Mahalanobis' generalized distance (D2)

✍ G. P. Rightmire 📂 Article 📅 1969 🏛 John Wiley and Sons 🌐 English ⚖ 345 KB

Rapid and Accurate Computation of the Di

Rapid and Accurate Computation of the Distance Function Using Grids

✍ Yen-hsi Richard Tsai 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 409 KB

We present two fast and simple algorithms for approximating the distance function for given isolated points on uniform grids. The algorithms are then generalized to compute the distance to piecewise linear objects. By incorporating the geometry of Huygens' principle in the reverse order with the cla