Advertisement

Relevance Ranking of Video Data Using Hidden Markov Model Distances and Polygon Simplification

  • Daniel DeMenthon
  • Longin Jan Latecki
  • Azriel Rosenfeld
  • Marc Vuilleumier Stückelberg
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1929)

Abstract

A video can be mapped into a multidimensional signal in a non-Euclidean space, in a way that translates the more predictable passages of the video into linear sections of the signal. These linear sections can befiltered out by techniques similar to those used for simplifying planar curves. Different degrees of simplification can be selected. We have refined such a technique so that it can make use of probabilistic distances between statistical image models of the video frames. These models are obtained by applying hidden Markov model techniques to random walks across the images. Using our techniques, a viewer can browse a video at the level of summarization that suits his patience level. Applications include the creation of a smart fast-forward function for digital VCRs, and the automatic creation of short summaries that can be used as previews before videos are downloaded from the web.

Keywords

Hide Markov Model Video Data Video Summarization Video Player Image Stream 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
  2. 2.
    Coulibaly, I.,and Lécot, C.,“Simulation of Diffusion Using Quasi-Random Walk Methods”,Mathematics and Computers in Simulation, vol.47, pp. 154–163, 1998.CrossRefGoogle Scholar
  3. 3.
    DeMenthon, D.F., Kobla, V., M., and Doermann, D., “Video Summarization by Curve Simplification”, Technical Report LAMP-TR-018, CAR-TR-889, July 1998; also ACM Multimedia 98, Bristol, England, pp. 211–218, 1998.Google Scholar
  4. 4.
    DeMenthon, D.F., Vuilleumier Stückelberg, M., and Doermann, D., “Hidden Markov Models for Images”, Int. Conf. on Pattern Recognition, Barcelona, Spain, 2000.Google Scholar
  5. 5.
    Foote, J., Boreczky, J., Girgensohn, A., and Wilcox, L. (1998), “An Intelligent Media Browser using Automatic Multimodal Analysis”, ACM Multimedia 98, Bristol,England, pp. 375–380, 1998.Google Scholar
  6. 6.
    Haralick, R.M., “Statistical and Structural Approaches to Texture”, Proceedings of the IEEE, vol. 67, pp. 786–804, 1979.CrossRefGoogle Scholar
  7. 7.
    Hershberger, J., and Snoeyink, J. “Speeding up the Douglas-Peucker Line-Simplification Algorithm”, http://www.cs.ubc.ca/cgi-bin/tr/1992/TR-92-07.
  8. 8.
    Huang, J., Kumar, S.R., Mitra, M., Zhu, W-J., and Zabih, R., “Image Indexing Using Color Correlograms”, IEEE Conf. on Computer Vision and Pattern Recognition, pp. 762–768, 1997.Google Scholar
  9. 9.
    Latecki, L.J., and LakÄmper, R., “Convexity Rule for Shape Decomposition based on Discrete Contour Evolution”, Computer Vision and Image Understanding, vol. 73, pp. 441–454, 1999.CrossRefGoogle Scholar
  10. 10.
    Latecki, L.J., and LakÄmper, R., “Polygon Evolution by Vertex Deletion”, in M. Nielsen, P. Johansen, O.F. Olsen, and J. Weickert, editors, Scale-Space Theories in Computer Vision (Int. Conf. on Scale-Space), LNCS 1682, Springer, 1999.CrossRefGoogle Scholar
  11. 11.
    Latecki, L.J. and LakÄmper, R., “Shape Similarity Measure Based on Correspondence of Visual Parts”, IEEE Trans. on Pattern Analysis and Machine Intelligence,to appear.Google Scholar
  12. 12.
    Rabiner, L.R., and Juang, B.-H., “Fundamentals of Speech Processing”, Prentice Hall, pp. 321–389, 1993.Google Scholar
  13. 13.
    Ramer, U., “An Iterative Procedure for the Polygonal Approximation of Plane Curves”, Computer Graphics and Image Processing, vol. 1, pp. 244–256, 1972.CrossRefGoogle Scholar
  14. 14.
    Smith, M.A., and Kanade, T., “Video Skimming for Quick Browsing Based on Audio and Image Characterization”, IEEE Conf. on Computer Vision and Pattern Recognition, 1997.Google Scholar
  15. 15.
    Yeung, M.M., Yeo, B-L., Wolf, W. and Liu, B.,“Video Browsing using Clustering and Scene Transitions on Compressed Sequences”, SPIE Conf. on MultimediaComputing and Networking, vol. 2417, pp. 399–413, 1995.Google Scholar
  16. 16.
    Yoon, K., DeMenthon, D.F., and Doermann, D., “Event Detection from MPEG Video in the Compressed Domain”, Int. Conf. on Pattern Recognition, Barcelona, Spain, 2000.Google Scholar
  17. 17.
    Zhang, H.J., Low, C.Y., Smoliar, S.W., and Wu, J.H., “Video Parsing, Retrieval and Browsing: An Integrated and Content-Based Solution”, ACM Multimedia, 1995.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Daniel DeMenthon
    • 1
  • Longin Jan Latecki
    • 2
  • Azriel Rosenfeld
    • 1
  • Marc Vuilleumier Stückelberg
    • 3
  1. 1.Center for Automation ResearchUniversity of MarylandUSA
  2. 2.Department of Applied MathematicsUniversity of HamburgHamburgGermany
  3. 3.Computer Science DepartmentCUI, University of GenevaGeneva 4

Personalised recommendations