Robust sparse hashing

Anoop Cherian, Vassilios Morellas, Nikolaos P Papanikolopoulos

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Citations (Scopus)

Abstract

We study Nearest Neighbors (NN) retrieval by introducing a new approach: Robust Sparse Hashing (RSH). Our approach is inspired by the success of dictionary learning for sparse coding; the key innovation is to use learned sparse codes as hashcodes for speeding up NN. But sparse coding suffers from a major drawback: when data are noisy or uncertain, for a query point, an exact match of the hashcode seldom happens, breaking the NN retrieval. We tackle this difficulty via our novel dictionary learning and sparse coding framework called RSH by learning dictionaries on the robustified counterparts of uncertain data points. The algorithm is applied to NN retrieval for Scale Invariant Feature Transform (SIFT) descriptors. The results demonstrate that RSH is noise tolerant, and at the same time shows promising NN performance over the state-of-the-art.

Original languageEnglish (US)
Title of host publication2012 IEEE International Conference on Image Processing, ICIP 2012 - Proceedings
Pages2417-2420
Number of pages4
DOIs
StatePublished - Dec 1 2012
Event2012 19th IEEE International Conference on Image Processing, ICIP 2012 - Lake Buena Vista, FL, United States
Duration: Sep 30 2012Oct 3 2012

Other

Other2012 19th IEEE International Conference on Image Processing, ICIP 2012
CountryUnited States
CityLake Buena Vista, FL
Period9/30/1210/3/12

Fingerprint

Glossaries
Innovation
Mathematical transformations

Keywords

  • Nearest neighbors
  • Robust optimization
  • Sparse coding

Cite this

Cherian, A., Morellas, V., & Papanikolopoulos, N. P. (2012). Robust sparse hashing. In 2012 IEEE International Conference on Image Processing, ICIP 2012 - Proceedings (pp. 2417-2420). [6467385] https://doi.org/10.1109/ICIP.2012.6467385

Robust sparse hashing. / Cherian, Anoop; Morellas, Vassilios; Papanikolopoulos, Nikolaos P.

2012 IEEE International Conference on Image Processing, ICIP 2012 - Proceedings. 2012. p. 2417-2420 6467385.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Cherian, A, Morellas, V & Papanikolopoulos, NP 2012, Robust sparse hashing. in 2012 IEEE International Conference on Image Processing, ICIP 2012 - Proceedings., 6467385, pp. 2417-2420, 2012 19th IEEE International Conference on Image Processing, ICIP 2012, Lake Buena Vista, FL, United States, 9/30/12. https://doi.org/10.1109/ICIP.2012.6467385
Cherian A, Morellas V, Papanikolopoulos NP. Robust sparse hashing. In 2012 IEEE International Conference on Image Processing, ICIP 2012 - Proceedings. 2012. p. 2417-2420. 6467385 https://doi.org/10.1109/ICIP.2012.6467385
Cherian, Anoop ; Morellas, Vassilios ; Papanikolopoulos, Nikolaos P. / Robust sparse hashing. 2012 IEEE International Conference on Image Processing, ICIP 2012 - Proceedings. 2012. pp. 2417-2420
@inproceedings{1a489a104b734476ae7d04bbff4f146f,
title = "Robust sparse hashing",
abstract = "We study Nearest Neighbors (NN) retrieval by introducing a new approach: Robust Sparse Hashing (RSH). Our approach is inspired by the success of dictionary learning for sparse coding; the key innovation is to use learned sparse codes as hashcodes for speeding up NN. But sparse coding suffers from a major drawback: when data are noisy or uncertain, for a query point, an exact match of the hashcode seldom happens, breaking the NN retrieval. We tackle this difficulty via our novel dictionary learning and sparse coding framework called RSH by learning dictionaries on the robustified counterparts of uncertain data points. The algorithm is applied to NN retrieval for Scale Invariant Feature Transform (SIFT) descriptors. The results demonstrate that RSH is noise tolerant, and at the same time shows promising NN performance over the state-of-the-art.",
keywords = "Nearest neighbors, Robust optimization, Sparse coding",
author = "Anoop Cherian and Vassilios Morellas and Papanikolopoulos, {Nikolaos P}",
year = "2012",
month = "12",
day = "1",
doi = "10.1109/ICIP.2012.6467385",
language = "English (US)",
isbn = "9781467325332",
pages = "2417--2420",
booktitle = "2012 IEEE International Conference on Image Processing, ICIP 2012 - Proceedings",

}

TY - GEN

T1 - Robust sparse hashing

AU - Cherian, Anoop

AU - Morellas, Vassilios

AU - Papanikolopoulos, Nikolaos P

PY - 2012/12/1

Y1 - 2012/12/1

N2 - We study Nearest Neighbors (NN) retrieval by introducing a new approach: Robust Sparse Hashing (RSH). Our approach is inspired by the success of dictionary learning for sparse coding; the key innovation is to use learned sparse codes as hashcodes for speeding up NN. But sparse coding suffers from a major drawback: when data are noisy or uncertain, for a query point, an exact match of the hashcode seldom happens, breaking the NN retrieval. We tackle this difficulty via our novel dictionary learning and sparse coding framework called RSH by learning dictionaries on the robustified counterparts of uncertain data points. The algorithm is applied to NN retrieval for Scale Invariant Feature Transform (SIFT) descriptors. The results demonstrate that RSH is noise tolerant, and at the same time shows promising NN performance over the state-of-the-art.

AB - We study Nearest Neighbors (NN) retrieval by introducing a new approach: Robust Sparse Hashing (RSH). Our approach is inspired by the success of dictionary learning for sparse coding; the key innovation is to use learned sparse codes as hashcodes for speeding up NN. But sparse coding suffers from a major drawback: when data are noisy or uncertain, for a query point, an exact match of the hashcode seldom happens, breaking the NN retrieval. We tackle this difficulty via our novel dictionary learning and sparse coding framework called RSH by learning dictionaries on the robustified counterparts of uncertain data points. The algorithm is applied to NN retrieval for Scale Invariant Feature Transform (SIFT) descriptors. The results demonstrate that RSH is noise tolerant, and at the same time shows promising NN performance over the state-of-the-art.

KW - Nearest neighbors

KW - Robust optimization

KW - Sparse coding

UR - http://www.scopus.com/inward/record.url?scp=84875865475&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84875865475&partnerID=8YFLogxK

U2 - 10.1109/ICIP.2012.6467385

DO - 10.1109/ICIP.2012.6467385

M3 - Conference contribution

SN - 9781467325332

SP - 2417

EP - 2420

BT - 2012 IEEE International Conference on Image Processing, ICIP 2012 - Proceedings

ER -