Generation of scalable summaries based on iterative GoP ranking

Video skims and image storyboards are two widely used abstractions for representing the essence of a video sequence, crucial for effective browsing and retrieval applications. In this paper we propose a flexible approach to find a reasonable balance between the semantic coverage and naturalness of the generated summaries, targeting a wide range of summarization ratios. The result of the algorithm is a scalable representation of the information required for summarization (a ranked list of GoPs) with a number of advantages in terms of efficient generation and potential applications.

[1]  Janko Calic,et al.  Efficient Layout of Comic-Like Video Summaries , 2007, IEEE Transactions on Circuits and Systems for Video Technology.

[2]  Ba Tu Truong,et al.  Video abstraction: A systematic review and classification , 2007, TOMCCAP.

[3]  Francesco Masulli,et al.  A survey of kernel and spectral methods for clustering , 2008, Pattern Recognit..

[4]  Wesley De Neve,et al.  Temporal Video Segmentation on H.264/AVC Compressed Bitstreams , 2007, MMM.