%0 Journal Article
%T Asymmetric Distances for Binary Embeddings
%A Albert Gordo
%A Florent Perronnin
%A Yunchao Gong
%A Svetlana Lazebnik
%J IEEE Transactions on Pattern Analysis and Machine Intelligence
%D 2014
%V 36
%N 1
%@ 0162-8828
%F Albert Gordo2014
%O DAG; 600.045; 605.203; 600.077
%O exported from refbase (http://refbase.cvc.uab.es/show.php?record=2272), last updated on Tue, 24 Feb 2015 10:27:20 +0100
%X 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 which 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 which 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), PCA Embedding with random rotations (PCAE-RR), and PCA Embedding 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.
%U http://refbase.cvc.uab.es/files/GPG2014.pdf
%U http://dx.doi.org/10.1109/TPAMI.2013.101
%P 33-47