Applications of Video-Content Analysis and Retrieval
IEEE MultiMedia
A utility framework for the automatic generation of audio-visual skims
Proceedings of the tenth ACM international conference on Multimedia
Networked multimedia event exploration
Proceedings of the 12th annual ACM international conference on Multimedia
Computational approaches to temporal sampling of video sequences
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
An overview of video shot clustering and summarization techniques for mobile applications
MobiMedia '06 Proceedings of the 2nd international conference on Mobile multimedia communications
Joint video summarization and transmission adaptation for energy-efficient wireless video streaming
EURASIP Journal on Advances in Signal Processing
Hi-index | 0.00 |
In this paper, we present a novel algorithm to generate visual skims, that do not contain audio, from computable scenes. Visual skims are useful for browsing digital libraries, and for on-demand summaries in set-top boxes. A computable scene is a chunk of data that exhibitsconsistencies with respect to chromaticity, lighting and sound. First, we define visual complexity of a shot to be its Kolmogorov complexity. Then, we conduct experiments that help us map the complexity of a shot into the minimum time required for its comprehension. Second, we analyze the grammar of the film language, since it makes the shot sequence meaningful. We achieve a target skim time by minimizing a sequence utility function. It issubject to shot duration constraints, and penalty functions based on sequence rhythm, and information loss. This helps us determine individual shot durations as well as the shots to drop. Our user studies show good results on skims with compression rates up to 80%.