Skip to main content
Springer Nature Link
Log in

Envelope parameter calculation of similarity indexing structure

  • Posters
  • Conference paper
  • First Online:
Multimedia Information Analysis and Retrieval (MINAR 1998)

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

  • 118 Accesses

Abstract

Similarity Indexing is very important for content-based retrieval on large multimedia databases, and the “tightness” of data set envelope is a factor that influences the performance of index. For equidistant envelope (bounding sphere), calculation of envelope is somewhat difficult because of the complexity of direct computation in high dimension space. In this paper we summarize the envelope used in similarity indexing structures, and discuss the envelope parameter calculation problem. We improved the γ -spatial search algorithm proposed by R. Kuniawati and J.S.Jin for equidistant envelope parameter calculation, and apply it to various distance spaces. Basic thoughts and theorem are provided in the paper, also with algorithm implementation.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Beckmann, N., Kriegel, H.P., Schneider, R., Seeger, B.: The R*-tree: An Efficient and Robust Access Method for Points and Rectangles. Proceedings of the ACM SIGMOD International Conference on the Management of Data, 322–331.

    Google Scholar 

  2. Lin, K.-I., Jagadish, H.V., Faloutsos, C.: The TV-tree: An index structure for high-dimensional data. VLDB Journal,Vol 3, No. 4, (1994)517–549

    Google Scholar 

  3. Berchtold, S., Keim, D.A., Kriegel, H.P.: The X-tree: An index structure for high-dimensional data. Proc. 22th Int. Conf On Very Large Data Bases, Bombay, India(1996).

    Google Scholar 

  4. White D.A., Jain, R.: Similarity indexing with the SS-tree. Proc. 12th IEEE International Conference on Data Engineering. New Orleans, Lousiana (1996)

    Google Scholar 

  5. Friedman, J. H., Bentley, J. H., Finkel, R. A.: An algorithm for finding best matches in logarithmic expexted time, ACM Transactions on Mathematical Softeare, Vol. 3, No. 3, (1977) 209–226

    Google Scholar 

  6. White D.A., Jain, R.: Similarity indexing: Algorithms and performance. Proceedings of the SPIE: Storage and Retrieval for Image and Video Databases IV, Vol. 2670, San Jose, CA. (1996).

    Google Scholar 

  7. Kurniawati, R., Jim, J.S, Shepherd, J.A.: The SS+-tree: An Improved Index Structure for Similarity Searches in a High-Dimensional Feature Space. Private Communication.: School of Computer Science and Engineering, University of New South Wales, Sydney 2052, Australia.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Technology, Nation Laboratory of Intelligent Technology and System, Tsinghua University, 100084, Beijing, PRC

    Bai Xuesheng, Xu Guangyou & Shi Yuanchun

Authors
  1. Bai Xuesheng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xu Guangyou
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shi Yuanchun
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Horace H. S. Ip Arnold W. M. Smeulders

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Xuesheng, B., Guangyou, X., Yuanchun, S. (1998). Envelope parameter calculation of similarity indexing structure. In: Ip, H.H.S., Smeulders, A.W.M. (eds) Multimedia Information Analysis and Retrieval. MINAR 1998. Lecture Notes in Computer Science, vol 1464. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0016502

Download citation

  • DOI: https://doi.org/10.1007/BFb0016502

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-68537-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics