𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Parallel computation of exact Euclidean distance transform

✍ Scribed by Yu-Hua Lee; Shi-Jinn Horng; Tzong-Wann Kao; Ferng-Shi Jaung; Yuung-Jih Chen; Horng-Ren Tsai

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
1004 KB
Volume
22
Category
Article
ISSN
0167-8191

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

Robust Skeletonization through Exact Euc
Robust Skeletonization through Exact Euclidean Distance Transform and its Application to Neuromorphometry
✍ Luciano da Fontoura Costa πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 601 KB

his paper presents how robust 1-pixel-wide and 8-connected skeletons can be obtained simultaneously with exact distance transform calculation. The proposed approach is based on the new concept of exact dilation. Two alternative algorithms for exact Euclidean distance transform calculation allowing e

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