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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Anders, J.,Java MPEG page,http://rnvs.informatik.tu-chemnitz.de/_ja/MPEG/MPEG Play.html
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.
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.
DeMenthon, D.F., Vuilleumier Stückelberg, M., and Doermann, D., “Hidden Markov Models for Images”, Int. Conf. on Pattern Recognition, Barcelona, Spain, 2000.
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.
Haralick, R.M., “Statistical and Structural Approaches to Texture”, Proceedings of the IEEE, vol. 67, pp. 786–804, 1979.
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.
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.
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.
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.
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.
Rabiner, L.R., and Juang, B.-H., “Fundamentals of Speech Processing”, Prentice Hall, pp. 321–389, 1993.
Ramer, U., “An Iterative Procedure for the Polygonal Approximation of Plane Curves”, Computer Graphics and Image Processing, vol. 1, pp. 244–256, 1972.
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.
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.
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.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
DeMenthon, D., Jan Latecki, L., Rosenfeld, A., Vuilleumier Stückelberg, M. (2000). Relevance Ranking of Video Data Using Hidden Markov Model Distances and Polygon Simplification. In: Laurini, R. (eds) Advances in Visual Information Systems. VISUAL 2000. Lecture Notes in Computer Science, vol 1929. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40053-2_5
Download citation
DOI: https://doi.org/10.1007/3-540-40053-2_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41177-2
Online ISBN: 978-3-540-40053-0
eBook Packages: Springer Book Archive