skip to main content
10.1145/2647868.2654898acmconferencesArticle/Chapter ViewAbstractPublication PagesmmConference Proceedingsconference-collections
research-article

Optimized Distances for Binary Code Ranking

Published: 03 November 2014 Publication History

Abstract

Binary encoding on high-dimensional data points has attracted much attention due to its computational and storage efficiency. While numerous efforts have been made to encode data points into binary codes, how to calculate the effective distance on binary codes to approximate the original distance is rarely addressed. In this paper, we propose an effective distance measurement for binary code ranking. In our approach, the binary code is firstly decomposed into multiple sub codes, each of which generates a query-dependent distance lookup table. Then the distance between the query and the binary code is constructed as the aggregation of the distances from all sub codes by looking up their respective tables. The entries of the lookup tables are optimized by minimizing the misalignment between the approximate distance and the original distance. Such a scheme is applied to both the symmetric distance and the asymmetric distance. Extensive experimental results show superior performance of the proposed approach over state-of-the-art methods on three real-world high-dimensional datasets for binary code ranking.

References

[1]
A. Babenko and V. S. Lempitsky. The inverted multi-index. In CVPR, 2012.
[2]
C. Du and J. Wang. Inner product similarity search using compositional codes. CoRR, abs/1406.4966, 2014.
[3]
Y. Gong and S. Lazebnik. Iterative quantization: A procrustean approach to learning binary codes. In CVPR, 2011.
[4]
A. Gordo, F. Perronnin, Y. Gong, and S. Lazebnik. Asymmetric distances for binary embeddings. IEEE Trans. Pattern Anal. Mach. Intell., 2014.
[5]
J. Heo, Y. Lee, J. He, S. Chang, and S. Yoon. Spherical hashing. In CVPR, 2012.
[6]
P. Indyk and R. Motwani. Approximate nearest neighbors: Towards removing the curse of dimensionality. In STOC, 1998.
[7]
M. Jain, H. Jégou, and P. Gros. Asymmetric hamming embedding: taking the best of our bits for large scale image search. In ACM Multimedia, 2011.
[8]
H. Jégou, M. Douze, and C. Schmid. Product quantization for nearest neighbor search. IEEE Trans. Pattern Anal. Mach. Intell., 33(1), 2011.
[9]
J. Ji, J. Li, S. Yan, B. Zhang, and Q. Tian. Super-bit locality-sensitive hashing. In NIPS, 2012.
[10]
W. Kong and W.-J. Li. Isotropic hashing. In NIPS, 2012.
[11]
W. Kong, W.-J. Li, and M. Guo. Manhattan hashing for large-scale image retrieval. In SIGIR, 2012.
[12]
B. Kulis and T. Darrell. Learning to hash with binary reconstructive embeddings. In NIPS, 2009.
[13]
B. Kulis and K. Grauman. Kernelized locality-sensitive hashing. IEEE Trans. Pattern Anal. Mach. Intell., 34(6), 2012.
[14]
Y. LeCun, L. Bottou, Y. Bengio, and P. Haffner. Gradient-based learning applied to document recognition. Proceedings of the IEEE, 86(11), 1998.
[15]
X. Li, G. Lin, C. Shen, A. van den Hengel, and A. R. Dick. Learning hash functions using column generation. In ICML, 2013.
[16]
W. Liu, J. Wang, R. Ji, Y.-G. Jiang, and S.-F. Chang. Supervised hashing with kernels. In CVPR, 2012.
[17]
W. Liu, J. Wang, S. Kumar, and S. Chang. Hashing with graphs. In ICML, 2011.
[18]
M. Norouzi and D. J. Fleet. Cartesian k-means. In CVPR, 2013.
[19]
M. Norouzi, A. Punjani, and D. J. Fleet. Fast search in hamming space with multi-index hashing. In CVPR, 2012.
[20]
M. Raginsky and S. Lazebnik. Locality-sensitive binary codes from shift-invariant kernels. In NIPS, 2009.
[21]
G. Shakhnarovich, T. Darrell, and P. Indyk. Nearest-Neighbor Methods in Learning and Vision: Theory and Practice. The MIT press, 2006.
[22]
J. Song, Y. Yang, Z. Huang, H. Shen, and R. Hong. Multiple feature hashing for real-time large scale near-duplicate video retrieval. In ACM Multimedia, 2011.
[23]
C. Strecha, A. Bronstein, M. Bronstein, and P. Fua. Ldahash: Improved matching with smaller descriptors. IEEE Trans. Pattern Anal. Mach. Intell., 34(1), 2012.
[24]
Y. Tao, K. Yi, C. Sheng, and P. Kalnis. Efficient and accurate nearest neighbor and closest pair search in high-dimensional space. ACM Trans. Database Syst., 35(3), 2010.
[25]
J. Wang, S. Kumar, and S. Chang. Sequential projection learning for hashing with compact codes. In ICML, 2010.
[26]
J. Wang, J. Wang, J. Song, X.-S. Xu, H. T. Shen, and S. Li. Optimized cartesian$k\$-means. CoRR, abs/1405.4054, 2014.
[27]
J. Wang, J. Wang, N. Yu, and S. Li. Order preserving hashing for approximate nearest neighbor search. In ACM Multimedia, 2013.
[28]
Y. Weiss, R. Fergus, and A. Torralba. Multidimensional spectral hashing. In ECCV (5), 2012.
[29]
Y. Weiss, A. Torralba, and R. Fergus. Spectral hashing. In NIPS, 2008.
[30]
H. Xu, J. Wang, Z. Li, G. Zeng, S. Li, and N. Yu. Complementary hashing for approximate nearest neighbor search. In ICCV, 2011.
[31]
L. Zhang, Y. Zhang, J. Tang, K. Lu, and Q. Tian. Binary code ranking with weighted hamming distance. In CVPR, 2013.
[32]
T. Zhang, C. Du, and J. Wang. Composite quantization for approximate nearest neighbor search. In ICML (2), 2014.
[33]
X. Zhang, L. Zhang, and H.-Y. Shum. Qsrank: Query-sensitive hash code ranking for efficient ε-neighbor search. In CVPR, 2012.
[34]
X. Zhu, Z. Huang, H. Cheng, J. Cui, and H. T. Shen. Sparse hashing for fast multimedia search. ACM Trans. Inf. Syst., 31(2), 2013.
[35]
X. Zhu, Z. Huang, H. T. Shen, and X. Zhao. Linear cross-modal hashing for efficient multimedia search. In ACM Multimedia, 2013.

Cited By

View all

Index Terms

  1. Optimized Distances for Binary Code Ranking

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    MM '14: Proceedings of the 22nd ACM international conference on Multimedia
    November 2014
    1310 pages
    ISBN:9781450330633
    DOI:10.1145/2647868
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 03 November 2014

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. approximate nearest neighbor search
    2. binary code ranking
    3. lookup table

    Qualifiers

    • Research-article

    Funding Sources

    Conference

    MM '14
    Sponsor:
    MM '14: 2014 ACM Multimedia Conference
    November 3 - 7, 2014
    Florida, Orlando, USA

    Acceptance Rates

    Overall Acceptance Rate 1,291 of 5,076 submissions, 25%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)8
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 15 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2021)Adversarial Multi-Label Variational HashingIEEE Transactions on Image Processing10.1109/TIP.2020.303673530(332-344)Online publication date: 1-Jan-2021
    • (2021)K-mean Index Learning for Multimedia Datasets2021 13th International Conference on Knowledge and Smart Technology (KST)10.1109/KST51265.2021.9415862(6-11)Online publication date: 21-Jan-2021
    • (2019)Effective product quantization-based indexing for nearest neighbor searchMultimedia Tools and Applications10.1007/s11042-018-6059-578:3(2877-2895)Online publication date: 1-Feb-2019
    • (2018)[Invited Paper] A Survey of Product QuantizationITE Transactions on Media Technology and Applications10.3169/mta.6.26:1(2-10)Online publication date: 2018
    • (2018)A Survey on Learning to HashIEEE Transactions on Pattern Analysis and Machine Intelligence10.1109/TPAMI.2017.269996040:4(769-790)Online publication date: 1-Apr-2018
    • (2018)PQTable: Nonexhaustive Fast Search for Product-Quantized Codes Using Hash TablesIEEE Transactions on Multimedia10.1109/TMM.2017.277400920:7(1809-1822)Online publication date: Jul-2018
    • (2018)BlackthornIEEE Transactions on Multimedia10.1109/TMM.2017.275598620:3(687-698)Online publication date: 1-Mar-2018
    • (2018)Revisiting Column-Wise Vector Quantization for Memory-Efficient Matrix Multiplication2018 25th IEEE International Conference on Image Processing (ICIP)10.1109/ICIP.2018.8451557(1158-1162)Online publication date: Oct-2018
    • (2016)Interactive Multimodal Learning on 100 Million ImagesProceedings of the 2016 ACM on International Conference on Multimedia Retrieval10.1145/2911996.2912062(333-337)Online publication date: 6-Jun-2016
    • (2016)Automatic suggestion of presentation image for storytelling2016 IEEE International Conference on Multimedia and Expo (ICME)10.1109/ICME.2016.7552974(1-6)Online publication date: Jul-2016
    • Show More Cited By

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media