Abstract
We consider in this chapter the problem of recognition and localization of polyhedral objects from range images. Of particular interest are scenes that contain multiple polyhedral objects with objects partially occluding each other. As we have pointed out in the previous chapter, global shape descriptors are ineffective in the face of occlusion and clutter. Recognition-via-localization using only local shape descriptors in conjunction with a proper constraint propagation technique proves to be effective for solving this particular problem. We consider both the interpretation tree (IT) search and the generalized Hough transform in this chapter. In particular, we show that the use of qualitative features can achieve a significant reduction in the combinatorial complexity of the search space of scene interpretations, resulting in fewer spurious scene interpretation hypotheses being generated and greater robustness and efficiency for the recognition and localization process.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
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). Polyhedral Object Recognition. In: Three-Dimensional Object Recognition from Range Images. Computer Science Workbench. Springer, Tokyo. https://doi.org/10.1007/978-4-431-68213-4_6
Download citation
DOI: https://doi.org/10.1007/978-4-431-68213-4_6
Publisher Name: Springer, Tokyo
Print ISBN: 978-4-431-68215-8
Online ISBN: 978-4-431-68213-4
eBook Packages: Springer Book Archive