A fast general algorithm for extracting image features on SIMD mesh-connected computers

Authors:
Hongchi Shi;Gerhard X. Ritter;Joseph N. Wilson
Affiliations:
Department of Computer Engineering and Computer Science, Engineering Building West, Room 331, University of Missouri - Columbia, Columbia, MO 65211, U.S.A.;Department of Computer and Information Sciences, University of Florida, Gainesville, FL 32611, U.S.A.;Department of Computer and Information Sciences, University of Florida, Gainesville, FL 32611, U.S.A.
Venue:
Pattern Recognition
Year:
1997

Citing 8
Cited 0

Digital topology: introduction and survey

Computer Vision, Graphics, and Image Processing
Efficient parallel algorithms for the computation of two-dimensional image moments

Pattern Recognition
A note on efficient parallel algorithms for the computation of two-dimensional image moments

Pattern Recognition
Parallel Architectures and Algorithms for Image Component Labeling

IEEE Transactions on Pattern Analysis and Machine Intelligence
A fast algorithm for image component labeling with local operators on mesh connected computers

Journal of Parallel and Distributed Computing
Digital Picture Processing

Digital Picture Processing
O(n)-Time and O(log n)-Space Image Component Labeling with Local Operations on SIMD Mesh Connected Computers

ICPP '93 Proceedings of the 1993 International Conference on Parallel Processing - Volume 03
Parallel Image Processing by Memory-Augmented Cellular Automata

IEEE Transactions on Pattern Analysis and Machine Intelligence

Quantified Score

Hi-index	0.01

Visualization

Abstract

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 SIMD 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 1 and @?m/n@?. Compared with previous algorithms, it speeds up the feature extraction process by at least k times.