首页 | 本学科首页   官方微博 | 高级检索  
     

基于超图聚类的故事单元的抽取与分析
引用本文:樊昀,王润生. 基于超图聚类的故事单元的抽取与分析[J]. 软件学报, 2003, 14(4): 857-863
作者姓名:樊昀  王润生
作者单位:国防科学技术大学,ATR国防科技重点实验室,湖南,长沙,410073
摘    要:合理而有效地结构化组织视频数据是浏览、检索和管理视频的重要前提.提出了一种新的层次化的结构化组织视频数据的提取故事单元的方法.它采用k-近邻超图描述镜头间的内容相似关系,利用超图模型对镜头聚类,并通过分析镜头类别间的时间投影关系提取故事单元,并采用一维字符串描述故事单元.此外,还提出了结合领域知识确定故事单元的类型的算法框架,并将其用于对话场景的检测.将算法用于测试多段视频,实验结果令人满意.

关 键 词:视频检索  镜头  故事单元  k-近邻超图  层次聚类
收稿时间:2001-09-10
修稿时间:2001-09-10

Extraction and Analysis of Story Unit Based on Clustering of Hyper-Graph
FAN Yun and WANG Run-Sheng. Extraction and Analysis of Story Unit Based on Clustering of Hyper-Graph[J]. Journal of Software, 2003, 14(4): 857-863
Authors:FAN Yun and WANG Run-Sheng
Abstract:It is the important precondition for browsing, retrieval and indexing videos that effectively and rationally organizing the video structure. In this paper, for hierarchically organizing the video structure, a method for extracting story units is proposed. k-nearest neighbor hyper-graph is used to represent the content relations among shots, and shots are clustered based on hyper-graph model. By analyzing time projection relations among shot clusters, story units are extracted, and represented by the 1D strings. A frame using specific domain knowledge for identifying the type of story unit is also proposed, and is applied to identify the dialogs in the videos. The new algorithm is applied to multiple test videos, and the experiments results are satisfying.
Keywords:video retrieval   shot   story unit   k-nearest neighbor hyper-graph   hierarchical clustering
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《软件学报》浏览原始摘要信息
点击此处可从《软件学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号