场景中断检测:一个比较

G. Lupatini, C. Saraceno, R. Leonardi
{"title":"场景中断检测:一个比较","authors":"G. Lupatini, C. Saraceno, R. Leonardi","doi":"10.1109/RIDE.1998.658276","DOIUrl":null,"url":null,"abstract":"The automatic organization of video databases according to the semantic content of data is a key aspect for efficient indexing and fast retrieval of audio-visual material. In order to generate indices that can be used to access a video database, a description of each video sequence is necessary. The identification of objects present in a frame and the track of their motion and interaction in space and time, is attractive but not yet very robust. For this reason, since the early 90's, attempts have been applied in trying to segment a video in shots. For each shot a representative frame of the shot, called k-frame, is usually chosen and the video can be analyzed through its k-frames. Even if abrupt scene changes are relatively easy to detect, it is more difficult to identify special effects, such as dissolve, that were operated in the editing stage to merge two shots. Unfortunately, these special effects are normally used to stress the importance of the scene change (from a content point of view), so they are extremely relevant, therefore they should not be missed. It is very important to determine precisely the beginning and the end of the transition in the case of dissolves and fades. In this work, two new parameters are proposed. These characterize the precision of boundaries of special effects when the scene change involves more than two frames. They are combined with the common recall and precision parameters. Three types of algorithms for cut detection are considered: histogram-based, motion-based and contour-based. These algorithms are tested and compared on several video sequences. Results show that the best performance is achieved by the global histogram-based method which uses color information.","PeriodicalId":199347,"journal":{"name":"Proceedings Eighth International Workshop on Research Issues in Data Engineering. Continuous-Media Databases and Applications","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"91","resultStr":"{\"title\":\"Scene break detection: a comparison\",\"authors\":\"G. Lupatini, C. Saraceno, R. Leonardi\",\"doi\":\"10.1109/RIDE.1998.658276\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The automatic organization of video databases according to the semantic content of data is a key aspect for efficient indexing and fast retrieval of audio-visual material. In order to generate indices that can be used to access a video database, a description of each video sequence is necessary. The identification of objects present in a frame and the track of their motion and interaction in space and time, is attractive but not yet very robust. For this reason, since the early 90's, attempts have been applied in trying to segment a video in shots. For each shot a representative frame of the shot, called k-frame, is usually chosen and the video can be analyzed through its k-frames. Even if abrupt scene changes are relatively easy to detect, it is more difficult to identify special effects, such as dissolve, that were operated in the editing stage to merge two shots. Unfortunately, these special effects are normally used to stress the importance of the scene change (from a content point of view), so they are extremely relevant, therefore they should not be missed. It is very important to determine precisely the beginning and the end of the transition in the case of dissolves and fades. In this work, two new parameters are proposed. These characterize the precision of boundaries of special effects when the scene change involves more than two frames. They are combined with the common recall and precision parameters. Three types of algorithms for cut detection are considered: histogram-based, motion-based and contour-based. These algorithms are tested and compared on several video sequences. Results show that the best performance is achieved by the global histogram-based method which uses color information.\",\"PeriodicalId\":199347,\"journal\":{\"name\":\"Proceedings Eighth International Workshop on Research Issues in Data Engineering. Continuous-Media Databases and Applications\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-02-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"91\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Eighth International Workshop on Research Issues in Data Engineering. Continuous-Media Databases and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RIDE.1998.658276\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Eighth International Workshop on Research Issues in Data Engineering. Continuous-Media Databases and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RIDE.1998.658276","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 91

摘要

根据数据的语义内容自动组织视频数据库是实现音像资料高效索引和快速检索的关键。为了生成可用于访问视频数据库的索引,需要对每个视频序列进行描述。在一个框架中存在的物体的识别,以及它们在空间和时间中的运动和相互作用的轨迹,是有吸引力的,但还不是很健壮。出于这个原因,自90年代初以来,人们就开始尝试将视频分割成镜头。对于每个镜头,通常选择一个具有代表性的帧,称为k帧,通过它的k帧来分析视频。即使突然的场景变化相对容易发现,但要识别在剪辑阶段操作的特殊效果(如溶解)来合并两个镜头就比较困难了。不幸的是,这些特效通常是用来强调场景变化的重要性(从内容的角度来看),所以它们是非常相关的,因此它们不应该被错过。在溶解和消退的情况下,精确地确定过渡的开始和结束是非常重要的。在这项工作中,提出了两个新的参数。当场景变化涉及两帧以上时,这些特征表征了特效边界的精确性。它们与常见的查全率和查准率参数相结合。考虑了三种类型的切割检测算法:基于直方图的,基于运动的和基于轮廓的。在多个视频序列上对这些算法进行了测试和比较。结果表明,利用颜色信息的基于全局直方图的方法取得了最好的效果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Scene break detection: a comparison
The automatic organization of video databases according to the semantic content of data is a key aspect for efficient indexing and fast retrieval of audio-visual material. In order to generate indices that can be used to access a video database, a description of each video sequence is necessary. The identification of objects present in a frame and the track of their motion and interaction in space and time, is attractive but not yet very robust. For this reason, since the early 90's, attempts have been applied in trying to segment a video in shots. For each shot a representative frame of the shot, called k-frame, is usually chosen and the video can be analyzed through its k-frames. Even if abrupt scene changes are relatively easy to detect, it is more difficult to identify special effects, such as dissolve, that were operated in the editing stage to merge two shots. Unfortunately, these special effects are normally used to stress the importance of the scene change (from a content point of view), so they are extremely relevant, therefore they should not be missed. It is very important to determine precisely the beginning and the end of the transition in the case of dissolves and fades. In this work, two new parameters are proposed. These characterize the precision of boundaries of special effects when the scene change involves more than two frames. They are combined with the common recall and precision parameters. Three types of algorithms for cut detection are considered: histogram-based, motion-based and contour-based. These algorithms are tested and compared on several video sequences. Results show that the best performance is achieved by the global histogram-based method which uses color information.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信