Efficient Similarity Search via Sparse Coding

Cherian, Anoop
Morellas, Vassilios
2011-11-21
Thumbnail Image

View/Download File

11-028.pdf (943.76 KB)

Persistent link to this item

https://hdl.handle.net/11299/215875
Statistics
View Statistics

Journal Title

Journal ISSN

Volume Title

Title

Efficient Similarity Search via Sparse Coding

Authors

Published Date

2011-11-21

Publisher

Type

Report

Abstract

This work presents a new indexing method using sparse coding for fast approximate Nearest Neighbors (NN) on high dimensional image data. To begin with we sparse code the data using a learned basis dictionary and an index of the dictionary's support set is next used to generate one compact identifier for each data point. As basis combinations increase exponentially with an increasing support set, each data point is likely to get a unique identifier that can be used to index a hash table for fast NN operations. When dealing with real world data, the identifiers corresponding to the query point and the true nearest neighbors in the database seldom match exactly (due to image noise, distortion, etc.). To accommodate these near matches, we propose a novel extension of the framework that utilizes the regularization path of the LASSO formulation to create robust hash codes. Experiments are conducted on large datasets and demonstrate that our algorithm rivals state-of-the-art NN techniques in search time, accuracy and memory usage.

Keywords

Description

Related to

Replaces

License

Collections

Computer Science & Engineering (CS&E) Technical Reports

Series/Report Number

Technical Report; 11-028

Funding information

Isbn identifier

Doi identifier

Previously Published Citation

Suggested citation

Cherian, Anoop; Morellas, Vassilios. (2011). Efficient Similarity Search via Sparse Coding. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215875.

Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.