Skip to main content

Estimating Proximity of Metric Ball Regions for Multimedia Data Indexing

  • Conference paper
  • First Online:
Advances in Information Systems (ADVIS 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1909))

Included in the following conference series:

  • 321 Accesses

Abstract

The problem of defining and computing proximity of regions constraining objects from generic metric spaces is investigated. Approximate, computationally fast, approach is developed for pairs of metric ball regions, which covers the needs of current systems for processing data through distances. The validity and precision of proposed solution is verified by extensive simulation on three substantially different data files. The precision of obtained results is very satisfactory. Besides other possibilities, the proximity measure can be applied to improve the performance of metric trees, developed for multimedia similarity search indexing. Specific system areas concern splitting and merging of regions, pruning regions during similarity retrieval, ranking regions for best case matching, and declustering regions to achieve parallelism.

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

Access this chapter

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bay, S. D. The UCI KDD Archive [http://www.kdd.ics.uci.edu]. Irvine, CA: University of California, Department of Information and Computer Science.

  2. T. Bozkaya and M. Ozsoyoglu. Distance-based indexing for high-dimensional metric spaces. ACM SIGMOD, pp. 357–368, Tucson, AZ, May1997.

    Google Scholar 

  3. T. Bozkaya and Ozsoyoglu. Indexing Large Metric Spaces for Similarity Search Queries. ACM TODS, 24(3):361–404, 1999.

    Article  Google Scholar 

  4. S. Brin. Near neighbor search in large metric spaces. In Proceedings of the 21st VLDB International Conference, pp. 574–584, Zurich, Switzerland, September 1995.

    Google Scholar 

  5. T. Chiueh. Content-based image indexing. In Proceedings of the 20th VLDB International Conference, pages 582–593, Santiago, Chile, September 1994.

    Google Scholar 

  6. P. Ciaccia, M. Patella, and P. Zezula. M-tree: An Efficient Access Method for Similarity Search in Metric Spaces. Proceedings of the 23rd VLDB Conference, Athens, Greece, 1997, pp. 426–435.

    Google Scholar 

  7. P. Ciaccia, M. Patella, and P. Zezula. A Cost Model for Similarity Queries in Metric Spaces. In Proceedings of 7th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, PODS 1998, Seattle, Washington, 1998, pp. 59–68.

    Google Scholar 

  8. M. Stricker and M. Orengo. Similarity of Color Images. In: Storage and Retrieval for Image and Video Databases III, SPIE Proceedings 2420, 1995, pp. 381–392.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Amato, G., Rabitti, F., Savino, P., Zezula, P. (2000). Estimating Proximity of Metric Ball Regions for Multimedia Data Indexing. In: Yakhno, T. (eds) Advances in Information Systems. ADVIS 2000. Lecture Notes in Computer Science, vol 1909. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40888-6_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-40888-6_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41184-0

  • Online ISBN: 978-3-540-40888-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics