Skip to main content

An Efficient Incremental Nearest Neighbor Algorithm for Processing k-Nearest Neighbor Queries with Visal and Semantic Predicates in Multimedia Information Retrieval System

  • Conference paper
Information Retrieval Technology (AIRS 2005)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 3689))

Included in the following conference series:

Abstract

Recently, advanced multimedia applications, such as geographic information system, and content-based image/video retrieval system, require the efficient processing of k-nearest neighbor queries with semantic predicates as well as visual predicates. In this paper, we propose an integrated index structure, so-called SPY-TEC+, that provides an efficient method for indexing visual and semantic feature information at the same time using the SPY-TEC and the signature file. We also propose an efficient incremental nearest neighbor algorithm for processing the k-nearest neighbor queries with visual and semantic predicates on the SPY-TEC+.

This work was supported by the research fund of Hanyang University(HY-2004).

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Fagin, R.: Fuzzy Queries in Multimedia Database Systems. In: Proc. 16th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (1998)

    Google Scholar 

  2. Park, D.-J., Kim, H.-J.: An Enhanced Technique for k-Nearest Neighbor Queries with Non-spatial Selection Predicates. Multimedia Tools and Applications 19, 79–103 (2003)

    Article  Google Scholar 

  3. Hjaltason, G.R., Samet, H.: Distance Browsing in Spatial Databases. ACM Transaction on Database Systems 24, 265–318 (1999)

    Article  Google Scholar 

  4. Guttman, A.: R-trees: A Dynamic Index Structure for Spatial Searching. In: Proc. ACM SIGMOD Int. Conf. on Management of Data, pp. 47–57 (1984)

    Google Scholar 

  5. Lee, D.-H., Kim, H.-J.: An Efficient Technique for Nearest-Neighbor Query Processing on the SPY-TEC. IEEE Transactions on Knowledge and Data Engineering 15, 1472–1486 (2003)

    Article  Google Scholar 

  6. Deppisch, U.: S-Tree: A Dynamic Balanced Signature Index for Office Retrieval. In: Proc. of the ACM Conf. on Research and Development in Information Retrieval, pp. 77–87 (1986)

    Google Scholar 

  7. Faloutsos, C., Christodoulakis, S.: Optimal Signature Extraction and Information Loss. ACM Transaction on Database Systems 12 (1987)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lee, DH., Park, DJ. (2005). An Efficient Incremental Nearest Neighbor Algorithm for Processing k-Nearest Neighbor Queries with Visal and Semantic Predicates in Multimedia Information Retrieval System. In: Lee, G.G., Yamada, A., Meng, H., Myaeng, S.H. (eds) Information Retrieval Technology. AIRS 2005. Lecture Notes in Computer Science, vol 3689. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11562382_63

Download citation

  • DOI: https://doi.org/10.1007/11562382_63

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29186-2

  • Online ISBN: 978-3-540-32001-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics