{"title":"基于简单签名和LCS算法的重拍检测改进","authors":"Narongsak Putpuek, N. Cooharojananone, S. Satoh","doi":"10.1109/SNPD.2017.8022730","DOIUrl":null,"url":null,"abstract":"Rushes videos consist of two types of content: the useless content and the redundant content (retakes). Then, automatic retake detection is more challenging due to the difficulty of eliminating repetitive takes, that are usually have different lengths and motion patterns. To overcome this challenge, previous approaches represent video segments using a longer string which is converted from SIFT matching, or a combination of different features. However, these require a large computational time and do not assist in improving a performance. In this work, we introduce a simple signature (global feature) to represent video segments because of its simplicity and effectiveness. The similarity between each pair of signature sequences was determined by using the Longest Common Subsequence algorithm (LCS). A simple retake detection was then used to detect a retake. This proposed was applied to the TRECVID BBC Rushed 2007 and 2008. The results showed that using a simple signature provides a high degree of accuracy, and reduces a computation time in feature extraction and LCS matching.","PeriodicalId":186094,"journal":{"name":"2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A modification of retake detection using simple signature and LCS algorithm\",\"authors\":\"Narongsak Putpuek, N. Cooharojananone, S. Satoh\",\"doi\":\"10.1109/SNPD.2017.8022730\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Rushes videos consist of two types of content: the useless content and the redundant content (retakes). Then, automatic retake detection is more challenging due to the difficulty of eliminating repetitive takes, that are usually have different lengths and motion patterns. To overcome this challenge, previous approaches represent video segments using a longer string which is converted from SIFT matching, or a combination of different features. However, these require a large computational time and do not assist in improving a performance. In this work, we introduce a simple signature (global feature) to represent video segments because of its simplicity and effectiveness. The similarity between each pair of signature sequences was determined by using the Longest Common Subsequence algorithm (LCS). A simple retake detection was then used to detect a retake. This proposed was applied to the TRECVID BBC Rushed 2007 and 2008. The results showed that using a simple signature provides a high degree of accuracy, and reduces a computation time in feature extraction and LCS matching.\",\"PeriodicalId\":186094,\"journal\":{\"name\":\"2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SNPD.2017.8022730\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SNPD.2017.8022730","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
摘要
rush视频包含两种类型的内容:无用的内容和冗余的内容(重拍)。然后,自动重拍检测更具挑战性,因为很难消除重复拍摄,这些重复拍摄通常具有不同的长度和运动模式。为了克服这一挑战,以前的方法使用从SIFT匹配转换的更长的字符串或不同特征的组合来表示视频片段。然而,这些需要大量的计算时间,并且无助于提高性能。在这项工作中,我们引入了一个简单的签名(全局特征)来表示视频片段,因为它简单有效。采用最长公共子序列算法(LCS)确定每对签名序列的相似性。然后使用简单的重拍检测来检测重拍。该建议适用于2007年和2008年的TRECVID BBC rush。结果表明,使用简单的签名可以提供较高的准确性,并且减少了特征提取和LCS匹配的计算时间。
A modification of retake detection using simple signature and LCS algorithm
Rushes videos consist of two types of content: the useless content and the redundant content (retakes). Then, automatic retake detection is more challenging due to the difficulty of eliminating repetitive takes, that are usually have different lengths and motion patterns. To overcome this challenge, previous approaches represent video segments using a longer string which is converted from SIFT matching, or a combination of different features. However, these require a large computational time and do not assist in improving a performance. In this work, we introduce a simple signature (global feature) to represent video segments because of its simplicity and effectiveness. The similarity between each pair of signature sequences was determined by using the Longest Common Subsequence algorithm (LCS). A simple retake detection was then used to detect a retake. This proposed was applied to the TRECVID BBC Rushed 2007 and 2008. The results showed that using a simple signature provides a high degree of accuracy, and reduces a computation time in feature extraction and LCS matching.