Parallelizing Vision Computations on CM-5: Algorithms and Experiences

This chapter summarizes our work in using Connection Machine CM-5 for vision. We define a realistic model of CM-5 in which explicit cost is associated with data routing and cooperative operations. Using this model, we develop scalable parallel algorithms for representative problems in vision computations at all three levels: low-level, intermediate-level and high-level.

[1]  James Robergé A data reduction algorithm for planar curves , 1985, Comput. Vis. Graph. Image Process..

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

[3]  Frank Thomson Leighton,et al.  Tight Bounds on the Complexity of Parallel Sorting , 1985, IEEE Trans. Computers.

[4]  James George Dunham,et al.  Optimum Uniform Piecewise Linear Approximation of Planar Curves , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  K. Ramesh Babu,et al.  Linear Feature Extraction and Description , 1979, IJCAI.

[6]  George Karypis,et al.  Introduction to Parallel Computing , 1994 .

[7]  T. T. Kwan,et al.  Communication and computation performance of the CM-5 , 1993, Supercomputing '93.

[8]  Gerard Medioni,et al.  Object recognition using geometric hashing on the Connection Machine , 1990, [1990] Proceedings. 10th International Conference on Pattern Recognition.

[9]  Alfred V. Aho,et al.  Data Structures and Algorithms , 1983 .

[10]  Robert A. Hummel,et al.  Massively parallel model matching: geometric hashing on the Connection Machine , 1992, Computer.

[11]  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).