Summarizing Large News Video Archives by Event Ranking

Duy-Dinh Le, S. Satoh
{"title":"Summarizing Large News Video Archives by Event Ranking","authors":"Duy-Dinh Le, S. Satoh","doi":"10.1109/ICSC.2011.91","DOIUrl":null,"url":null,"abstract":"We present an approach to extract and rank important events in large news video archives. Our approach relies on the assumption that frequent patterns occurring in the large video datasets might correspond to important events. We propose a method to automatically find, analyze, and associate frequent patterns to events in the video datasets. This problem is challenging because: firstly, the event boundary is unknown and large variations in illumination, camera motion, occlusions, and text overlays make it difficult to select appropriate features for event representation. Secondly, the number of frequent patterns is usually large, a method to rank them is required for applications such as recommendation and summarization. Thirdly, large datasets require scalable methods to handle. The novelty of the proposed method is that temporal information is used to rank frequent patterns and that scalable methods from video processing and data mining are integrated seamlessly to handle large datasets. Experimental results on 2,768 news video programs (approx. 1,400 hours of video) broadcast by NHK from 2001 to 2008 show that the method can find important events for summarization and is scalable on large datasets.","PeriodicalId":408382,"journal":{"name":"2011 IEEE Fifth International Conference on Semantic Computing","volume":"72 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE Fifth International Conference on Semantic Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSC.2011.91","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

We present an approach to extract and rank important events in large news video archives. Our approach relies on the assumption that frequent patterns occurring in the large video datasets might correspond to important events. We propose a method to automatically find, analyze, and associate frequent patterns to events in the video datasets. This problem is challenging because: firstly, the event boundary is unknown and large variations in illumination, camera motion, occlusions, and text overlays make it difficult to select appropriate features for event representation. Secondly, the number of frequent patterns is usually large, a method to rank them is required for applications such as recommendation and summarization. Thirdly, large datasets require scalable methods to handle. The novelty of the proposed method is that temporal information is used to rank frequent patterns and that scalable methods from video processing and data mining are integrated seamlessly to handle large datasets. Experimental results on 2,768 news video programs (approx. 1,400 hours of video) broadcast by NHK from 2001 to 2008 show that the method can find important events for summarization and is scalable on large datasets.
基于事件排序的大型新闻视频档案汇总
我们提出了一种从大型新闻视频档案中提取重要事件并对其进行排序的方法。我们的方法依赖于一个假设,即在大型视频数据集中出现的频繁模式可能对应于重要事件。我们提出了一种自动发现、分析和关联视频数据集中事件的频繁模式的方法。这个问题是具有挑战性的,因为:首先,事件边界是未知的,光照、相机运动、遮挡和文本覆盖的巨大变化使得难以选择合适的特征来表示事件。其次,频繁模式的数量通常很大,在推荐和摘要等应用中需要对它们进行排序的方法。第三,大型数据集需要可扩展的方法来处理。该方法的新颖之处在于使用时间信息对频繁模式进行排序,并将视频处理和数据挖掘的可扩展方法无缝集成以处理大型数据集。对2768个新闻视频节目的实验结果NHK在2001 - 2008年播出的1400小时的视频数据表明,该方法可以发现重要的事件进行总结,并且在大数据集上具有可扩展性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信