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.
KeywordsHash Function Hash Table Image Block Perceptual Group Total Execution Time
Unable to display preview. Download preview PDF.
- A. Aho, J. Hoperoft, and J. Ullman, Data Structures and Algorithms, Addision-Wesley, 1983.Google Scholar
- O. Bourdon and G. Medioni, “Object Recognition Using Geometric Hashing on the Connection Machine,” International Conference on Pat. tern Recognition, pages 596–600, 1988.Google Scholar
- A. Huertas, C. Lin, and R. Nevatia, “Detection of Buildings from Mono-cular Views of Aerial Scenes Using Perceptual Grouping and Shadows,” Image Understanding Workshop, pages 253–260, 1993.Google Scholar
- V. Kumar, A. Grama, A. Gupta, and G. Karypis, Introduction to Parallel Computing: Design and Analysis of Parallel Algorithms, Benjamin/Cummings, 1994.Google Scholar
- T. Kwan, B. Totty, and D. Reed, “Communication and Computation Performance of the CM-5,” Proc. of Supercomputing ‘83, pages 192–201, 1993.Google Scholar
- C. Leiserson et.al, “The Network Architecture of Connection Machine CM-5,” Technical Report, Thinking Machines Corporation, 1992.Google Scholar
- R. Nevatia and K. Babu, “Linear Feature Extraction and Description,” Computer Graphics and Image processing, Vol. 13, pages 257–269, 1980.Google Scholar
- V. Prasanna and C. Wang, “Scalable Parallel Implementations of Perceptual Grouping on Connection Machine CM-5,” in International Conference on Pattern Recognition, 1994.Google Scholar
- V. Prasanna and C. Wang, “Image Feature Extraction on Connection Machine CM-5,” in Image Understanding Workshop, pages 595–602, 1994.Google Scholar
- I. Rogoutsos and R. Hummel, “Massively Parallel Model Matching: Geometric Hashing on the Connection Machine,” IEEE Computer, pages 33–42, 1992.Google Scholar
- Thinking Machines Corporation, CMMD Reference Guide Version 3. 0, 1992.Google Scholar
- C. Wang, V. K. Prasanna, H. Kim, and A. Khokhar, “Scalable Data Parallel Implementations of Object Recognition using Geometric Hashing,” Journal of Parallel and Distributed Computing, pages 96–109, March 1994.Google Scholar