Share Email Print
cover

Proceedings Paper

Invariant geometric hashing
Author(s): Birkett Huber; Peter F. Stiller; Charles S. Wan; Tejas N. Shah
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

We described a technique for using geometric information contained in 2D images to search large databases of 3D models in the special case where the geometric information consists in finite point configurations. This technique exploits certain polynomial relations known as object/image equations between invariant coordinates assigned to 2D and 3D feature sets. The resulting scheme is invariant to changes in scale and perspective. Here, we describe a technique for constructing indexes (i.e. a hashing scheme) based on this technology.

Paper Details

Date Published: 29 January 1999
PDF: 6 pages
Proc. SPIE 3584, 27th AIPR Workshop: Advances in Computer-Assisted Recognition, (29 January 1999); doi: 10.1117/12.339831
Show Author Affiliations
Birkett Huber, Mathematical Sciences Research Institute (United States)
Peter F. Stiller, Texas A&M Univ. (United States)
Charles S. Wan, Sarnoff Corp. (United States)
Tejas N. Shah, Texas A&M Univ. (United States)


Published in SPIE Proceedings Vol. 3584:
27th AIPR Workshop: Advances in Computer-Assisted Recognition

© SPIE. Terms of Use
Back to Top