ACM Computing Surveys (CSUR)
Algorithm Design
Keyframe-based video summarization using Delaunay clustering
International Journal on Digital Libraries
VISTO: visual storyboard for web video browsing
Proceedings of the 6th ACM international conference on Image and video retrieval
Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
IEEE Transactions on Computers
VSUMM: An Approach for Automatic Video Summarization and Quantitative Evaluation
SIBGRAPI '08 Proceedings of the 2008 XXI Brazilian Symposium on Computer Graphics and Image Processing
Video visualization for compact presentation and fast browsing of pictorial content
IEEE Transactions on Circuits and Systems for Video Technology
Hi-index | 0.01 |
Video summarization is a simplification of video content for compacting the video information. The video summarization problem can be transformed to a clustering problem, in which some frames are selected to saliently represent the video content. In this work, we use a graph-theoretic divisive clustering algorithm based on construction of a minimum spanning tree to select video frames without segmenting the video into shots or scenes. Experimental results provides a visually comparison between the new approach and other popular algorithms from the literature, showing that the new algorithm is robust and efficient.