Skip to main content
SpringerLink
Log in

Automatic Extraction of Relevant Frames from Videos by Polygon Simplification

  • Conference paper
Mustererkennung 2000

Part of the book series: Informatik aktuell ((INFORMAT))

Abstract

We present a polygon simplification method that works in multidimensional spaces or even in semi-metric spaces that need not be vector spaces. We require only that a (semi-)distance between pairs of points be defined that need not satisfy the triangle inequality.

In this paper we apply the polygon simplification method to automatically obtain a video summarization and a smart fast-forward function for digital videos. First a video sequence is mapped to a polyline in IR37. By simplifying this polyline, we obtain a summarization (i.e., a small set of the most relevant frames) that is representative of the whole video sequence. The degree of the simplification is either determined automatically or selected by the user.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.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. D.F. DeMenthon, V., M. Kobla, and D. Doermann. Video Summarization by Curve Simplification, ACM Multimedia 98, Bristol, England, pp. 211-218, September 1998.

    Google Scholar 

  2. D.F. DeMenthon, L.J. Latecki, A. Rosenfeld, and M. Vuilleumier Stückelberg. Relevance Ranking and Smart Fast-Forward of Video Data by Polygon Simplification, Int. Conf. on Visual Information Systems, November 2000, to appear.

    Google Scholar 

  3. D.H. Douglas and T.K. Peucker. Algorithms for the Reduction of the Number of Points Required to Represent a Line or its Caricature, The Canadian Cartographer, 10(2), pp. 112–122, 1973.

    Google Scholar 

  4. J. Foote, J. Boreczky, A. Girgensohn, and L. Wilcox. An Intelligent Media Browser using Automatic Multimodal Analysis, ACM Multimedia 98, Bristol, England, pp. 375-380, September 1998.

    Google Scholar 

  5. D. Jacobs, D. Weinshall, and Y. Gdayahu. Condensing Image Databases when Retrieval is based on Non-Metric Distances, Proc. 6th ICCV, 1998.

    Google Scholar 

  6. J. Hershberger and J. Snoeyink. Speeding up the Douglas-Peucker Line-Simplification Algorithm, http://www.cs.ubc.ca/cgi-bin/tr/1992/TR-92-07.

    Google Scholar 

  7. L.J. Latecki and R. Lakämper. Convexity rule for shape decomposition based on discrete contour evolution. Computer Vision and Image Under standing, 73:441–454, 1999.

    Article  Google Scholar 

  8. L.J. Latecki and R. Lakämper. Polygon evolution by vertex deletion. In M. Nielsen, P. Johansen, O.F. Olsen, and J. Weickert, editors, Scale-Space Theories in Computer Vision. Proc. of Int. C. on Scale-Space’99, volume LNCS 1682, Corfu, Greece, 1999.

    Google Scholar 

  9. L.J. Latecki and R. Lakämper. Shape Similarity Measure Based on Correspondence of Visual Parts. IEEE Trans. Pattern Analysis and Machine Intelligence, to appear.

    Google Scholar 

  10. W.H. Press, S.A. Teukolsky, W.T. Vettering, and B.P. Flannery. Numerical Recipes in C, Second Edition, Cambridge University Press, 1992.

    Google Scholar 

  11. U. Ramer. An Iterative Procedure for the Polygonal Approximation of Plane Curves, Computer Graphics and Image Processing 1, pp. 244–256, 1972.

    Article  Google Scholar 

  12. M.A. Smith and T. Kanade. Video Skimming for Quick Browsing Based on Audio and Image Characterization, Proc. of CVPR, 1997.

    Google Scholar 

  13. M.M. Yeung and B.L. Yeo. Time-Constrained Clustering for Segmentation of Video into Story Units, Proc. of ICPR, 1996.

    Google Scholar 

  14. M.M. Yeung, B.-L. Yeo, W. Wolf, and B. Liu. Video Browsing using Clustering and Scene Transitions on Compressed Sequences, Proc. SPIE Conf. on Multimedia Computing and Networking, vol. 2417, pp. 399–413, 1995.

    Google Scholar 

  15. H.J. Zhang, C.Y. Low, S.W. Smoliar, and J.H. Wu. Video Parsing, Retrieval and Browsing: An Integrated and Content-Based Solution, Proc. of ACM Multimedia, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, University of Hamburg, Bundesstr. 55, 20146, Hamburg, Germany

    Longin Jan Latecki

  2. Center for Automation Research, University of Maryland, College Park, MD, 20742, USA

    Daniel DeMenthon & Azriel Rosenfeld

Authors
  1. Longin Jan Latecki
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Daniel DeMenthon
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Azriel Rosenfeld
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik und Praktische Mathematik, Christian-Albrechts Universität Kiel, Preußerstr. 1-9, 24105, Kiel, Deutschland

    Gerald Sommer , Norbert Krüger  & Christian Perwass ,  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Latecki, L.J., DeMenthon, D., Rosenfeld, A. (2000). Automatic Extraction of Relevant Frames from Videos by Polygon Simplification. In: Sommer, G., Krüger, N., Perwass, C. (eds) Mustererkennung 2000. Informatik aktuell. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-59802-9_52

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-59802-9_52

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67886-1

  • Online ISBN: 978-3-642-59802-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation