We show how some existing component labeling algorithms for binary images could be speeded up by using the reconfigurable mesh architecture. Two algorithms are presented, the first one uses the ability of the reconfigurable mesh to perform certain operations in constant time, and the second one uses
โฆ LIBER โฆ
In-place Algorithm for Erasing a Connected Component in a Binary Image
โ Scribed by Tetsuo Asano
- Publisher
- Springer
- Year
- 2011
- Tongue
- English
- Weight
- 539 KB
- Volume
- 50
- Category
- Article
- ISSN
- 1433-0490
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Connected component labeling for binary
โ
Prabir Bhattacharya
๐
Article
๐
1996
๐
Elsevier Science
๐
English
โ 311 KB
A novel line scan clustering algorithm f
โ
Yang Yang; David Zhang
๐
Article
๐
2003
๐
Elsevier Science
๐
English
โ 574 KB
A Fast Algorithm for Image Component Lab
โ
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 decomposition algorithm for shortest p
โ
P. Brucker
๐
Article
๐
1974
๐
Springer
๐
English
โ 161 KB
Efficient systolic algorithm for finding
โ
M Zubair; B.B Madan
๐
Article
๐
1988
๐
Elsevier Science
๐
English
โ 472 KB
A hybrid algorithm for PET/CT image merg
โ
John A. Kennedy; Ora Israel; Alex Frenkel; Rachel Bar-Shalom; Haim Azhari
๐
Article
๐
2006
๐
Springer
๐
English
โ 615 KB