Please use this identifier to cite or link to this item: https://doi.org/10.1145/1991996.1992003
Title: Learning reconfigurable hashing for diverse semantics
Authors: Mu, Y. 
Chen, X.
Chua, T.-S. 
Yan, S. 
Keywords: locality sensitive hashing
random anchor
reconfigurable hashing
Shannon entropy
Issue Date: 2011
Source: Mu, Y.,Chen, X.,Chua, T.-S.,Yan, S. (2011). Learning reconfigurable hashing for diverse semantics. Proceedings of the 1st ACM International Conference on Multimedia Retrieval, ICMR'11. ScholarBank@NUS Repository. https://doi.org/10.1145/1991996.1992003
Abstract: In recent years, locality-sensitive hashing (LSH) has gained plenty of attention from both the multimedia and computer vision communities due to its empirical success and theoretic guarantee in large-scale visual indexing and retrieval. Conventional LSH algorithms are designated either for generic metrics such as Cosine similarity, ℓ 2-norm and Jaccard index, or for the metrics learned from user-supplied supervision information. The common drawbacks of existing algorithms are their incapability to be adapted to metric changes, along with the inefficacy when handling diverse semantics (e. g., more than 1K different categories in the well-known ImageNet database). For the metrics underlying the hashing structure, even tiny changes tend to nullify previous indexing efforts, which motivates our proposed framework towards "reconfigurable hashing". The basic idea is to maintain a large pool of over-complete hashing functions embedded in the ambient feature space, which serves as the common infrastructure of high-level diverse semantics. At the runtime, the algorithm dynamically selects relevant hashing bits by maximizing the consistency to specific semantics-induced metric, thereby achieving reusability of the pre-computed hashing bits. Such a reusable scheme especially benefits the indexing and retrieval of large-scale dataset, since it facilitates one-off indexing rather than continuous computation-intensive maintenance towards metric adaptation. We propose a sequential bit-selection algorithm based on local consistency and global regularization. Extensive studies are conducted on large-scale image benchmarks to comparatively investigate the performance of different strategies on reconfigurable hashing. Despite the vast literature on hashing, to our best knowledge rare endeavors have been spent toward the reusability of hashing structures in large-scale datasets. © 2011 ACM.
Source Title: Proceedings of the 1st ACM International Conference on Multimedia Retrieval, ICMR'11
URI: http://scholarbank.nus.edu.sg/handle/10635/43345
DOI: 10.1145/1991996.1992003
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

9
checked on Dec 13, 2017

Page view(s)

59
checked on Dec 9, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.