29 January 1999 Invariant geometric hashing
Author Affiliations +
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.
© (1999) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Birkett Huber, Peter F. Stiller, Charles S. Wan, Tejas N. Shah, "Invariant geometric hashing", Proc. SPIE 3584, 27th AIPR Workshop: Advances in Computer-Assisted Recognition, (29 January 1999); doi: 10.1117/12.339831; https://doi.org/10.1117/12.339831
PROCEEDINGS
6 PAGES


SHARE
Back to Top