✦ LIBER ✦

Parallel distance transforms on a linear array architecture

✍ Scribed by Tsorng-Lin Chia; Kuang-Bor Wang; Zen Chen; Der-Chyuan Lou

Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 288 KB
Volume: 82
Category: Article
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(01)00250-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Linear time distance transforms for quad

Linear time distance transforms for quadtrees

✍ Clifford A. Shaffer; Quentin F. Stout 📂 Article 📅 1991 🏛 Elsevier Science ⚖ 1021 KB

Linear time algorithms are given for computing the chessboard distance transform for both pointer-based and linear quadtree representations. Comparisons between algorithmic styles for the two representations are made. Both versions of the algorithm consist of a pair of tree traversals. 0 I991 Academ

A cost optimal parallel algorithm for we

A cost optimal parallel algorithm for weighted distance transforms

✍ Akihiro Fujiwara; Michiko Inoue; Toshimitsu Masuzawa; Hideo Fujiwara 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 147 KB

The distance transform and the nearest feature transform are useful operations in image processing. These transforms are based on various kinds of distance functions because the distance functions have dierent eciency or usefulness. In this paper, we consider these transforms based on the weighted d

A VLSI array architecture for Hough tran

A VLSI array architecture for Hough transform

✍ K. Maharatna; Swapna Banerjee 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 162 KB

In this article, an asynchronous array architecture for straight line Hough transform (HT) is proposed using a scaling-free modi"ed Co-Ordinate Rotation Digital Computer (CORDIC) unit as a basic processing element (PE). It exhibits four-fold angle parallelism by dividing the Hough space into four su

The instruction systolic array — a paral

The instruction systolic array — a parallel architecture for VLSI

✍ Hans-Werner Lang 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 779 KB

Computing shape description transforms o

Computing shape description transforms on a multiresolution architecture

✍ L. Cinque; C. Guerra; S. Levialdi 📂 Article 📅 1992 🏛 Elsevier Science ⚖ 930 KB

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