Efficient matching and clustering of video shots

Browsing, search and retrieval in digital video libraries depend on the ability of the system to match, classify and group video shots by their visual contents. However, similarity of shots cannot always be settled by using only one key frame per shot as commonly practiced. In this paper we propose a scheme to match video shots and to cluster them by taking into account the temporal variations within individual shots. A much reduced representation for a video shot is used. These images still capture the dynamics of visual contents for matching and clustering process. Experimental results are reported.

[1]  Anil K. Jain,et al.  Algorithms for Clustering Data , 1988 .

[2]  Remi Depommier,et al.  Content-based browsing of video sequences , 1994, MULTIMEDIA '94.

[3]  Boon-Lock Yeo,et al.  Rapid scene analysis on compressed video , 1995, IEEE Trans. Circuits Syst. Video Technol..

[4]  Boon-Lock Yeo,et al.  Video browsing using clustering and scene transitions on compressed sequences , 1995, Electronic Imaging.