基于图论FCM算法的视频摘要

D. Besiris, F. Fotopoulou, G. Economou, S. Fotopoulos
{"title":"基于图论FCM算法的视频摘要","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":"{\"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}","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

摘要

本文在分析视频结构的基础上,提出了一种统一的视频摘要方法。该方法源于一种数据学习技术,该技术使用FCM算法的过分割模式产生的隶属度值来查找结果原型中心集之间的连接强度。最后的聚类阶段是通过使用连接矩阵产生的最小生成树来实现的。基于MST边权值,直接导出聚类,无需监督。该算法通过对视频片段进行检测,并从每个视频片段中选择关键帧来完成。用客观标准和主观标准对该方法进行了评价,结果表明该方法对加长视频数据集结构的适用性令人满意。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Video summarization by a graph-theoretic FCM based algorithm
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信