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
Connected component labeling for binary images on a reconfigurable mesh architecture
โ Scribed by Prabir Bhattacharya
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 311 KB
- Volume
- 42
- Category
- Article
- ISSN
- 1383-7621
No coin nor oath required. For personal study only.
โฆ Synopsis
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 a bottom-up divide-and-conquer strategy. Both these algorithms have run times that are logarithmic functions of the image size.
๐ SIMILAR VOLUMES
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