ACM Home Page
Please provide us with feedback. Feedback
Rushes summarization using different redundancy elimination approaches
Full text PdfPdf (409 KB)
Source
International Multimedia Conference archive
Proceedings of the 2nd ACM TRECVid Video Summarization Workshop table of contents
Vancouver, British Columbia, Canada
Pages 100-104  
Year of Publication: 2008
ISBN:978-1-60558-309-9
Authors
Narongsak Putpuek  National Institute of Informatics, Tokyo, Japan and Chulalongkorn University, Bangkok, Thailand
Duy-Dinh Le  National Institute of Informatics, Tokyo, Japan
Nagul Cooharojananone  National Institute of Informatics, Tokyo, Japan and Chulalongkorn University, Bangkok, Thailand
Shin'ichi Satoh  National Institute of Informatics, Tokyo, Japan
Chidchanok Lursinsap  Chulalongkorn University, Bangkok, Thailand
Sponsors
SIGMULTIMEDIA: ACM Special Interest Group on Multimedia
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 53,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1463563.1463581
What is a DOI?

ABSTRACT

Generating short summary videos for rushes is a challenging task due to the difficulty in eliminating redundancy and determining the important objects and events to be placed in the summary. Redundancy elimination is difficult since repetitive segments, which are takes of the same scene, usually have different lengths and motion patterns. This makes approaches using one keyframe for a shot representation fail when doing clustering. In addition, even repetitive segments can be precisely determined, but the summary generated by concatenating together the selected segments still takes longer than the upper limit. Selecting a sub-segment that conveys as much of the information concerning a given scene as possible might be a good way to improve this process. We introduce two approaches to solve these problems. In the first approach, one keyframe is used for representing a shot when doing clustering; and sub-segments are selected using the motion information for generating the summary. Meanwhile, in the second approach, all the frames of a given shot are used for clustering; and a simple skimming method is used to select the sub-segments. The experimental results on the TRECVID 2008 dataset and a comparison between the two approaches are also reported.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
C. Gianluigi and S. Raimondo. An innovative algorithm for keyframe extraction in video summarization. Journal of Real-Time Image Processing, 1(1):69--88, 2006.
 
2
M. E. Houle. The relevant-set correlation model for data clustering. In Proc. Siam Conf. on Data Mining, pages 775--786, 2008.
3
 
4
5
6
7


Collaborative Colleagues:
Narongsak Putpuek: colleagues
Duy-Dinh Le: colleagues
Nagul Cooharojananone: colleagues
Shin'ichi Satoh: colleagues
Chidchanok Lursinsap: colleagues