A Clustering Algorithm for Key Frame Extraction Based on Density Peak

HTML  XML Download Download as PDF (Size: 508KB)  PP. 118-128  
DOI: 10.4236/jcc.2018.612012    961 Downloads   2,406 Views  Citations

ABSTRACT

Aiming at the problem of video key frame extraction, a density peak clustering algorithm is proposed, which uses the HSV histogram to transform high-dimensional abstract video image data into quantifiable low-dimensional data, and reduces the computational complexity while capturing image features. On this basis, the density peak clustering algorithm is used to cluster these low-dimensional data and find the cluster centers. Combining the clustering results, the final key frames are obtained. A large number of key frame extraction experiments for different types of videos show that the algorithm can extract different number of key frames by combining video content, overcome the shortcoming of traditional key frame extraction algorithm which can only extract a fixed number of key frames, and the extracted key frames can represent the main content of video accurately.

Share and Cite:

Zhao, H. , Wang, T. and Zeng, X. (2018) A Clustering Algorithm for Key Frame Extraction Based on Density Peak. Journal of Computer and Communications, 6, 118-128. doi: 10.4236/jcc.2018.612012.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.