This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Asymmetric Distances for Binary Embeddings
Jan. 2014 (vol. 36 no. 1)
pp. 33-47
Albert Gordo, Universitat Autònoma de Barcelona, Barcelona
Florent Perronnin, Xerox Research Centre Europe, Grenoble
Yunchao Gong, University of North Carolina at Chapel Hill, Chapel Hill
Svetlana Lazebnik, University of Illinois at Urbana-Champaign, Urbana-Champaign
In large-scale query-by-example retrieval, embedding image signatures in a binary space offers two benefits: data compression and search efficiency. While most embedding algorithms binarize both query and database signatures, it has been noted that this is not strictly a requirement. Indeed, asymmetric schemes that binarize the database signatures but not the query still enjoy the same two benefits but may provide superior accuracy. In this work, we propose two general asymmetric distances that are applicable to a wide variety of embedding techniques including locality sensitive hashing (LSH), locality sensitive binary codes (LSBC), spectral hashing (SH), PCA embedding (PCAE), PCAE with random rotations (PCAE-RR), and PCAE with iterative quantization (PCAE-ITQ). We experiment on four public benchmarks containing up to 1M images and show that the proposed asymmetric distances consistently lead to large improvements over the symmetric Hamming distance for all binary embedding techniques.
Index Terms:
asymmetric distances,Large-scale retrieval,binary codes
Citation:
Albert Gordo, Florent Perronnin, Yunchao Gong, Svetlana Lazebnik, "Asymmetric Distances for Binary Embeddings," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 36, no. 1, pp. 33-47, Jan. 2014, doi:10.1109/TPAMI.2013.101
Usage of this product signifies your acceptance of the Terms of Use.