𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Parallel Computation of the Euclidean Distance Transform on the Mesh of Trees and the Hypercube Computer

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

Book ID
112241495
Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
456 KB
Volume
68
Category
Article
ISSN
1077-3142

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

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