计算机科学 ›› 2014, Vol. 41 ›› Issue (10): 53-56.doi: 10.11896/j.issn.1002-137X.2014.10.012

• 2013’和谐人机环境联合学术会议 • 上一篇    下一篇

相似视频片段的检测与定位方法研究

郭延明,谢毓湘,老松杨,白亮   

  1. 国防科学技术大学信息系统工程重点实验室 长沙410073;国防科学技术大学信息系统工程重点实验室 长沙410073;国防科学技术大学信息系统工程重点实验室 长沙410073;国防科学技术大学信息系统工程重点实验室 长沙410073
  • 出版日期:2018-11-14 发布日期:2018-11-14
  • 基金资助:
    本文受国家自然科学基金(61201339),中国十二五规划(40901040202)资助

Detection and Location of Near-duplicate Video Clips

GUO Yan-ming,XIE Yu-xiang,LAO Song-yang and BAI Liang   

  • Online:2018-11-14 Published:2018-11-14

摘要: 相似视频片段探测可以辅助网络视频检索、内容关联分析等方面的研究,具有重要的意义。重点研究了位置随机的相似视频片段的探测与定位问题,首先在视频结构化分析与关键帧提取的基础上,对不同视频进行相似关键帧探测。为保证探测的精度与效率,针对视频关键帧的特点,采用了FAST检测子和BRIEF描述子相结合的方法,利用关键帧的局部特征进行相似关键帧探测;其次提出了一种相似关键帧距离度量的方法,利用相似关键帧所在源视频的位置来构建相似关键帧距离矩阵,保留矩阵中距离较小的相似关键帧,将寻找相似视频片段的过程转化为寻找矩阵对应的连通图的过程。最后对算法进行了实验,结果表明,该方法可以有效地探测处于各个位置的相似视频片段。

关键词: FAST,BRIEF,相似关键帧,相似视频片段

Abstract: The paper aimed to detect and locate multiple near-duplicate video clips at random locations.First,video structure analysis was carried out to extract the keyframes.Second,to ensure the accuracy and efficiency,a method which combines the advantages of FAST and BRIEF was proposed to find the near-duplicate keyframes (NDK) between the videos.Then,the paper put forward an algorithm to calculate the distance between NDKs,using the locations of the keyframes in the source video.In this way,we could get a distance matrix of NDKs.We reserved the close distance in the matrix by setting a distance threshold,and transformed the detection and location of multiple near-duplicate video clips to find the connected graphs that the matrix corresponds to.The experimental results show that the method can effectively detect and locate near-duplicate video clips at random locations.

Key words: FAST,BRIEF,Near-duplicate keyframe,Near-duplicate video clips

[1] Chen L,Chua T S.A match and tiling approach to content-basedvideo retrieval[C]∥Int.Conf.on Multimedia and Expo.2001:417-420
[2] Kashino K,Kurozumi T,Murase H.A quick search method for audio and video signals based on histogram pruning[J].IEEE Transactions on Multimedia,2003,5(3):348-357
[3] Chiu C,Wang H.A novel video matching framework for copy detection[C]∥Proc.of the 21th IPPR Conference on Computer Vision,Graphics and Image Processing (CVGIP’2008).2008
[4] Myers C S,Rabiner L R.A comparative study of several dynamictime-warping algorithms for connected word recognition[J].The Bell System Technical Journal,1981,60(7):1389-1409
[5] 曹政,卢宝丰,朱明.一种快速相似视频检索方法[J].信息与控制,2010,39(5):635-639
[6] 陈秀新,贾克斌,邓智玭,等.一种新的鲁棒性视频复制检测算法[J].北京工业大学学报,2011,37(5):691-696
[7] Liu F,Dong D G,Miao X,et al.A fast video clip retrieval algorithm based on VA-File[C]∥Electronic Imaging 2004.International Society for Optics and Photonics,2003:167-176
[8] Chen T,Jiang S,Chu L,et al.Detection and location of near-duplicate video sub-clips by finding dense subgraphs[C]∥Procee-dings of the 19th ACM international conference on Multimedia.ACM,2011:1173-1176
[9] Lowe D G.Distinctive image features from scale-invariant keypoints[J].International journal of computer vision,2004,60(2):91-110 (下转第71页)(上接第56页)
[10] Bay H,Tuytelaars T,Van Gool L.Surf:Speeded up robust features[M].Computer Vision-ECCV 2006.Springer Berlin Heidelberg,2006:404-417
[11] Rosten E,Drummond T.Machine learning for high-speed corner detection[M]∥Computer Vision-ECCV 2006.Springer Berlin Heidelberg,2006:430-443
[12] Calonder M,Lepetit V,Strecha C,et al.BRIEF:binary robustindependent elementary features[M]∥Computer Vision-ECCV 2010.Springer Berlin Heidelberg,2010:778-792
[13] Leutenegger S,Chli M,Siegwart R Y.BRISK:Binary robust invariant scalable keypoints[C]∥2011 IEEE International Conference on Computer Vision (ICCV).IEEE,2011:2548-2555
[14] Rublee E,Rabaud V,Konolige K,et al.ORB:an efficient alternative to SIFT or SURF[C]∥2011 IEEE International Confe-rence on Computer Vision (ICCV).IEEE,2011:2564-2571
[15] Quinlan J R.Induction of decision trees[J].Machine learning,1986,1(1):81-106
[16] 邓黎,王春鸿,饶长辉.基于二进制稳健独立基元特征的扩展目标快速检测[J].中国激光,2012,39(B06):327-331
[17] 郭莉莎,等.基于多尺度FAST-9的图像快速匹配算法[J].计算机工程,2012,38(12)
[18] http://www.ee.columbia.edu/ln/dvmm/researchProjects/Fea-tureExtraction/NearDuplicateByParts/INDDetection.html,2004
[19] Tan H K,Ngo C W,Chua T S.Efficient mining of multiple partial near-duplicate alignments by temporal network[J].IEEE Transactions on Circuits and Systems for Video Technology,2010,20(11):1486-1498

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!