检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]郑州师范学院信息科学与技术学院,河南郑州450044 [2]中州大学信息工程学院,河南郑州450044
出 处:《计算机应用与软件》2015年第9期144-148,共5页Computer Applications and Software
基 金:河南省重点科技攻关项目(132102310003)
摘 要:关键帧提取是视频检索的一项关键技术。针对传统的关键帧提取算法准确度低,视频检索的查全率和查准率不高的问题,提出一种基于多层核心凝聚思想的视频关键帧提取算法。首先,对文献[1]提出的多层核心集凝聚算法(MULCA)进行研究,并利用K-medoids算法用真实数据作为聚类中心的特性,对MULCA算法的凝聚粗化和凝聚细化两个重要过程进行改进,用其替代原粗化过程得到的顶层核心集,设计了一种新的多层核心集凝聚算法(IMULCA),实现了顶层核心集的快速准确定位,并可适当减少凝聚层数,简化了算法的计算复杂性。然后,将IMULCA算法应用到视频关键帧提取中,实验结果表明所提改进算法相对于原有算法能够更加有效地对视频关键帧进行提取。Key frame extraction is a key technology in video retrieval. Traditional key frame extraction algorithm has the problems of low accuracy and low recall and precision in video retrieval. For these problems, we proposed a key video frame extraction algorithm which is based on multilayer core agglomeration thoughts. First, we studied the multilayer core set agglomeration algorithm (MULCA) presented in literature [ 1 ] , and utilised the characteristic of K-medoids algorithm-it uses real data as the clustering centre - to improve two important processes of MULCA" algorithm, the roughening of agglomeration and the refinement of agglomeration, we also substituted the original top layer core set derived from roughening process with it, designed a new multilayer core set agglomeration algorithm (IMULCA), and realised the fast and accurate positioning of top layer core set, which can appropriately reduce the agglomeration layer and simplify the computation complexity of the algorithm. Then, we applied the IMULCA algorithm to the extraction of key video frames. Experimental results showed that the proposed algorithm, compared with the previous algorithm, could more effectively extract the key video frame.
关 键 词:多层凝聚算法 关键帧提取 K—medoids视频检索
分 类 号:TP3[自动化与计算机技术—计算机科学与技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.15.34.191