Patent US6222939B1 successfully refreshed from Google Patents.
US6222939B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Labeled bunch graphs for image analysis
Assignee: Google LLC
•
Filing: 1997-06-25
•
Granted: 2001-04-24
•
Expires: 2017-06-25
Abstract
Abstract A process for image analysis which includes selecting a number M of images, forming a model graph from each of the number of images, such that each model has a number N of nodes, assembling the model graphs into a gallery, and mapping the gallery of model graphs into an associated bunch graph by using average distance vectors Δ ij for the model graphs as edge vectors in the associated bunch graph. A number M of jets is associated with each node of the associated bunch graph, and at least one jet is labeled with an attribute characteristic of one of the number of images. An elastic graph matching procedure is performed wherein the graph similarity function is replaced by a bunch-similarity function.
Inventors
- 👤 Laurenz Wiskott
- 👤 Christoph von der Malsburg
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-10 02:07
CPC Classifications
G; G06; G06V; G06V40/00; G06V40/10; G06V40/16; G06V40/168; G06V40/171; G06V10/00; G06V10/40; G06V10/42; G06V10/422; G06V10/426; G06V10/44; G06V10/443; G06V10/449; G06V30/00; G06V30/10; G06V30/19; G06V30/196; G06V30/1983; G06V30/1988
Claims Analysis
Total Claims: 9
Claim 1
Independent Claim
103 words
A process for image analysis, comprising: selecting a number M of images; forming a model graph from each of the number of images, such that each model has a number N of nodes; assembling the model graphs into a gallery; and mapping the gallery of model graphs into an associated bunch graph by using average distance vectors Δ ij for the model graphs as edge vectors in the associated bunch graph, such that Δ ij = 1 M ∑ m Δ ij m where Δ ij m is a distance vector between nodes i and j in model graph m.
Claim 2
Dependent Claim
103 words
A process for image analysis, comprising: selecting a number M of images; forming a model graph from each of the number of images, such that each model has a number N of nodes; assembling the model graphs into a gallery; and mapping the gallery of model graphs into an associated bunch graph by using average distance vectors Δ ij for the model graphs as edge vectors in the associated bunch graph, such that Δ ij = 1 M ∑ m Δ ij m where Δ ij m is a distance vector between nodes i and j in model graph m.
Claim 3
Dependent Claim
41 words
The process of claim 1 , wherein a number M of jets is associated with each node of the associated bunch graph, and further comprising labeling at least one jet with an attribute characteristic of one of the number of images.
Claim 4
Dependent Claim
46 words
The process of claim 1 , wherein forming a model graph from each of the number of images comprises associating a standard grid of points over an image; correcting node positions to fall over designated sites characteristic of the image; and extracting jets at the nodes.
Claim 5
Dependent Claim
179 words
The process of claim 1 , further comprising selecting a target image extracting an image graph from the target image; comparing the target image graph to the gallery of model graphs to obtain a graph similarity function S such that S ( G M , G I ) = 1 N ∑ n S ( J n M , J n I ) - λ E ∑ e ( Δ x → e M - Δ x → e I ) 2 ; where G M is a model graph of the gallery of model graphs G I is the image graph of the target image, n is the number of jet coefficients. J n M are the jets of the model graph, J n I are the jets of the image graph, Δ{overscore (x)} e M are distance vectors in the model graph, Δ{overscore (x)} e I are distance vectors in the image graph, and identifying a model graph having a greatest graph similarity with the image graph.
Claim 6
Dependent Claim
58 words
The process of claim 4 , further comprising performing an elastic graph matching procedure, wherein the graph similarity function is replaced by a bunch-similarity function S such that S ( G , G I ) = 1 N ∑ n max m S ( J n m , J n I ) .
Claim 7
Dependent Claim
46 words
The process of claim 1 , wherein a number M of jets is associated with each node of the associated bunch graph, and jets that are attached to an associated node in the model graphs encode a similar qualitative region of objects in the model graphs.
Claim 8
Dependent Claim
23 words
The process of claim 6 , wherein objects in the model graphs include human faces and the nodes are associated with facial features.
Claim 9
Dependent Claim
19 words
The process of claim 7 , wherein the nodes are associated with facial features including eyes, nose, and mouth.
References Cited (Backward Citations)
US4805224A
Cited
US4725824A
Cited
US4827413A
Cited
US5168529A
Cited
US5432712A
Cited
US5187574A
Cited
US5220441A
Cited
US5533177A
Cited
US5680487A
Cited
US5333165A
Cited
US5625717A
Cited
US5430809A
Cited
US5383013A
Cited
US5511153A
Cited
DE4406020C1
Cited
US5719954A
Cited
US5736982A
Cited
US5699449A
Cited
US5714997A
Cited
US5588033A
Cited
US5715325A
Cited
US5774591A
Cited
US5809171A
Cited
US5764803A
Cited
US5828769A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2004-04-23 | 2004-10-23 | 2005-04-24 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2008-04-23 | 2008-10-23 | 2009-04-24 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2012-04-23 | 2012-10-23 | 2013-04-24 | $7700.00 | Window Closed / Lapsed |