𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A parallel thinning algorithm with fine grain subtasking

✍ Scribed by C Holt; A Stewart

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
300 KB
Volume
10
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Fine-Grained Parallel Memory Compactio
A Fine-Grained Parallel Memory Compaction Algorithm
✍ P. Weemeeuw; B. Demoen πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 942 KB

Memory compaction is a technique for reclaiming cells containing garbage that are scattered over the memory space. More specifcally, the memory cells are rearranged, so that all usable cells appear in one compact mass at one end of the area, and the remaining space at the other end can be recycled b

A Parallel 3D 12-Subiteration Thinning A
A Parallel 3D 12-Subiteration Thinning Algorithm
✍ KΓ‘lmΓ‘n PalΓ‘gyi; Attila Kuba πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 414 KB

Thinning on binary images is an iterative layer by layer erosion until only the "skeletons" of the objects are left. This paper presents an efficient parallel thinning algorithm which produces either curve skeletons or surface skeletons from 3D binary objects. It is important that a curve skeleton i

A new algorithm for parallel thinning an
A new algorithm for parallel thinning and its hardware realization
✍ Xinlun Zhou; Jian Wei; Feng Li; Peng-Yung Woo πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 97 KB

A new algorithm for template matching parallel thinning is proposed in this article. This algorithm is an improvement of the fast fully parallel thinning algorithm by producing more quality images. This article describes the details of the algorithm and its hardware realization. Experimental results