Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A comparative study of hash based approximate nearest neighbor learning and its application in image retrieval

A comparative study of hash based approximate nearest neighbor learning and its application in... Plenty of data are available due to the growth of digital technology that creates a high expectation in retrieving the relevant images, accurately and efficiently for a given query image. For searching the relevant images efficiently for the Large Scale dataset, the searching algorithm should have fast access capability. The existing Exact Nearest Neighbor search performs in linear time and so it takes more time as both the dataset and data dimension increases. As a remedy to provide sub-linear/logarithmic time complexity, usage of Approximate Nearest Neighbor (ANN) algorithms is emerging at a rapid rate. This paper discusses about the importance of ANN and their general classification; the different categories involved in Learning to Hash has been analyzed with their pros and cons; different bit assignment types and methods to minimize the Quantization Errors have been reviewed along with its merits and demerits. Therefore, it serves to increase the efficiency of the Image Retrieval process in Large Scale. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Artificial Intelligence Review Springer Journals

A comparative study of hash based approximate nearest neighbor learning and its application in image retrieval

Artificial Intelligence Review , Volume 52 (1) – Nov 18, 2017

Loading next page...
 
/lp/springer-journals/a-comparative-study-of-hash-based-approximate-nearest-neighbor-ENiP7NyZEA

References (47)

Publisher
Springer Journals
Copyright
Copyright © 2017 by Springer Science+Business Media B.V., part of Springer Nature
Subject
Computer Science; Artificial Intelligence; Computer Science, general
ISSN
0269-2821
eISSN
1573-7462
DOI
10.1007/s10462-017-9591-1
Publisher site
See Article on Publisher Site

Abstract

Plenty of data are available due to the growth of digital technology that creates a high expectation in retrieving the relevant images, accurately and efficiently for a given query image. For searching the relevant images efficiently for the Large Scale dataset, the searching algorithm should have fast access capability. The existing Exact Nearest Neighbor search performs in linear time and so it takes more time as both the dataset and data dimension increases. As a remedy to provide sub-linear/logarithmic time complexity, usage of Approximate Nearest Neighbor (ANN) algorithms is emerging at a rapid rate. This paper discusses about the importance of ANN and their general classification; the different categories involved in Learning to Hash has been analyzed with their pros and cons; different bit assignment types and methods to minimize the Quantization Errors have been reviewed along with its merits and demerits. Therefore, it serves to increase the efficiency of the Image Retrieval process in Large Scale.

Journal

Artificial Intelligence ReviewSpringer Journals

Published: Nov 18, 2017

There are no references for this article.