Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Aho, J. Hoperoft, and J. Ullman, Data Structures and Algorithms, Addision-Wesley, 1983.
O. Bourdon and G. Medioni, “Object Recognition Using Geometric Hashing on the Connection Machine,” International Conference on Pat. tern Recognition, pages 596–600, 1988.
J. G. Dunham, “Optimum Uniform Piecewise Linear Approximation of Planar Curves,” IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 8, No. 1, pages 67–75, 1986.
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.
V. Kumar, A. Grama, A. Gupta, and G. Karypis, Introduction to Parallel Computing: Design and Analysis of Parallel Algorithms, Benjamin/Cummings, 1994.
T. Kwan, B. Totty, and D. Reed, “Communication and Computation Performance of the CM-5,” Proc. of Supercomputing ‘83, pages 192–201, 1993.
C. Leiserson et.al, “The Network Architecture of Connection Machine CM-5,” Technical Report, Thinking Machines Corporation, 1992.
F. Leighton, “Tight Bounds on the Complexity of Parallel Sorting,” IEEE Transactions on Computers, Vol. 34, No. 4, pages 344–354, 1985.
R. Nevatia and K. Babu, “Linear Feature Extraction and Description,” Computer Graphics and Image processing, Vol. 13, pages 257–269, 1980.
V. Prasanna and C. Wang, “Scalable Parallel Implementations of Perceptual Grouping on Connection Machine CM-5,” in International Conference on Pattern Recognition, 1994.
V. Prasanna and C. Wang, “Image Feature Extraction on Connection Machine CM-5,” in Image Understanding Workshop, pages 595–602, 1994.
I. Rogoutsos and R. Hummel, “Massively Parallel Model Matching: Geometric Hashing on the Connection Machine,” IEEE Computer, pages 33–42, 1992.
J. Roberge, “A Data Reduction Algorithm for Planar Curves,” Computer Vision, Graphics, and Image Processing, Vol. 29, pages 168–195, 1985.
Thinking Machines Corporation, CMMD Reference Guide Version 3. 0, 1992.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Prasanna, V., Wang, CL. (1995). Parallelizing Vision Computations on CM-5: Algorithms and Experiences. In: Ferreira, A., Rolim, J.D.P. (eds) Parallel Algorithms for Irregular Problems: State of the Art. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-6130-6_4
Download citation
DOI: https://doi.org/10.1007/978-1-4757-6130-6_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4747-5
Online ISBN: 978-1-4757-6130-6
eBook Packages: Springer Book Archive