Share Email Print
cover

Proceedings Paper

Hierarchical video summarization
Author(s): Krishna Ratakonda; M. Ibrahim Sezan; Regis J. Crinon
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

We address the problem of key-frame summarization of vide in the absence of any a priori information about its content. This is a common problem that is encountered in home videos. We propose a hierarchical key-frame summarization algorithm where a coarse-to-fine key-frame summary is generated. A hierarchical key-frame summary facilitates multi-level browsing where the user can quickly discover the content of the video by accessing its coarsest but most compact summary and then view a desired segment of the video with increasingly more detail. At the finest level, the summary is generated on the basis of color features of video frames, using an extension of a recently proposed key-frame extraction algorithm. The finest level key-frames are recursively clustered using a novel pairwise K-means clustering approach with temporal consecutiveness constraint. We also address summarization of MPEG-2 compressed video without fully decoding the bitstream. We also propose efficient mechanisms that facilitate decoding the video when the hierarchical summary is utilized in browsing and playback of video segments starting at selected key-frames.

Paper Details

Date Published: 28 December 1998
PDF: 11 pages
Proc. SPIE 3653, Visual Communications and Image Processing '99, (28 December 1998); doi: 10.1117/12.334663
Show Author Affiliations
Krishna Ratakonda, Univ. of Illinois/Urbana-Champaign (United States)
M. Ibrahim Sezan, Sharp Labs. of America (United States)
Regis J. Crinon, Sharp Labs. of America (United States)


Published in SPIE Proceedings Vol. 3653:
Visual Communications and Image Processing '99
Kiyoharu Aizawa; Robert L. Stevenson; Ya-Qin Zhang, Editor(s)

© SPIE. Terms of Use
Back to Top