skip to main content
10.1145/2072298.2071971acmconferencesArticle/Chapter ViewAbstractPublication PagesmmConference Proceedingsconference-collections
short-paper

Efficient approximate nearest neighbor search with integrated binary codes

Published: 28 November 2011 Publication History

Abstract

Nearest neighbor search in Euclidean space is a fundamental problem in multimedia retrieval. The difficulty of exact nearest neighbor search has led to approximate solutions that sacrifice precision for efficiency. Among such solutions, approaches that embed data into binary codes in Hamming space have gained significant success for their efficiency and practical memory requirements. However, binary code searching only finds a big and coarse set of similar neighbors in Hamming space, and hence expensive Euclidean distance based ranking of the coarse set is needed to find nearest neighbors. Therefore, to improve nearest neighbor search efficiency, we proposed a novel binary code method called Integrated Binary Code (IBC) to get a compact set of similar neighbors. Experiments on public datasets show that our method is more efficient and effective than state-of-the-art in approximate nearest neighbor search.

References

[1]
Arya, S., Mount, D. M., et al. 1998. An optimal algorithm for approximate nearest neighbor searching fixed dimensions. J. ACM, 45 (6): 891--923.
[2]
Datar, M., Immorlica, N., Indyk, P.,et al.2004.Locality-sensitive hashing scheme based on p-stable distributions. SCG '2004, 253--262.
[3]
Min, K., Yang, L., et al. 2010. Compact Projection: Simple and Efficient Near Neighbor Search with Practical Memory Requirements. CVPR'2010.
[4]
Jegou, H., Douze, M. and Schmid, C. 2008.Hamming embedding and weak geometric consistency for large scale image search. ECCV'2008, 304--317.
[5]
Weiss, Y., Torralba, A., et al. 2008. Spectral Hashing. Advances in Neural Information Processing Systems.
[6]
Brandt, J. 2010.Transform Coding for Fast Approximate Nearest Neighbor Search in High Dimensions. CVPR'2010.
[7]
Jegou H., Douze M., et al. 2011.Product Quantization for Nearest Neighbor Search. PAMI, 33(1), 117--128.
[8]
Torralba, A., Fergus, R. and Weiss, Y. 2008.Small codes and large image databases for recognition. CVPR'2008.
[9]
Lowe, D. 2004.Distinctive image features from scale-invariant keypoints. IJCV, 60 (2): 91--110.
[10]
Oliva, A., Torralba, A. 2001.Modeling the shape of the scene: a holistic representation of the spatial envelope. IJCV, 42(3): 145--175.
[11]
Zhang, W., Gao, K., Zhang, Y.D. and Li J.T. 2010.Data-Oriented Locality Sensitive Hashing. ACM MM'2010.
[12]
Wang, X.J., Zhang, L., Jing, F., Ma W.Y.2006. AnnoSearch: Image Auto-Annotation by Search. CVPR'2006, 1483--1490.

Cited By

View all
  • (2020)Monotonic Cardinality Estimation of Similarity Selection: A Deep Learning ApproachProceedings of the 2020 ACM SIGMOD International Conference on Management of Data10.1145/3318464.3380570(1197-1212)Online publication date: 11-Jun-2020
  • (2019)Generalizing the Pigeonhole Principle for Similarity Search in Hamming SpaceIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2019.2899597(1-1)Online publication date: 2019
  • (2018)PigeonringProceedings of the VLDB Endowment10.14778/3275536.327553912:1(28-42)Online publication date: 1-Sep-2018
  • Show More Cited By

Index Terms

  1. Efficient approximate nearest neighbor search with integrated binary codes

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM Conferences
      MM '11: Proceedings of the 19th ACM international conference on Multimedia
      November 2011
      944 pages
      ISBN:9781450306164
      DOI:10.1145/2072298
      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: 28 November 2011

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. approximate nearest neighbor search
      2. similarity search

      Qualifiers

      • Short-paper

      Conference

      MM '11
      Sponsor:
      MM '11: ACM Multimedia Conference
      November 28 - December 1, 2011
      Arizona, Scottsdale, USA

      Acceptance Rates

      Overall Acceptance Rate 2,145 of 8,556 submissions, 25%

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)2
      • Downloads (Last 6 weeks)0
      Reflects downloads up to 25 Dec 2024

      Other Metrics

      Citations

      Cited By

      View all
      • (2020)Monotonic Cardinality Estimation of Similarity Selection: A Deep Learning ApproachProceedings of the 2020 ACM SIGMOD International Conference on Management of Data10.1145/3318464.3380570(1197-1212)Online publication date: 11-Jun-2020
      • (2019)Generalizing the Pigeonhole Principle for Similarity Search in Hamming SpaceIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2019.2899597(1-1)Online publication date: 2019
      • (2018)PigeonringProceedings of the VLDB Endowment10.14778/3275536.327553912:1(28-42)Online publication date: 1-Sep-2018
      • (2018)GPH: Similarity Search in Hamming Space2018 IEEE 34th International Conference on Data Engineering (ICDE)10.1109/ICDE.2018.00013(29-40)Online publication date: Apr-2018
      • (2017)Triple-Bit Quantization with Asymmetric Distance for Image Content SecurityMachine Vision and Applications10.1007/s00138-017-0853-328:7(771-779)Online publication date: 1-Oct-2017
      • (2015)On-Device Mobile Landmark Recognition Using Binarized Descriptor with Multifeature FusionACM Transactions on Intelligent Systems and Technology10.1145/27952347:1(1-29)Online publication date: 7-Oct-2015
      • (2015)Data-oriented multi-index hashing2015 IEEE International Conference on Multimedia and Expo (ICME)10.1109/ICME.2015.7177420(1-6)Online publication date: Jun-2015
      • (2015)Fast approximate matching of binary codes with distinctive bitsFrontiers of Computer Science: Selected Publications from Chinese Universities10.1007/s11704-015-4192-09:5(741-750)Online publication date: 1-Oct-2015
      • (2014)Efficient binary code indexing with pivot based locality sensitive clusteringMultimedia Tools and Applications10.1007/s11042-012-1354-z69:2(491-512)Online publication date: 1-Mar-2014
      • (2014)Fast Search of Binary Codes with Distinctive BitsProceedings of the 15th Pacific-Rim Conference on Advances in Multimedia Information Processing --- PCM 2014 - Volume 887910.1007/978-3-319-13168-9_31(274-283)Online publication date: 1-Dec-2014
      • 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

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media