基于图的有效多视频摘要中心性框架

IF 6.9 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Aziz Qaroush, Mohammad Jubran, Qutaiba Olayan
{"title":"基于图的有效多视频摘要中心性框架","authors":"Aziz Qaroush,&nbsp;Mohammad Jubran,&nbsp;Qutaiba Olayan","doi":"10.1016/j.ipm.2025.104276","DOIUrl":null,"url":null,"abstract":"<div><div>The exponential growth of video content presents substantial challenges in summarizing and retrieving relevant information, particularly in multi-video scenarios involving heterogeneous sources. This paper presents an unsupervised, graph-based centrality framework for multi-video summarization. Segment representations are extracted using 3D Convolutional Neural Networks (3DCNNs) to capture both spatial and temporal features. We introduce three novel ranking algorithms — Weighted Degree Centrality (WDC), V-Rank, and VL-Rank — extending classical methods such as Degree Centrality, PageRank, and LexRank. These algorithms incorporate visual saliency, motion, and semantic similarity to ensure relevance, diversity, and structural representativeness. The framework comprises four stages: segmentation, graph construction, ranking, and selection. We provide a detailed computational analysis, including time complexity and convergence behavior. VL-Rank achieves significantly faster convergence than PageRank through a normalized propagation scheme, while WDC offers a highly efficient, non-iterative alternative. Evaluations on the Tour20 dataset demonstrate that the proposed methods outperform state-of-the-art approaches, with WDC achieving a mean F1 score of 0.741 compared to 0.680 for the Multi-Stream baseline. The framework is both effective and scalable, making it suitable for large-scale or real-time applications.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"62 6","pages":"Article 104276"},"PeriodicalIF":6.9000,"publicationDate":"2025-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Graph-based centrality framework for effective multi-video summarization\",\"authors\":\"Aziz Qaroush,&nbsp;Mohammad Jubran,&nbsp;Qutaiba Olayan\",\"doi\":\"10.1016/j.ipm.2025.104276\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>The exponential growth of video content presents substantial challenges in summarizing and retrieving relevant information, particularly in multi-video scenarios involving heterogeneous sources. This paper presents an unsupervised, graph-based centrality framework for multi-video summarization. Segment representations are extracted using 3D Convolutional Neural Networks (3DCNNs) to capture both spatial and temporal features. We introduce three novel ranking algorithms — Weighted Degree Centrality (WDC), V-Rank, and VL-Rank — extending classical methods such as Degree Centrality, PageRank, and LexRank. These algorithms incorporate visual saliency, motion, and semantic similarity to ensure relevance, diversity, and structural representativeness. The framework comprises four stages: segmentation, graph construction, ranking, and selection. We provide a detailed computational analysis, including time complexity and convergence behavior. VL-Rank achieves significantly faster convergence than PageRank through a normalized propagation scheme, while WDC offers a highly efficient, non-iterative alternative. Evaluations on the Tour20 dataset demonstrate that the proposed methods outperform state-of-the-art approaches, with WDC achieving a mean F1 score of 0.741 compared to 0.680 for the Multi-Stream baseline. The framework is both effective and scalable, making it suitable for large-scale or real-time applications.</div></div>\",\"PeriodicalId\":50365,\"journal\":{\"name\":\"Information Processing & Management\",\"volume\":\"62 6\",\"pages\":\"Article 104276\"},\"PeriodicalIF\":6.9000,\"publicationDate\":\"2025-07-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Information Processing & Management\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0306457325002171\",\"RegionNum\":1,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Processing & Management","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0306457325002171","RegionNum":1,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

视频内容的指数级增长在总结和检索相关信息方面提出了重大挑战,特别是在涉及异构源的多视频场景中。本文提出了一种无监督的、基于图的多视频摘要中心性框架。使用3D卷积神经网络(3DCNNs)提取片段表示以捕获空间和时间特征。我们介绍了三种新的排名算法-加权度中心性(WDC), V-Rank和V-Rank -扩展了经典的方法,如度中心性,PageRank和LexRank。这些算法结合了视觉显著性、运动和语义相似性,以确保相关性、多样性和结构代表性。该框架包括四个阶段:分割、图构建、排序和选择。我们提供了详细的计算分析,包括时间复杂度和收敛行为。通过标准化传播方案,VL-Rank的收敛速度明显快于PageRank,而WDC提供了一种高效、非迭代的替代方案。对Tour20数据集的评估表明,所提出的方法优于最先进的方法,WDC的平均F1得分为0.741,而多流基线的F1得分为0.680。该框架既有效又可扩展,使其适合大规模或实时应用程序。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Graph-based centrality framework for effective multi-video summarization
The exponential growth of video content presents substantial challenges in summarizing and retrieving relevant information, particularly in multi-video scenarios involving heterogeneous sources. This paper presents an unsupervised, graph-based centrality framework for multi-video summarization. Segment representations are extracted using 3D Convolutional Neural Networks (3DCNNs) to capture both spatial and temporal features. We introduce three novel ranking algorithms — Weighted Degree Centrality (WDC), V-Rank, and VL-Rank — extending classical methods such as Degree Centrality, PageRank, and LexRank. These algorithms incorporate visual saliency, motion, and semantic similarity to ensure relevance, diversity, and structural representativeness. The framework comprises four stages: segmentation, graph construction, ranking, and selection. We provide a detailed computational analysis, including time complexity and convergence behavior. VL-Rank achieves significantly faster convergence than PageRank through a normalized propagation scheme, while WDC offers a highly efficient, non-iterative alternative. Evaluations on the Tour20 dataset demonstrate that the proposed methods outperform state-of-the-art approaches, with WDC achieving a mean F1 score of 0.741 compared to 0.680 for the Multi-Stream baseline. The framework is both effective and scalable, making it suitable for large-scale or real-time applications.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Information Processing & Management
Information Processing & Management 工程技术-计算机:信息系统
CiteScore
17.00
自引率
11.60%
发文量
276
审稿时长
39 days
期刊介绍: Information Processing and Management is dedicated to publishing cutting-edge original research at the convergence of computing and information science. Our scope encompasses theory, methods, and applications across various domains, including advertising, business, health, information science, information technology marketing, and social computing. We aim to cater to the interests of both primary researchers and practitioners by offering an effective platform for the timely dissemination of advanced and topical issues in this interdisciplinary field. The journal places particular emphasis on original research articles, research survey articles, research method articles, and articles addressing critical applications of research. Join us in advancing knowledge and innovation at the intersection of computing and information science.
×
引用
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学术官方微信