[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content

An Efficient High-Dimensional Index Structure Using Cell Signatures for Similarity Search

  • Conference paper
  • First Online:
Advances in Web-Age Information Management (WAIM 2001)

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

Included in the following conference series:

  • 337 Accesses

Abstract

In this paper, we propose an efficient high-dimensional index structure using cell signatures for similarity search in multimedia database applications. Our index structure partitions a high-dimensional feature space into a group of cells and represents a feature vector as its corresponding cell signature. By using cell signatures rather than real feature vectors, it is possible to reduce the height of our high-dimensional index structure, leading to efficient retrieval performance. In addition, we present a similarity search metric for efficiently pruning search spaces based on cell signatures. Finally, we compare the performance of our index structure with that of its competitor like the X-tree. It is shown from experimental results that our index structure is better on retrieval performance than the X-tree.

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

Access this chapter

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
GBP 19.95
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
GBP 35.99
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
GBP 44.99
Price includes VAT (United Kingdom)
  • 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.

Similar content being viewed by others

References

  1. C. Faloutsos, W. Equitz, M. Flickner, W. Niblack, D. Petkovic, and R. Barber, “Effecient and effective querying by image content”, J. of Intell. Inf. Sys., 3(3/4):231–262, July 1994.

    Google Scholar 

  2. White. D.A and Jain. R, “Similarity Indexing with the SS-tree”, In Proc. 12th Intl. Conf. On Data Engineering, New Orleans, pp. 516–523, 1996.

    Google Scholar 

  3. Katayama N., Satoh S., “The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries”, Proc. ACM SIGMOD Int. Conf. on Management of Data, pp. 369–380, 1997.

    Google Scholar 

  4. K.I. Lin, H. Jagadish, C. Faloutsos, The TV-tree: An Index Structure for High Dimensional Data,’ VLDB Journal, Vol. 3, pp. 517–542, 1994.

    Article  Google Scholar 

  5. Berchtold S., Keim D., Kriegel H.-P., The X-tree: An Index Structure for High-Dimensional Data’, 22nd Conf. on Very Large Databases, 1996, Bombay, India.

    Google Scholar 

  6. V. Pestov, “On the geometry of similarity search: Dimensionality curse and concentration of measure”, Technical Report RP-99-01, School of Mathematical and Computing Sciences, Victoria University of Wellington, New Zealand, January 1999.

    Google Scholar 

  7. Arya, S. et al.,’ An Optimal Algorithm for Approximate Nearest Neighbor Searching’, In Proc. ACM-SIAM Symposium on Discrete Algorithms, pp. 573–582, 1994.

    Google Scholar 

  8. Roussopoulos N., Kelley S., Vincent F.,’ Nearest Neighbor Queries’, Proc. ACM SIGMOD Int. Conf. on Management of Data, 1995, pp. 71–79.

    Google Scholar 

  9. S. Berchtold, C. Bohm, D. Keim, and H.-P. Kriegel,’ A Cost Model for Nearest Neighbor Search in High-Dimensional Data Space’, In Proceesings of ACM PODS Symposium on Principles of Database System, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chang, JW., Song, KT. (2001). An Efficient High-Dimensional Index Structure Using Cell Signatures for Similarity Search. In: Wang, X.S., Yu, G., Lu, H. (eds) Advances in Web-Age Information Management. WAIM 2001. Lecture Notes in Computer Science, vol 2118. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47714-4_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-47714-4_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42298-3

  • Online ISBN: 978-3-540-47714-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics