Perceptual grouping is a key step in vision to organize image data into structural hypotheses to be used for high level analysis. We propose data allocation and load balancing strategies which reduce the communication cost and evenly distribute the grouping operations among the processors. These techniques result in scalable algorithms for performing perceptual grouping on CM-5. The performance of our algorithms depends only on the total grouping operations generated by the image data and is independent of the distribution of the data among the processors. Our implementations show that given a 1 K/spl times/1 K input image, extraction of line segments and several perceptual grouping steps can be performed in 5.0 seconds using a partition of CM-5 having 32 processing nodes. A serial implementation of these steps on a Sun Sparc 400 takes more than 2 minutes.
[1]
Viktor K. Prasanna,et al.
Scalable Data Parallel Implementations of Object Recognition Using Geometric Hashing
,
1994,
J. Parallel Distributed Comput..
[2]
James Robergé.
A data reduction algorithm for planar curves
,
1985,
Comput. Vis. Graph. Image Process..
[3]
Frank Thomson Leighton,et al.
Tight Bounds on the Complexity of Parallel Sorting
,
1985,
IEEE Trans. Computers.
[4]
David G. Lowe,et al.
Perceptual Organization and Visual Recognition
,
2012
.
[5]
K. Ramesh Babu,et al.
Linear Feature Extraction and Description
,
1979,
IJCAI.
[6]
T. T. Kwan,et al.
Communication and computation performance of the CM-5
,
1993,
Supercomputing '93.