Patent US5708767A successfully refreshed from Google Patents.
US5708767A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for video browsing based on content and structure
Assignee: Princeton University
•
Filing: 1995-02-03
•
Granted: 1998-01-13
•
Expires: 2015-02-03
Abstract
Abstract A new technique for extracting a hierarchical decomposition of a complex video selection for browsing purposes, combines visual and temporal information to capture the important relations within a scene and between scenes in a video, thus allowing the analysis of the underlying story structure with no a priori knowledge of the content. A general model of hierarchical scene transition graph is applied to an implementation for browsing. Video shots are first identified and a collection of key frames is used to represent each video segment. These collections are then classified according to gross visual information. A platform is built on which the video is presented as directed graphs to the user, with each category of video shots represented by a node and each edge denoting a temporal relationship between categories. The analysis and processing of video is carried out directly on the compressed videos. Preliminary tests show that the narrative structure of a video selection can be effectively captured using this technique.
Inventors
- 👤 Boon-Lock Yeo
- 👤 Minerva M. Yeung
- 👤 Wayne Wolf
- 👤 Bede Liu
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-25 13:24
CPC Classifications
H; H04; H04N; H04N17/00; H04N17/06; G; G06; G06F; G06F16/00; G06F16/70; G06F16/74; G06F16/745; G06F16/78; G06F16/783; G06F16/7847; G06F16/786; G06F16/7864; G11; G11B; G11B27/00; G11B27/10; G11B27/19; G11B27/28; H04N5/00; H04N5/14; H04N5/147; H04N5/44; H04N5/445
Claims Analysis
Total Claims: 21
Claim 1
Independent Claim
60 words
A method for browsing compressed video comprising the steps: building hierarchically a scene transition graph, wherein said graph building step includes the step of providing a graph layout including at least a main scene transition graph having a plurality of nodes representing scenes with the transition paths illustrated for a video sequence; and browsing through the resulting scene transition graph.
Claim 2
Independent Claim
60 words
A method for browsing compressed video comprising the steps: building hierarchically a scene transition graph, wherein said graph building step includes the step of providing a graph layout including at least a main scene transition graph having a plurality of nodes representing scenes with the transition paths illustrated for a video sequence; and browsing through the resulting scene transition graph.
Claim 3
Dependent Claim
36 words
The method of claim 1, wherein said graph building step further includes the step of providing a user in said browsing step the capability to selectively highlighting a particular node of said main scene transition graph.
Claim 4
Dependent Claim
26 words
The method of claim 2, wherein said graph building step further includes the step of providing a window showing the video shots representing the highlighted node.
Claim 5
Dependent Claim
32 words
The method of claim 3, wherein said graph building step further includes the step of providing a window showing the video shots of said main scene transition graph arranged in temporal order.
Claim 6
Dependent Claim
32 words
The method of claim 2, wherein said graph building step further includes the step of providing a window showing the video shots of said main scene transition graph arranged in temporal order.
Claim 7
Dependent Claim
46 words
The method of claim 1, wherein said graph building step further includes the step of reducing said plurality of nodes of said main scene transition graph to show nodes associated with complete scene changes with the transition paths illustrated to provide a top-level scene transition graph.
Claim 8
Dependent Claim
39 words
The method of claim 6, wherein said graph building step further includes the step of providing a user in said browsing step the capability to selectively highlight a particular one of said nodes of said top-level scene transition graph.
Claim 9
Dependent Claim
26 words
The method of claim 7, wherein said graph building step further includes the step of providing a window showing the video shots representing the highlighted node.
Claim 10
Dependent Claim
32 words
The method of claim 8, wherein said graph building step further includes the step of providing a window showing the video shots of said top-level scene transition graph arranged in temporal order.
Claim 11
Dependent Claim
32 words
The method of claim 7, wherein said graph building step further includes the step of providing a window showing the video shots of said top-level scene transition graph arranged in temporal order.
Claim 12
Dependent Claim
26 words
The method of claim 1, wherein said graph building step further includes the step of arranging the identified video shots of a sequence in temporal order.
Claim 13
Dependent Claim
50 words
The method of claim 1, wherein said step of building hierarchically a scene change transition graph, includes the steps of: extracting DC sequences from the compressed video; detecting scene changes between frames of the DC sequences; identifying video shots from said detected scene changes; and clustering the identified video shots.
Claim 14
Independent Claim
90 words
A method for extracting a hierarchical decomposition of a complex video selection for browsing, comprising the steps of: identifying video collecting key frames from said video shots for representing each video segment; classifying the collections of key frames according to gross visual information; and building a graphical representation of the video, the graphical representation being based upon the results of said classifying step and temporal information associated with each video shot, wherein said graphical representation building step includes the step of representing each category of video shot by a node.
Claim 15
Independent Claim
90 words
A method for extracting a hierarchical decomposition of a complex video selection for browsing, comprising the steps of: identifying video collecting key frames from said video shots for representing each video segment; classifying the collections of key frames according to gross visual information; and building a graphical representation of the video, the graphical representation being based upon the results of said classifying step and temporal information associated with each video shot, wherein said graphical representation building step includes the step of representing each category of video shot by a node.
Claim 16
Dependent Claim
29 words
The method of claim 13, wherein said graphical representation building step further includes the step of establishing each edge of said graphs for denoting a temporal relationship between categories.
Claim 17
Dependent Claim
24 words
The method of claim 13, further including the step of using said graphical representation for analyzing the underlying story structure of said video selection.
Claim 18
Dependent Claim
18 words
The method of claim 13, further including the step of compressing said video selection before said identifying step.
Claim 19
Dependent Claim
50 words
The method of claim 13, wherein said building step includes the steps of: grouping said video shots of said key frames into clusters denoted by measures of similarity; and allowing user interaction in said building step via hierarchial clustering of said video shots paired by similarity in said grouping step.
Claim 20
Dependent Claim
23 words
The method of claim 17, wherein said grouping step further includes grouping shots by their proximity values which are not grouped by similarity.
Claim 21
Dependent Claim
32 words
The method of claim 13, wherein said graphical representation is a directed graph, the graph being based upon the results of said classifying step and temporal information associated with each video shot.
References Cited (Backward Citations)
US5231487A
Cited
US5329596A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2001-01-12 | 2001-07-14 | 2002-01-13 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2005-01-12 | 2005-07-14 | 2006-01-13 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2009-01-12 | 2009-07-14 | 2010-01-13 | $7700.00 | Window Closed / Lapsed |