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

Hypercube and shuffle-exchange algorithms for image component labeling

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

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
704 KB
Volume
10
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

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