Large visual repository search with hash collision design optimization

Xin Xin, Abhishek Nagar, Gaurav Srivastava, Zhu Li, Felix Fernandes, Aggelos K Katsaggelos

Research output: Contribution to journalArticlepeer-review

1 Scopus citations


Visual search over large image repositories in real time is one of the key challenges for applications such as mobile visual query-by-capture, augmented reality, and biometrics-based identification. Search accuracy and response speed are two important performance factors. This article focuses on one of the important elements of this technology that enables large-scale visual search: indexing (or hashing). Indexing is the process of organizing a database of searchable elements into an efficiently searchable configuration. The searchable elements in our case are compact features extracted from images. This article explores a new indexing scheme. The authors optimize the design of a hash-code collision and counting scheme to enable fast search of visual features of MPEG CDVS.

Original languageEnglish (US)
Article number6530593
Pages (from-to)62-71
Number of pages10
JournalIEEE Multimedia
Issue number2
StatePublished - Jun 26 2013


  • CDVS
  • MPEG
  • hash-code collision
  • indexing
  • large-scale visual search
  • mobile search
  • multimedia
  • multimedia applications

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Media Technology
  • Hardware and Architecture
  • Computer Science Applications

Fingerprint Dive into the research topics of 'Large visual repository search with hash collision design optimization'. Together they form a unique fingerprint.

Cite this