基于自适应阈值的自动提取关键帧的聚类算法  

A Cluster Algorithm of Automatic Key Frame Extraction Based on Adaptive Threshold

作　　者：王方石[1] 须德[1] 吴伟鑫[1] 

机构地区：[1]北京交通大学计算机与信息学院,北京100044

出　　处：《计算机研究与发展》2005年第10期1752-1757,共6页Journal of Computer Research and Development

基　　金：北京交通大学科技基金项目(2004sm013)

摘　　要：利用无监督聚类算法来提取关键帧是一种常用的方法,但该算法对类别数和初始类划分较敏感,在对视频内容一无所知的情况下,要求预先指定聚类数目是一个很困难的问题·提出一种二次聚类的方法;第1次以镜头内相邻两帧的相似度为数据样本进行聚类(分成两类),计算确定第2次聚类所需的阈值;第2次采用动态聚类的ISODATA算法,以视频序列的帧为数据样本进行聚类,得到最终聚类结果·最后在每类中自动提取距其类中心最近的帧为关键帧·该算法简单且行之有效,无需预定义任何阈值(如聚类数目)·对大量不同特点的视频进行了实验,该算法均取得了较好的实验结果·It is a common method to extract key frames using the unsupervised cluster algorithm. But the algorithm is sensitive to the initial number of the classes and the initial classification. It is problematic to predefine the absolute number of key frames without knowing the video content. An approach for two times clustering is presented. In the first time, the similarity distances of the consecutive frames in a shot are clustered into two classes so that the thresholds needed in the second time clustering process can be determined adaptively. In the second time clustering, all the frames in the shot are clustered using dynamic cluster ISODATA algorithm. Then the frame nearest to the center of its class is automatically extracted as one key frame in the shot. It is simple and effective with no need to predefine any threshold. Experimental results of many videos with different traits demonstrate the good performance of the proposed algorithm.

关 键 词：关键帧 无监督聚类 ISODATA算法 自适应阈值 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]