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 image features on SIMD mesh-connected computers
โ Scribed by Hongchi Shi; Gerhard X. Ritter; Joseph N. Wilson
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 504 KB
- Volume
- 30
- Category
- Article
- ISSN
- 0031-3203
No coin nor oath required. For personal study only.
โฆ Synopsis
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 then design a fast algorithm for the general formula on SlMD mesh-connected computers. The algorithm uses a pipelining technique to compute a geometric property of kn components at the same time. It takes O([m/kn]n) time to compute a geometric property of all the components in an n x n image on an n x n SIMD mesh-connected computer with O(k) local space in each processing element, where m is the number of components in the image and k is an integer between l and [m/n]. Compared with previous algorithms, it speeds up the feature extraction process by at least k times.
๐ SIMILAR VOLUMES