Summarizing video sequence using a graph-based hierarchical approach

详细信息    查看全文

• 作者：Luciana dos Santos Belo ^{lucyannasbelo@gmail.com" class="auth_mail" title="E-mail the corresponding author}Author Vitae ; Carlos Antô ; nio Caetano Jr. ^{carlos.a.caetano.jr@gmail.com" class="auth_mail" title="E-mail the corresponding author}Author Vitae ; Zenilton Kleber Gonç ; alves do Patrocí ; nio Jr. ^{zenilton@pucminas.br" class="auth_mail" title="E-mail the corresponding author}Author Vitae ; Silvio Jamil Ferzoli Guimarã ; es ; ^{sjamil@pucminas.br" class="auth_mail" title="E-mail the corresponding author}Author Vitae
• 关键词：Graph-based hierarchical video summarization ; Covering ; Global descriptors ; Observation scales
• 刊名：Neurocomputing
• 出版年：2016
• 出版时间：15 January 2016
• 年：2016
• 卷：173
• 期：part_P3
• 页码：1001-1016
• 全文大小：2130 K

文摘

Video summarization is a simplification of video content for compacting the video information. The video summarization problem can be transformed into a clustering problem, in which some frames are selected to saliently represent the video content. In this work, we use a graph-based hierarchical clustering method for computing a video summary. In fact, the proposed approach, called HSUMM, adopts a hierarchical clustering method to generate a weight map from the frame similarity graph in which the clusters (or connected components of the graph) can easily be inferred. Moreover, the use of this strategy allows the application of a similarity measure between clusters during graph partition, instead of considering only the similarity between isolated frames. We also provide a unified framework for video summarization based on minimum spanning tree and weight maps in which HSUMM could be seen as an instance that uses a minimum spanning tree of frames and a weight map based on hierarchical observation scales computed over that tree. Furthermore, a new evaluation measure that assesses the diversity of opinions among users when they produce a summary for the same video, called Covering, is also proposed. During tests, different strategies for the identification of summary size and for the selection of keyframes were analyzed. Experimental results provide quantitative and qualitative comparison between the new approach and other popular algorithms from the literature, showing that the new algorithm is robust. Concerning quality measures, HSUMM outperforms the compared methods regardless of the visual feature used in terms of F-measure.