D. Besiris, F. Fotopoulou, G. Economou, S. Fotopoulos
{"title":"Video summarization by a graph-theoretic FCM based algorithm","authors":"D. Besiris, F. Fotopoulou, G. Economou, S. Fotopoulos","doi":"10.1109/IWSSIP.2008.4604478","DOIUrl":null,"url":null,"abstract":"In this work, we propose a unified approach for video summarization based on the analysis of the video structure. The method originates from a data learning technique that uses the membership values produced by an over-partitioning mode of the FCM algorithm to find the connection strength between the resulting set of prototype centers. The final clustering stage is implemented by using the minimal spanning tree produced by the connectivity matrix. Based on the MST edge weights value, the clusters are derived straightforwardly and without supervision. The algorithm is finalized by the detection of video shots and the selection of key frames from each one. The method is evaluated by using objective and subjective criteria and its applicability to elongated video data set structures is very satisfactory.","PeriodicalId":322045,"journal":{"name":"2008 15th International Conference on Systems, Signals and Image Processing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 15th International Conference on Systems, Signals and Image Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWSSIP.2008.4604478","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
Abstract
In this work, we propose a unified approach for video summarization based on the analysis of the video structure. The method originates from a data learning technique that uses the membership values produced by an over-partitioning mode of the FCM algorithm to find the connection strength between the resulting set of prototype centers. The final clustering stage is implemented by using the minimal spanning tree produced by the connectivity matrix. Based on the MST edge weights value, the clusters are derived straightforwardly and without supervision. The algorithm is finalized by the detection of video shots and the selection of key frames from each one. The method is evaluated by using objective and subjective criteria and its applicability to elongated video data set structures is very satisfactory.