Abstract
Model-based computer vision systems which recognize objects in single grayscale images require the matching of stored object models and the image data resulting from the perspective projection. If objects may be located arbitrarily in relation to each other occlusions can occur, thereby creating different line configurations in the projected image with different viewing directions. For a collection of polyhedral objects containing n vertices, there are of the order O(n 3) different general views and O(n 2) degenerate views and the algoritmic complexity for constructing a view list is O(n 3), where n is the sum of polyhedral bounding faces part of the assembly convex hull and planes arising from visual interaction of polyhedral parts inside the convex hull.
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.
Download to read the full chapter text
Chapter PDF
References
Edelsbrunner, H. Algorithms in Combinatorial Geometry. EATCS Monographs on Theoretical Computer Science, Volume 10. Berlin: Springer-Verlag 1987.
Gigus, Z., Canny J., and Seidel, R. Efficiently Computing and Representing Aspect Graphs of Polyhedral Objects. Second Int. Conf. on Computer Vision, Tarpon Springs, Florida. 30–39 (1988).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Andersen, J.D. (1990). Combinatorial characterization of perspective projections from polyhedral object scenes. In: Faugeras, O. (eds) Computer Vision — ECCV 90. ECCV 1990. Lecture Notes in Computer Science, vol 427. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0014906
Download citation
DOI: https://doi.org/10.1007/BFb0014906
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52522-6
Online ISBN: 978-3-540-47011-3
eBook Packages: Springer Book Archive