Skip to main content

An Approximate Proximity Graph Incremental Construction for Large Image Collections Indexing

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 9384))

Abstract

This paper addresses the problem of the incremental construction of an indexing structure, namely a proximity graph, for large image collections. To this purpose, a local update strategy is examined. Considering an existing graph G and a new node q, how only a relevant sub-graph of G can be updated following the insertion of q? For a given proximity graph, we study the most recent algorithm of the literature and highlight its limitations. Then, a method that leverages an edge-based neighbourhood local update strategy to yield an approximate graph is proposed. Using real-world and synthetic data, the proposed algorithm is tested to assess the accuracy of the approximate graphs. The scalability is verified with large image collections, up to one million images.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    http://www.openmp.org/.

  2. 2.

    http://archive.ics.uci.edu/ml.

  3. 3.

    http://press.liacs.nl/mirflickr.

References

  1. Hacid, H., Yoshida, T.: Incremental neighborhood graphs construction for multidimensional databases indexing. In: Canadian Conference on AI (2007)

    Google Scholar 

  2. Jaromczyk, J.W., Toussaint, G.T.: Relative neighborhood graphs and their relatives. Proc. IEEE 80, 1502–1517 (1992)

    Article  Google Scholar 

  3. Liu, T., Bouali, F., Venturini, G.: EXOD: a tool for building and exploring a large graph of open datasets. Comput. Graph. 39, 117–130 (2014)

    Article  Google Scholar 

  4. Scuturici, M., Scuturici, V.-M., Clech, J., Zighed, D.A.: Navigation dans une base d’images à l’aide de graphes topologiques. In: Inforsid (2004)

    Google Scholar 

  5. Toussaint, G.T.: The relative neighbourhood graph of a finite planar set. Pattern Recogn. 12, 261–268 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  6. Toussaint, G.T.: Some unsolved problems on proximity graphs (1991)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Frédéric Rayar .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Rayar, F., Barrat, S., Bouali, F., Venturini, G. (2015). An Approximate Proximity Graph Incremental Construction for Large Image Collections Indexing. In: Esposito, F., Pivert, O., Hacid, MS., Rás, Z., Ferilli, S. (eds) Foundations of Intelligent Systems. ISMIS 2015. Lecture Notes in Computer Science(), vol 9384. Springer, Cham. https://doi.org/10.1007/978-3-319-25252-0_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-25252-0_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-25251-3

  • Online ISBN: 978-3-319-25252-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics