Unsupervised Clustering Algorithm for Video Shots Using Spectral Division

A new unsupervised clustering algorithm, Spectral-division Unsupervised Shot-clustering Algorithm (SUSC), is proposed in this paper. Key-fames are picked out to represent the shots, and color feature of key-frames are extracted to describe video shots. Spherical Gaussian Model (SGM) is constructed for every shot category to form effective descriptions of them. Then Spectral Division (SD) method is employed to divide a category into two categories, and the method is iteratively used for further divisions. After each iterative shot-division, Bayesian information Criterion (BIC) is utilized to automatically judge whether to stop further division. During this processes, one category may be dissevered by mistake. In order to correct these mistakes, similar categories will be merged by calculating the similarities of every two categories. This approach is applied to three kinds of sports videos, and the experimental results show that the proposed approach is reliable and effective.

[1]  Nello Cristianini,et al.  On the Concentration of Spectral Properties , 2001, NIPS.

[2]  Zhi-Qiang Liu,et al.  Investigation on unsupervised clustering algorithms for video shot categorization , 2007, Soft Comput..

[3]  Jean-Marc Odobez,et al.  Spectral Structuring of Home Videos , 2003, CIVR.

[4]  Jitendra Malik,et al.  Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[5]  M. Fiedler.  A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory , 1975 .

[6]  Richard M. Leahy,et al.  An Optimal Graph Theoretic Approach to Data Clustering: Theory and Its Application to Image Segmentation , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[7]  Andrew W. Moore,et al.  X-means: Extending K-means with Efficient Estimation of the Number of Clusters , 2000, ICML.

[8]  Tsunenori Ishioka,et al.  An Expansion of X-Means for Automatically Determining the Optimal Number of Clusters a^EUR" Progressive Iterations of K-Means and Merging of the Clusters , 2005, Computational Intelligence.

[9]  Tsunenori Ishioka,et al.  AN EXPANSION OF -MEANS FOR AUTOMATICALLY DETERMINING THE OPTIMAL NUMBER OF CLUSTERS — PROGRESSIVE ITERATIONS OF -MEANS AND MERGING OF THE CLUSTERS — , 2005 .

[10]  Jean-Marc Odobez,et al.  On Spectral Methods and the Structuring of Home Videos , 2002 .

[11]  Shih-Fu Chang,et al.  Structure analysis of sports video using domain models , 2001, IEEE International Conference on Multimedia and Expo, 2001. ICME 2001..

[12]  Lei Zhang,et al.  A CBIR method based on color-spatial feature , 1999, Proceedings of IEEE. IEEE Region 10 Conference. TENCON 99. 'Multimedia Technology for Asia-Pacific Information Infrastructure' (Cat. No.99CH37030).

[13]  Michael I. Jordan,et al.  On Spectral Clustering: Analysis and an algorithm , 2001, NIPS.

[14]  Raghu Krishnapuram,et al.  Fitting an unknown number of lines and planes to image data through compatible cluster merging , 1992, Pattern Recognit..

[15]  Qi Tian,et al.  A mid-level representation framework for semantic sports video analysis , 2003, ACM Multimedia.