skip to main content
10.1145/2502081.2502152acmconferencesArticle/Chapter ViewAbstractPublication PagesmmConference Proceedingsconference-collections
poster

Sim-min-hash: an efficient matching technique for linking large image collections

Published:21 October 2013Publication History

ABSTRACT

One of the most successful method to link all similar images within a large collection is min-Hash, which is a way to significantly speed-up the comparison of images when the underlying image representation is bag-of-words. However, the quantization step of min-Hash introduces important information loss. In this paper, we propose a generalization of min-Hash, called Sim-min-Hash, to compare sets of real-valued vectors. We demonstrate the effectiveness of our approach when combined with the Hamming embedding similarity. Experiments on large-scale popular benchmarks demonstrate that Sim-min-Hash is more accurate and faster than min-Hash for similar image search. Linking a collection of one million images described by 2 billion local descriptors is done in 7 minutes on a single core machine.

References

  1. R. Arandjelovic and A. Zisserman. Three things everyone should know to improve object retrieval. In CVPR, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. A. Z. Broder. On the resemblance and containment of documents. In Proc. Compression and Complexity of Sequences, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. O. Chum and J. Matas. Large-scale discovery of spatially related images. PAMI, Feb. 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. O. Chum, J. Philbin, M. Isard, and A. Zisserman. Scalable near identical image and shot detection. In CIVR, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. O. Chum, J. Philbin, and A. Zisserman. Near duplicate image detection: min-hash and tf-idf weighting. In BMVC, 2008.Google ScholarGoogle ScholarCross RefCross Ref
  6. K. Heath, N. Gelfand, M. Ovsjanikov, M. Aanjaneya, and L. J. Guibas. Image webs: Computing and exploiting connectivity in image collections. In CVPR, 2010.Google ScholarGoogle ScholarCross RefCross Ref
  7. H. Jegou, M. Douze, C. Schmid. Improving bag-of-features for large scale image search. IJCV, May 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. H. Jegou, C. Schmid, H. Harzallah, and J. Verbeek. Accurate image search using the contextual dissimilarity measure. PAMI, Jan. 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. D. Nister and H. Stewenius. Scalable recognition with a vocabulary tree. In CVPR, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. L. Pang, W. Zhang, H.-K. Tan, and C.-W. Ngo. Video hyperlinking: libraries and tools for threading and visualizing large video collection. In ACMMM, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. J. Philbin, O. Chum, M. Isard, J. Sivic, and A. Zisserman. Object retrieval with large vocabularies and fast spatial matching. In CVPR, 2007.Google ScholarGoogle ScholarCross RefCross Ref
  12. D. Qin, S. Gammeter, L. Bossard, T. Quack, and L. van Gool. Hello neighbor: Accurate object retrieval with k-reciprocal nearest neighbors. In CVPR, 201Google ScholarGoogle Scholar
  13. J. Sivic and A. Zisserman. Video Google: A text retrieval approach to object matching in videos. In ICCV, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. W. Voravuthikunchai, B. Cremilleux, and F. Jurie. Findging groups of duplicate images in very large datasets. In BMVC, 2012.Google ScholarGoogle Scholar
  15. B. Wang, Z. Li, M. Li, and W.-Y. Ma. Large-scale duplicate detection for web image search. In ICME, 2006.Google ScholarGoogle ScholarCross RefCross Ref
  16. X.-J. Wang, L. Zhang, M. Liu, and W.-Y. Ma. ARISTA: image search to annotation on billions of web photos. In CVPR, 2010.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Sim-min-hash: an efficient matching technique for linking large image collections

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        MM '13: Proceedings of the 21st ACM international conference on Multimedia
        October 2013
        1166 pages
        ISBN:9781450324045
        DOI:10.1145/2502081

        Copyright © 2013 ACM

        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 the author(s) 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].

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 21 October 2013

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • poster

        Acceptance Rates

        MM '13 Paper Acceptance Rate47of235submissions,20%Overall Acceptance Rate995of4,171submissions,24%

        Upcoming Conference

        MM '24
        MM '24: The 32nd ACM International Conference on Multimedia
        October 28 - November 1, 2024
        Melbourne , VIC , Australia

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader