The Community for Technology Leaders
Green Image
Issue No. 02 - April-June (2013 vol. 20)
ISSN: 1070-986X
pp: 62-71
Aggelos K. Katsaggelos , Northwestern University
Felix Fernandes , Samsung Research America
Zhu Li , Samsung Research America
Gaurav Srivastava , Samsung Research America
Abhishek Nagar , Samsung Research America
Xin Xin , Samsung Research America and Northwestern University
ABSTRACT
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.
INDEX TERMS
Real time systems, Visualization, Search methods, LIbraries, Augmented reality, Biometrics, Image processing, Query processing, CDVS, multimedia, multimedia applications, large-scale visual search, indexing, hash-code collision, mobile search, MPEG
CITATION
Aggelos K. Katsaggelos, Felix Fernandes, Zhu Li, Gaurav Srivastava, Abhishek Nagar, Xin Xin, "Large Visual Repository Search with Hash Collision Design Optimization", IEEE MultiMedia, vol. 20, no. , pp. 62-71, April-June 2013, doi:10.1109/MMUL.2013.22
100 ms
(Ver )