Loading...
Please wait, while we are loading the content...
Similar Documents
Constrained Utility Maximization for Generating Visual Skims (2001)
| Content Provider | CiteSeerX |
|---|---|
| Author | Sundaram, Hari Chang, Shih-Fu |
| Description | 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 exhibits consistencies 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 is subject 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%. IEEE Workshop on Content-Based Access of Image & Video Library |
| File Format | |
| Language | English |
| Publisher Date | 2001-01-01 |
| Access Restriction | Open |
| Subject Keyword | Good Result Target Skim Time On-demand Summary Novel Algorithm Shot Sequence Meaningful Visual Complexity Visual Skim User Study Utility Maximization Penalty Function Film Language Digital Library Kolmogorov Complexity Compression Rate Computable Scene Sequence Utility Function Individual Shot Duration Set-top Box Information Loss Sequence Rhythm Shot Duration Constraint Minimum Time |
| Content Type | Text |
| Resource Type | Article |
