Skip to main content

Accelerating Multimedia Search by Visual Features

  • Conference paper
  • 472 Accesses

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

Abstract

Visual features used for search of visual material usually have computationally complex similarity functions. Therefore for large databases to get real time response for queries by examples is necessary avoiding their full search. In this paper we show efficiency of selected techniques for accelerating visual object retrieval. They belong to three independent groups: filtering, partial similarity computing, and tree based data structures. We show on description examples of motion trajectory, face recognition, and distributed color image temperature that different types of visual features require different accelerating techniques.

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Information technology – Multimedia content description interface – Parts 1-8, ISO/IEC FDIS 15938-[1-8]:2002 (E) (2002)

    Google Scholar 

  2. Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The R*-tree: An efficient and robust access method for points and rectangles. In: Proc. ACM SIGMOD Int. Conf. Management of data (1990)

    Google Scholar 

  3. Berchtold, S., Keim, D.A., Kriegel, H.-P.: The X-tree: An Index Structure for High- Dimensional Data. In: Proceedings of the 22nd VLDB Conference, Bombay (1996)

    Google Scholar 

  4. Cha, G.-H., Zhu, X., Petkovic, D., Chung, C.-W.: An Efficient Indexing Method for Nearest Neighbour Searches in High-Dimensional Image Databases. IEEE Trans. on Multimedia 4(1) (2002)

    Google Scholar 

  5. Ciaccia, P., Patella, M., Zezula, P.: M-tree: An Efficient Access Method for Similarity Search in Metric Spaces. In: Proceedings of the 23rd VLDB Conference, Athens (1997)

    Google Scholar 

  6. Gaede, V., Gunter, O.: Multidimensional Access Methods. ACM Computing Surveys 30(2) (1998)

    Google Scholar 

  7. The M-tree Project, http://www-db.deis.unibo.it/Mtree/

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Galinski, G., Wnukowicz, K., Skarbek, W. (2004). Accelerating Multimedia Search by Visual Features. In: Campilho, A., Kamel, M. (eds) Image Analysis and Recognition. ICIAR 2004. Lecture Notes in Computer Science, vol 3211. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30125-7_90

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30125-7_90

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-30125-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics