基于深度卷积神经网络和互概率k近邻的视频摘要

IF 1.7 4区 计算机科学 Q3 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Journal of Experimental & Theoretical Artificial Intelligence Pub Date : 2022-06-06 DOI:10.1080/0952813X.2022.2078888
Jimson L, Dr. J. P. Ananth
{"title":"基于深度卷积神经网络和互概率k近邻的视频摘要","authors":"Jimson L, Dr. J. P. Ananth","doi":"10.1080/0952813X.2022.2078888","DOIUrl":null,"url":null,"abstract":"ABSTRACT The video summarisation is an advanced mechanism for enabling users to handle and browse large videos in an effective manner. Various video summarisation methods are developed in recent days, in which handling of synchronisation and timing issues remain as the important challenge. The proposed video summarisation technique produces a short summary from the huge video stream. Initially, from an input database, the cricket videos containing number of frames are fed to keyframe extraction unit. Here, the keyframe extraction is done by the Euclidean distance and discrete cosine transform, and the best keyframes are selected based on the Euclidean distance. The residual frame is obtained by passing the input frames through deep convolutional neural network. Then, the similarity is calculated by Bhattacharyya distance. For video summarisation process, the optimal frameset is evaluated by matching residual keyframe with obtained keyframes. Here, input queries consisting of face object are subjected to object matching process, which is performed using the proposed mutual probability-based k-nearest neighbour (MP-KNN) to obtain relevant frames based on texture features. The performance of the proposed MP-KNN is superior based on precision, recall, and F-measure with values 0.963, 0.960, and 0.909, respectively.","PeriodicalId":15677,"journal":{"name":"Journal of Experimental & Theoretical Artificial Intelligence","volume":null,"pages":null},"PeriodicalIF":1.7000,"publicationDate":"2022-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Video Summarization using Deep Convolutional Neural Networks and Mutual Probability-based K-Nearest Neighbour\",\"authors\":\"Jimson L, Dr. J. P. Ananth\",\"doi\":\"10.1080/0952813X.2022.2078888\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"ABSTRACT The video summarisation is an advanced mechanism for enabling users to handle and browse large videos in an effective manner. Various video summarisation methods are developed in recent days, in which handling of synchronisation and timing issues remain as the important challenge. The proposed video summarisation technique produces a short summary from the huge video stream. Initially, from an input database, the cricket videos containing number of frames are fed to keyframe extraction unit. Here, the keyframe extraction is done by the Euclidean distance and discrete cosine transform, and the best keyframes are selected based on the Euclidean distance. The residual frame is obtained by passing the input frames through deep convolutional neural network. Then, the similarity is calculated by Bhattacharyya distance. For video summarisation process, the optimal frameset is evaluated by matching residual keyframe with obtained keyframes. Here, input queries consisting of face object are subjected to object matching process, which is performed using the proposed mutual probability-based k-nearest neighbour (MP-KNN) to obtain relevant frames based on texture features. The performance of the proposed MP-KNN is superior based on precision, recall, and F-measure with values 0.963, 0.960, and 0.909, respectively.\",\"PeriodicalId\":15677,\"journal\":{\"name\":\"Journal of Experimental & Theoretical Artificial Intelligence\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.7000,\"publicationDate\":\"2022-06-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Experimental & Theoretical Artificial Intelligence\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1080/0952813X.2022.2078888\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Experimental & Theoretical Artificial Intelligence","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1080/0952813X.2022.2078888","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

视频摘要是使用户能够有效处理和浏览大型视频的一种高级机制。近年来开发了各种视频摘要方法,其中处理同步和定时问题仍然是一个重要的挑战。提出的视频摘要技术可以从庞大的视频流中生成简短的摘要。首先,从输入数据库中,将包含一定帧数的板球视频送入关键帧提取单元。该算法通过欧氏距离和离散余弦变换对关键帧进行提取,并根据欧氏距离选择最佳关键帧。通过深度卷积神经网络传递输入帧,得到残差帧。然后,利用巴塔查里亚距离计算相似度。在视频总结过程中,通过将残差关键帧与获取的关键帧进行匹配来评估最优帧集。在这里,由人脸对象组成的输入查询进行对象匹配处理,使用提出的基于互概率的k近邻(MP-KNN)来获得基于纹理特征的相关帧。基于精度、召回率和f测量值,所提出的MP-KNN的性能分别为0.963、0.960和0.909。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Video Summarization using Deep Convolutional Neural Networks and Mutual Probability-based K-Nearest Neighbour
ABSTRACT The video summarisation is an advanced mechanism for enabling users to handle and browse large videos in an effective manner. Various video summarisation methods are developed in recent days, in which handling of synchronisation and timing issues remain as the important challenge. The proposed video summarisation technique produces a short summary from the huge video stream. Initially, from an input database, the cricket videos containing number of frames are fed to keyframe extraction unit. Here, the keyframe extraction is done by the Euclidean distance and discrete cosine transform, and the best keyframes are selected based on the Euclidean distance. The residual frame is obtained by passing the input frames through deep convolutional neural network. Then, the similarity is calculated by Bhattacharyya distance. For video summarisation process, the optimal frameset is evaluated by matching residual keyframe with obtained keyframes. Here, input queries consisting of face object are subjected to object matching process, which is performed using the proposed mutual probability-based k-nearest neighbour (MP-KNN) to obtain relevant frames based on texture features. The performance of the proposed MP-KNN is superior based on precision, recall, and F-measure with values 0.963, 0.960, and 0.909, respectively.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
6.10
自引率
4.50%
发文量
89
审稿时长
>12 weeks
期刊介绍: Journal of Experimental & Theoretical Artificial Intelligence (JETAI) is a world leading journal dedicated to publishing high quality, rigorously reviewed, original papers in artificial intelligence (AI) research. The journal features work in all subfields of AI research and accepts both theoretical and applied research. Topics covered include, but are not limited to, the following: • cognitive science • games • learning • knowledge representation • memory and neural system modelling • perception • problem-solving
期刊最新文献
Occlusive target recognition method of sorting robot based on anchor-free detection network An effectual underwater image enhancement framework using adaptive trans-resunet ++ with attention mechanism An experimental study of sentiment classification using deep-based models with various word embedding techniques Sign language video to text conversion via optimised LSTM with improved motion estimation An efficient safest route prediction-based route discovery mechanism for drivers using improved golden tortoise beetle optimizer
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1