𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Topology preserving parallel thinning algorithms

✍ Scribed by Gábor Németh; Kálmán Palágyi

Publisher
John Wiley and Sons
Year
2011
Tongue
English
Weight
816 KB
Volume
21
Category
Article
ISSN
0899-9457

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

Thinning is an iterative object reduction technique for extracting medial curves from binary objects. During a thinning process, some border points that satisfy certain topological and geometric constraints are deleted in iteration steps. Parallel thinning algorithms are composed of parallel reduction operators that delete a set of object points simultaneously. This article presents 21 parallel thinning algorithms for (8,4) binary pictures that are derived from the sufficient conditions for topology preservation accommodated to the three parallel thinning approaches. © 2011 Wiley Periodicals, Inc. Int J Imaging Syst Technol, 21, 37–44, 2011.

📜 SIMILAR VOLUMES

Parallel Thinning Algorithms on 3D (18,
Parallel Thinning Algorithms on 3D (18, 6) Binary Images
✍ Cherng-Min Ma; Shu-Yen Wan 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 274 KB

Thinning algorithms on binary images are used to generate skeletons that preserve the same connectivity structures as the objects in the original images. Two kinds of skeletons may be appropriate for 3D thinning algorithms: digital curves and digital surfaces. We propose two thinning algorithms on 3

Optimization and performance analysis of
Optimization and performance analysis of thinning algorithms on parallel computers
✍ Stephan Heydorn; Peter Weidner 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 530 KB

Heydorn, S. and P. Weidner, Optimization and performance analysis of thinning algorithms on parallel computers, Parallel Computing 17 (1991) 17-27. This paper presents a concept for an implementation of different parallel thinning algorithms on parallel processors. The emphasis is put on a good para