Dynamic Clustering Algorithm for Video Summarization on VSUMM Dataset

Venkata Ravi Teja Jaladanki, Rajeswara Rao Duvvada, Hari Venkata Samba Siva Rao Badugu
{"title":"Dynamic Clustering Algorithm for Video Summarization on VSUMM Dataset","authors":"Venkata Ravi Teja Jaladanki, Rajeswara Rao Duvvada, Hari Venkata Samba Siva Rao Badugu","doi":"10.1109/IDCIoT56793.2023.10053559","DOIUrl":null,"url":null,"abstract":"The extent of videos being produced per day across the world is enormous, and in the past few years it has increased to an unprecedented level. Information extraction from a video, however, is more difficult than information extraction from an image. A viewer must see the entire video in order to understand its context. Aside from context awareness, it is nearly impossible to make a universally applicable summary video because each person has a different preferred keyframe. A number of approaches came into existence for tackling this problem which include supervised and unsupervised learning techniques, and some associated with Deep Learning techniques. However, it would require a significant amount of individualized data labelling if we attempted to approach problem video summarizing via a supervised learning method. In this paper, we developed an algorithm based on Dynamic Clustering of projected frame histograms approach to address the challenge of video summarization using unsupervised learning. We have tested the performance of the approach on the VSUMM, a benchmark dataset and showcased that using dynamic clustering algorithm has been proven to perform competitively with some existing approaches.","PeriodicalId":60583,"journal":{"name":"物联网技术","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2023-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"物联网技术","FirstCategoryId":"1093","ListUrlMain":"https://doi.org/10.1109/IDCIoT56793.2023.10053559","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The extent of videos being produced per day across the world is enormous, and in the past few years it has increased to an unprecedented level. Information extraction from a video, however, is more difficult than information extraction from an image. A viewer must see the entire video in order to understand its context. Aside from context awareness, it is nearly impossible to make a universally applicable summary video because each person has a different preferred keyframe. A number of approaches came into existence for tackling this problem which include supervised and unsupervised learning techniques, and some associated with Deep Learning techniques. However, it would require a significant amount of individualized data labelling if we attempted to approach problem video summarizing via a supervised learning method. In this paper, we developed an algorithm based on Dynamic Clustering of projected frame histograms approach to address the challenge of video summarization using unsupervised learning. We have tested the performance of the approach on the VSUMM, a benchmark dataset and showcased that using dynamic clustering algorithm has been proven to perform competitively with some existing approaches.
基于VSUMM数据集的视频摘要动态聚类算法
世界各地每天制作的视频数量是巨大的,在过去的几年里,它已经增长到前所未有的水平。然而,从视频中提取信息比从图像中提取信息要困难得多。观众必须看完整个视频才能理解它的背景。除了上下文感知之外,几乎不可能制作出普遍适用的总结视频,因为每个人都有不同的首选关键帧。为了解决这个问题,出现了许多方法,包括监督和无监督学习技术,以及一些与深度学习技术相关的方法。然而,如果我们试图通过监督学习方法来处理问题视频总结,则需要大量的个性化数据标记。在本文中,我们开发了一种基于投影帧直方图的动态聚类算法来解决使用无监督学习进行视频摘要的挑战。我们已经在VSUMM(一个基准数据集)上测试了该方法的性能,并展示了使用动态聚类算法已被证明与一些现有方法相比具有竞争力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
5689
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信