๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Algorithms for image component labeling on SIMD mesh-connected computers

โœ Scribed by Cypher, R.E.; Sanz, J.L.C.; Snyder, L.

Book ID
119772376
Publisher
IEEE
Year
1990
Tongue
English
Weight
713 KB
Volume
39
Category
Article
ISSN
0018-9340

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A Fast Algorithm for Image Component Lab
A Fast Algorithm for Image Component Labeling with Local Operators on Mesh Connected Computers
โœ H.C. Shi; G.X. Ritter ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 562 KB

A new parallel algorithm for image component labeling with local operators on SIMD mesh connected computers is presented. This algorithm provides a positive answer to the open question of whether there exists an \(O(n)\)-time and \(O(\log n)\)-space local labeling algorithm on SIMD mesh connected co

A fast general algorithm for extracting
A fast general algorithm for extracting image features on SIMD mesh-connected computers
โœ Hongchi Shi; Gerhard X. Ritter; Joseph N. Wilson ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 504 KB

Extracting features of components in an image is an important step for recognition of objects in the image. In this paper, we develop a general formula for extracting some geometric features of image components such as area, perimeter, compactness, height, width, diameter, moments, and centroid. We

Algorithms for connected component label
Algorithms for connected component labeling based on quadtrees
โœ Kunio Aizawa; Shojiro Tanaka; Koyo Motomura; Ryosuke Kadowaki ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 346 KB

## Abstract An algorithm of linear time complexity is presented to label connected components of a binary image by a quadtree. For a given node, the search for all adjacent nodes is carried out in __O__(1) (i.e., constant time complexity for the worst case) using our formerly presented algorithm in