Hari Sundaram, Shih-Fu Chang. Condensing Computable Scenes using Visual Complexity and Film Syntax Analysis. In IEEE International Conference on Multimedia and Expo (ICME), Tokyo, Japan, August 2001.
Download paper: Adobe portable document (pdf)
Copyright notice:This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
In this paper, we present a novel algorithm to condense computable scenes. A computable scene is a chunk of data that exhibits consistencies with respect to chromaticity, lighting and sound. We attempt to condense such scenes in two ways. 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. These grammatical rules are used to condense scenes, in parallel to the shot level condensation. We’ve implemented a system that generates a skim given a time budget. Our user studies show good results on skims with compression rates between 60 80%
@InProceedings{dvmmPub88,
Author = {Sundaram, Hari and Chang, Shih-Fu},
Title = {Condensing Computable Scenes using Visual Complexity and Film Syntax Analysis},
BookTitle = {IEEE International Conference on Multimedia and Expo (ICME)},
Address = {Tokyo, Japan},
Month = {August},
Year = {2001}
}
Get EndNote Reference (.ref)
For problems or questions regarding this web site contact The
Web Master.
This document was translated automatically from BibTEX by bib2html (Copyright 2003 © Eric Marchand, INRIA, Vista Project).