Large Visual Repository Search with Hash Collision Design Optimization

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

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.