ACM Home Page
Please provide us with feedback. Feedback
Video rushes summarization using spectral clustering and sequence alignment
Full text PdfPdf (652 KB)
Source
International Multimedia Conference archive
Proceedings of the 2nd ACM TRECVid Video Summarization Workshop table of contents
Vancouver, British Columbia, Canada
Pages 75-79  
Year of Publication: 2008
ISBN:978-1-60558-309-9
Authors
Vasileios Chasanis  University of Ioannina, Ioannina, Greece
Aristidis Likas  University of Ioannina, Ioannina, Greece
Nikolaos Galatsanos  University of Ioannina, Ioannina, Greece
Sponsors
SIGMULTIMEDIA: ACM Special Interest Group on Multimedia
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 10,   Downloads (12 Months): 63,   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.1463576
What is a DOI?

ABSTRACT

In this paper we describe a system for video rushes summarization. The basic problems of rushes videos are three. First, the presence of useless frames such as colorbars, monochrome frames and frames containing clapboards. Second, the repetition of similar segments produced from multiple takes of the same scene and finally, the efficient representation of the original video in the video summary. In the method we proposed herein, the input video is segmented into shots. Then, colorbars and monochrome frames are removed by checking their edge direction histogram, whereas frames containing clapboards are removed by checking their SIFT descriptors. Next, an enhanced spectral clustering algorithm that both estimates the number of clusters and employs the fast global k-means algorithm in the clustering stage after the eigenvector computation of the similarity matrix is used to extract the key-frames of each shot, to efficiently represent shot content. Similar shots are clustered in one group by comparing their key-frames using a sequence alignment algorithm. Each group is represented from the shot with the largest duration and the final video summary is generated by concatenating frames around the key-frames of each shot. Experiments on TRECVID 2008 Test Data indicate that our method exhibits good performance.


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
A. Likas, N. Vlassis, and J. Verbeek. The global k-means clustering algorithm. Pattern Recognition, 36(6):451--461, Feb 2003.
 
2
 
3
B. Manjunath, J.-R. Ohm, V. Vasudevan, and A. Yamada. Color and texture descriptors. IEEE Transactions on Circuits and Systems for Video Technology, 11(6):703--715, Jun 2001.
 
4
A. Ng, M. Jordan, and Y. Weiss. On spectral clustering: Analysis and an algorithm, 2001.
5
 
6
T. F. Smith and M. S. Waterman. Identification of common molecular subsequences. Journal of Molecular Biology, 147:195--197, 1981.
 
7
E. P. Xing and M. I. Jordan. On semide definite relaxation for normalized k-cut and connections to spectral clustering. Technical Report UCB/CSD--03--1265, EECS Department, University of California, Berkeley, Jun 2003.


Collaborative Colleagues:
Vasileios Chasanis: colleagues
Aristidis Likas: colleagues
Nikolaos Galatsanos: colleagues