Invariant geometric hashing

Birkett Huber; Peter F. Stiller; Charles S. Wan; Tejas N. Shah

doi:10.1117/12.339831

29 January 1999 Invariant geometric hashing

Birkett Huber, Peter F. Stiller, Charles S. Wan, Tejas N. Shah

Proceedings Volume 3584, 27th AIPR Workshop: Advances in Computer-Assisted Recognition; (1999) https://doi.org/10.1117/12.339831
Event: The 27th AIPR Workshop: Advances in Computer-Assisted Recognition, 1998, Washington, DC, United States

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.

Citation Download Citation

Birkett Huber, Peter F. Stiller, Charles S. Wan, and Tejas N. Shah "Invariant geometric hashing", Proc. SPIE 3584, 27th AIPR Workshop: Advances in Computer-Assisted Recognition, (29 January 1999); https://doi.org/10.1117/12.339831

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available