Abstract
Tasks in image processing and computer vision are computationally very intensive. Furthermore, many applications such as robotics, target acquisition, and navigation require real time or near real time processing. Thus, developing efficient algorithms matched to high-performance architectures is a critical area of research in computer vision. In this chapter we describe parallel implementations of the object recognition algorithms described in Part II. The discussion in this chapter is very limited in scope, mainly discussing our work of parallel implementation of algorithms given in Part II using two different parallel architectures, the Connection Machine (CM) 1 and the hypercube. For general discussions of parallel computing in vision, the interested reader could refer to Duff and Levialdi [1981], Duff [1978, 1986], Levialdi [1985], Reeves [1984], Uhr [1984, 1987a, 1978b], Yalamanchili et al. [1985], Cypher and Sanz [1989], Chaudhary and Aggarwal [1990], Crisman and Webb [1991], and Preston and Uhr [1982]. For a general reference for parallel architectures, Almasi and Gottilieb [1989] and Hwang and Briggs [1984] are excellent references.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag Tokyo
About this chapter
Cite this chapter
Suk, M., Bhandarkar, S.M. (1992). Parallel Implementations of Recognition Techniques. In: Three-Dimensional Object Recognition from Range Images. Computer Science Workbench. Springer, Tokyo. https://doi.org/10.1007/978-4-431-68213-4_9
Download citation
DOI: https://doi.org/10.1007/978-4-431-68213-4_9
Publisher Name: Springer, Tokyo
Print ISBN: 978-4-431-68215-8
Online ISBN: 978-4-431-68213-4
eBook Packages: Springer Book Archive