Method of selecting seeds for the clustering of key-frames

Details Method of selecting seeds for the clustering of key-frames Method of selecting seeds for the clustering of key-frames

2003-10-27

2010-12-14

Rao, Andy S (Department: 2621)

Television

Image signal processing circuitry specific to television

Motion dependent key signal generation or scene change...

C715S723000, C382S181000

Reexamination Certificate

active

07852414

ABSTRACT:
The method is characterized in that it implements the following steps:random drawing of p candidates from the set of key images,calculation of a cost C for each candidate,selection of the candidate minimizing the cost C,determination of a subset from among the set of key images such that the key images forming the said subset have a distance from the candidate less than a threshold T,determination of a seed from among the key images of the subset such that it minimizes the cost function C for this subset,deletion of the key images of the subset to form a new set of key images for at least one new random draw and determination of a new seed according to the previous 5 steps.The field is that of the selection of shots of interest in a video sequence.

REFERENCES:
patent: 6774917 (2004-08-01), Foote
Paul E. Green: “Analyzing Multivariate Data”, The Dryden Press, 1978, ISBN 0-03-020786-x.
Paul S. Bradley et al.:“Refining Initial Points for K-Means Clustering”,Microsoft Research Technical Report 1998,pp. 3-4).
Palmer:“Density Biased Sampling:An Improved Method for Data Mining and CLustering”,Processing of ACM SIGMOD International Conference on Management of Data,2000.
Turi et al.:“K-Means Clustering for Colour Image Segmentaion with Deteftion of K”, Proceedings of the LASTED international Conference Signal and Image Processing, Oct. 1998,pp. 345-349.
Wan et al.:“A multiresolution color clustering approach to image indexing and retrieval”,Proceedings of 1998 IEEE International Conference,pp. 3705-3708.
J.M. Pena et al: An empirical comparison of four initialization methods for the K-Means algorithm', Pattern Recognition Letters 20(1999) 1027-1040.
Khan et al:“Cluster center initialization algorithm for K-means clustering”, Pattern Recognition Letters 25 (2004) 1293-1302.
Ji He et al:“Initialization of Cluster Refinement Algorithms: A Review and Comparative Study”, Proceedings of Int'l Conference on Neural Networks, Jul. 2004 vol. 1, pp. 297-302.
Douglas Steinley:“lnitializing K-means Batch Clustering: A Critical Evaluation of Several Techniques”,Journal of Classification vol. 24:pp. 99-121, 2007.
Vailaya et al: “Video Clustering” Technical Report MSU-CPS-96-64, Nov. 1996, Department of Computer Science, Michigan State University, MI, US, pp. 1-8.
K.J. Jain et al: “Algorithms for Clustering Data” Algorithms for Clustering Data, 1988, pp. 96-101.
A. Hanjalic et al: “An Integrated Scheme for Automated Video Abstraction Based on Unsupervised Cluster—Validity Analysis” IEEE Transactions on Circuits and Systems for Video Technology, IEEE, Inc., vol. 9, No. 8, Dec. 1999, pp. 1280-1289.
Ng et al: “Efficient and Effective Clustering Methods for Spatial Data Mining”, 20th International Conference on Very Large Data Bases, Sep. 12-15, 1994.
Search Report Dated Apr. 21,2004.

Affiliated with

Also associated with

Rating

Method of selecting seeds for the clustering of key-frames does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method of selecting seeds for the clustering of key-frames, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method of selecting seeds for the clustering of key-frames will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4193499