Abstract
Object recognition starts from a set of image measurements (including locations of points, lines, surfaces, color, and shading), which provides access into a database where representations of objects are stored. We describe a complexity theory of indexing, a meta-analysis which identifies the best set of measurements (up to algebraic transformations) such that: (1) the representation of objects are linear subspaces and thus easy to learn; (2) direct indexing is efficient since the linear subspaces are of minimal rank. The index complexity is determined via a simple process, equivalent to computing the rank of a matrix. We readily re-derive the index complexity of the few previously analyzed cases. We then compute the best index for new cases: 6 points in one perspective image, and 6 directions in one para-perspective image; the most efficient representation of a color is a plane in 3D space. For future applications with any vision problem where the relations between shape and image measurements can be written down in an algebraic form, we give an automatic process to construct the most efficient database that can be directly obtained by learning from examples.
This research was supported the Israeli Ministry of Science under Grant 032.7568, and by the U.S. Office of Naval Research under Grant N00014-93-1-1202, R&T Project Code 4424341-01.
Chapter PDF
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.
References
D. T. Clemens and D. W. Jacobs. Space and time bounds on indexing 3-D models from 2-D images. IEEE T-PAMI, 13(10):1007–1017, 1991.
D. P. Huttenlocher and S. Ullman. Recognizing solid objects by alignment with an image. IJCV, 5:195–212, 1990.
D. W. Jacobs. Matching 3-D models to 2-D images. IJCV, 1995. in press.
Y. Lamdan and H. Wolfson. Geometric hashing: a general and efficient recognition scheme. In Proc. 2nd ICCV, pages 238–251, Tarpon Springs, FL, 1988. IEEE, Washington, DC.
L. T. Maloney and B. Wandell. A computational model of color constancy. JOSA, 1:29–33, 1986.
Y. Moses and S. Ullman. Limitations of non model-based recognition schemes. In G. Sandini, editor, Proc. 2nd ECCV, Lecture Notes in Computer Science, volume 588, pages 820–828. Springer Verlag, 1992.
H. Murase and S. K. Nayar. Visual learning and recognition of 3-D objects from appearance. IJCV, 1995. in press.
C.A. Rothwell, D.A. Forsyth, A. Zisserman, and J.L. Mundy. Extracting projective structure from single perspective views of 3d point sets. In Proc. 4th ICCV, pages 573–582, Berlin, Germany, 1993. IEEE, Washington, DC.
D. Weinshall. Model-based invariants for 3D vision. IJCV, 10(1):27–42, 1993.
D. Weinshall, M. Werman, and A. Shashua. Duality of multi-point and multiframe Geometry: Fundamental Shape Matrices and Tensors. In Proc. 4th ECCV, Cambridge, UK, 1996.
M. Werman and A. Shashua. Elimination: An approach to the study of 3D-from-2D. In Proc. ICCV, June 1995.
M. Werman and D. Weinshall. Complexity of indexing: Efficient and learnable large database indexing. TR 95–7, Hebrew University, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Werman, M., Weinshall, D. (1996). Complexity of indexing: Efficient and learnable large database indexing. In: Buxton, B., Cipolla, R. (eds) Computer Vision — ECCV '96. ECCV 1996. Lecture Notes in Computer Science, vol 1064. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015576
Download citation
DOI: https://doi.org/10.1007/BFb0015576
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61122-6
Online ISBN: 978-3-540-49949-7
eBook Packages: Springer Book Archive