Parallel Implementations of Perceptual Grouping Taskson Distributed Memory Machines

(Summary of Results) Abstract In this paper, we propose parallel implementations for solving Perceptual Grouping tasks on distributed memory machines. Our implementations show that, given 7K line segments extracted from a 1K 1K image, the Line Grouping task can be performed in 0.486 seconds using a partition of CM-5 having 256 processing nodes and in 0.382 seconds using a 16-node Cray T3D. The serial implementation written in C takes 20.368 seconds and 4.181 seconds using 1-node CM-5 and 1-node T3D respectively. Our code is written in C and MPI message passing standard and can be easily ported to other high performance computing platforms.

[1]  Jake K. Aggarwal,et al.  Applying perceptual organization to the detection of man-made objects in non-urban scenes , 1992, Pattern Recognit..

[2]  Message Passing Interface Forum.  MPI: A message - passing interface standard , 1994 .

[3]  Viktor K. Prasanna,et al.  Parallelization of perceptual grouping on distributed memory machines , 1995, Proceedings of Conference on Computer Architectures for Machine Perception.

[4]  Viktor K. Prasanna,et al.  Scalable Data Parallel Implementations of Object Recognition Using Geometric Hashing , 1994, J. Parallel Distributed Comput..

[5]  Viktor K. Prasanna,et al.  Scalable parallel implementations of perceptual grouping on connection machine CM-5 , 1994, Proceedings of the 12th IAPR International Conference on Pattern Recognition, Vol. 2 - Conference B: Computer Vision & Image Processing. (Cat. No.94CH3440-5).

[6]  Cho-Li Wang.  High performance computing for vision on distributed-memory machines , 1996 .