Aiming at the hierarchical index method of large image features, the hierarchical index structure of large image is established by using the global position constraint information of large image. This method combines LSH algorithm and KD tree algorithm based on location information. It can control the space complexity of LSH algorithm and the time complexity of KD tree algorithm in high-dimensional feature retrieval. It can speed up the search speed and improve the accuracy of finding the nearest neighbor features, so as to obtain the best comprehensive search performance compared with LSH algorithm and KD tree algorithm. This method mainly includes three steps: extracting thumbnail to build twolayer pyramid image index structure, using LSH algorithm to search rough position for thumbnail, and using KD tree algorithm based on position information to search feature points near neighbor for original image.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
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.