IP Library Granted Patent US 7,852,414
Granted Patent B2
US 7,852,414 · App. 10/532,282 · Granted Dec 14, 2010

Method of selecting seeds for the clustering of key-frames

View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 7,852,414
App. No.
10/532,282
Granted
Dec 14, 2010
Kind
B2
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.

Claims (15)

1. Method of selecting seeds from a set of key images of a video sequence for the grouping of key images of prevalent shots of the video sequence for use in interactive navigation of the video sequence, comprising the following steps:

random drawing of p candidates from the set of key images by automatically extracting shots of interest, p being calculated to increase the probability of drawing a key image of a prevalent shot,

calculation of a cost C for each candidate, dependent on the distance from the key images of the set to that of the candidate, the distance relating to signatures,

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 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 in order to refine the grouping of key images to those of interest for the interactive navigation of the video sequence,

wherein the cost C is dependent on the quadratic distances between the signature of the candidate and those of the key images of the subset and in that T is the standard deviation of the distribution of the distances of the key images of the set from the candidate and is dependent on the distribution of the distances of the key images of the set from the candidate.

2. Method according to claim 1 , wherein the key images are weighted, as regards their signature, as a function of the length of the shots of the video sequence that they characterize and in that the random draw is biased by the weight of the key images.

3. Method according to claim 1 , wherein the signature of an image relates to the dominant colour.

4. Method of grouping (clustering) shots of a sequence of video images, the sequence being split into shots, a shot being represented by one or more key images, at least one signature or attribute being calculated for the key images, comprising a phase of partitioning the key images on the basis of a comparison of the attributes of the key images, comprising a phase of initialization for the selection of at least two key images or seeds on the basis of which the comparisons for the grouping are performed, the selection being performed according to the method of claim 1 .

5. Method according to claim 4 , wherein the partitioning phase implements an algorithm of the K-means or K-medoid type.

6. Method according to claim 4 , wherein the initialization and partitioning phases are iteratively repeated, the key images of the most compact cluster obtained in the previous iteration being eliminated from the set processed at this previous iteration so as to provide a new set on which the new iteration is performed.

7. Method according to claim 6 , wherein the stopping criterion for the iterations is dependent on the number of key images not belonging to the most compact cluster selected or else is dependent on the averages of the intra-cluster distances.

8. Method of selecting shots of interest, these shots being prevalent in the video sequence, implementing the method according to claim 4 , the shots of interest corresponding to the grouping performed about the first seed selected.

Assignments (3)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 10, 2018
From: THOMSON LICENSING DTV
To: INTERDIGITAL MADISON PATENT HOLDINGS
Reel/Frame 046763/0001 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 22, 2017
From: THOMSON LICENSING
To: THOMSON LICENSING DTV
Reel/Frame 043302/0965 →
CHANGE OF NAME Recorded Apr 21, 2017
From: THOMSON LICENSING S.A.
To: THOMSON LICENSING
Reel/Frame 042303/0268 →