Name
Abstract | ||
|---|---|---|
Motivated by scalable partial-duplicate visual search, there has been growing interest in a wealth of compact and efficient binary feature descriptors (e.g. ORB, FREAK, BRISK). Typically, binary descriptors are clustered into codewords and quantized with Hamming distance, following the conventional bag-of-words strategy. However, such codewords formulated in Hamming space do not present obvious indexing and search performance improvement as compared to the Euclidean codewords. In this paper, without explicit codeword construction, we explore the use of partial binary descriptors as direct codebook indices (addresses). We propose a novel approach to build multiple index tables which concurrently check for collision of the same hash values. The evaluation is performed on two public image datasets: DupImage and Holidays. The experimental results demonstrate the indexing efficiency and retrieval accuracy of our approach. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1145/2578726.2578780 | ICMR |
Keywords | Field | DocType |
multiple index tables,scalable image search,novel approach,hamming distance,euclidean codewords,indexing efficiency,scalable partial-duplicate visual search,binary descriptors,present obvious indexing,efficient binary feature descriptors,hamming space,partial binary descriptors | Pattern recognition,Computer science,Search engine indexing,Hamming distance,Code word,Artificial intelligence,Hash function,Decoding methods,Hamming space,Codebook,Binary number | Conference |
Citations | PageRank | References |
8 | 0.46 | 15 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Junjie Cai | 1 | 39 | 2.79 |
| Qiong Liu | 2 | 8 | 0.46 |
| Francine Chen | 3 | 1218 | 153.96 |
| Dhiraj Joshi | 4 | 2719 | 122.87 |
| Qi Tian | 5 | 6443 | 331.75 |