Patent US7103225B2 successfully refreshed from Google Patents.
US7103225B2
Expired / Lapsed
US
⏱️ 0.0 years remaining
Clustering appearances of objects under varying illumination conditions
Assignee: Honda Motor Co Ltd
•
Filing: 2003-11-06
•
Granted: 2006-09-05
•
Expires: 2023-11-06
Abstract
Abstract Taking a set of unlabeled images of a collection of objects acquired under different imaging conditions, and decomposing the set into disjoint subsets corresponding to individual objects requires clustering. Appearance-based methods for clustering a set of images of 3-D objects acquired under varying illumination conditions can be based on the concept of illumination cones. A clustering problem is equivalent to finding convex polyhedral cones in the high-dimensional image space. To efficiently determine the conic structures hidden in the image data, the concept of conic affinity can be used which measures the likelihood of a pair of images belonging to the same underlying polyhedral cone. Other algorithms can be based on affinity measure based on image gradient comparisons operating directly on the image gradients by comparing the magnitudes and orientations of the image gradient.
Inventors
- 👤 Ming-Hsuan Yang
- 👤 Jeffrey Ho
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 12:48
CPC Classifications
G; G06; G06V; G06V40/00; G06V40/10; G06V40/16; G06V40/168; G06V40/169; G06F; G06F18/00; G06F18/20; G06F18/23; G06V10/00; G06V10/40; G06V10/60; G06V10/70; G06V10/762
Claims Analysis
Total Claims: 18
Claim 1
Independent Claim
184 words
In a set of digital images, each representing a subject having an identity and each digital image having a corresponding illumination condition, wherein a subset of the set of digital images representing a same corresponding subject are related by a mathematical representation of a structure in a multidimensional space, a computer based method for identity based clustering the digital images having various illumination conditions and representing a first subject having a first identity, the method comprising: composing a set of affinity measures for every pair of digital images in the set of digital images, each affinity measure representative of a relationship between the pair of digital images of the set of images with respect to the structure in the multidimensional space; and applying an identity-based clustering algorithm to the set of affinity measures to determine a first subset of the set of images representing the first subject, wherein the images of said first subset are related by the mathematical representation of the structure in the multidimensional space, and wherein the first identity is undetermined prior to said step of applying the identity-based clustering algorithm.
Claim 2
Dependent Claim
184 words
In a set of digital images, each representing a subject having an identity and each digital image having a corresponding illumination condition, wherein a subset of the set of digital images representing a same corresponding subject are related by a mathematical representation of a structure in a multidimensional space, a computer based method for identity based clustering the digital images having various illumination conditions and representing a first subject having a first identity, the method comprising: composing a set of affinity measures for every pair of digital images in the set of digital images, each affinity measure representative of a relationship between the pair of digital images of the set of images with respect to the structure in the multidimensional space; and applying an identity-based clustering algorithm to the set of affinity measures to determine a first subset of the set of images representing the first subject, wherein the images of said first subset are related by the mathematical representation of the structure in the multidimensional space, and wherein the first identity is undetermined prior to said step of applying the identity-based clustering algorithm.
Claim 3
Dependent Claim
36 words
The computer based method of claim 1 , further comprising the step of applying a K-subspace clustering to a result of the clustering algorithm to increase accuracy of the identification of the first subset of images.
Claim 4
Dependent Claim
17 words
The computer based method of claim 1 , wherein the clustering algorithm is a spectral clustering method.
Claim 5
Dependent Claim
20 words
The computer based method of claim 1 , wherein the structure in the multidimensional space is a convex polyhedral cone.
Claim 6
Dependent Claim
50 words
The computer based method of claim 4 , wherein the affinity measures are a set of non-negative coefficients of a linear least square approximation of each digital picture, each digital picture approximated as a summation of a linear combination of all other digital pictures in the set of digital pictures.
Claim 7
Dependent Claim
23 words
The computer based method of claim 5 , wherein the affinity measure is substantially zero for any two digital images representing different subjects.
Claim 8
Dependent Claim
20 words
The computer based method of claim 5 , wherein the set of affinity measures is represented by an affinity matrix.
Claim 9
Dependent Claim
54 words
The computer based method of claim 4 , wherein the affinity measures are a set of non-negative coefficients of a linear least square approximation of each digital picture, each digital picture approximated as a summation of a linear combination of a second subset of closest neighboring digital pictures in the set of digital pictures.
Claim 10
Dependent Claim
14 words
The computer based method of claim 1 , wherein the subjects are human faces.
Claim 11
Dependent Claim
12 words
The method of claim 1 , wherein each affinity measure is non-negative.
Claim 12
Dependent Claim
16 words
The method of claim 1 , wherein the identity-based clustering algorithm is based on subject identity.
Claim 13
Dependent Claim
185 words
In a set of digital images, each representing a subject having an identity and each digital image having a corresponding illumination condition, wherein a subset of the set of digital images representing a same corresponding subject are related by a mathematical representation of a structure in a multidimensional space, a computer system for identity based clustering the digital images having various illumination conditions and representing a first subject having a first identity, the system comprising: means for composing a set of affinity measures for every pair of digital images in the set of digital images, each affinity measure representative of a relationship between the pair of digital images of the set of images with respect to the structure in the multidimensional space; and means for applying an identity-based clustering algorithm to the set of affinity measures to determine a first subset of the set of images representing the first subject, wherein the images of said first subset are related by the mathematical representation of the structure in the multidimensional space, and wherein the first identity is undetermined prior to said applying the identity-based clustering algorithm.
Claim 14
Dependent Claim
185 words
In a set of digital images, each representing a subject having an identity and each digital image having a corresponding illumination condition, wherein a subset of the set of digital images representing a same corresponding subject are related by a mathematical representation of a structure in a multidimensional space, a computer system for identity based clustering the digital images having various illumination conditions and representing a first subject having a first identity, the system comprising: means for composing a set of affinity measures for every pair of digital images in the set of digital images, each affinity measure representative of a relationship between the pair of digital images of the set of images with respect to the structure in the multidimensional space; and means for applying an identity-based clustering algorithm to the set of affinity measures to determine a first subset of the set of images representing the first subject, wherein the images of said first subset are related by the mathematical representation of the structure in the multidimensional space, and wherein the first identity is undetermined prior to said applying the identity-based clustering algorithm.
Claim 15
Dependent Claim
13 words
The computer system of claim 12 , wherein each affinity measure is non-negative.
Claim 16
Dependent Claim
172 words
An image processing computer system for identifying images representing subjects comprising: an input module for receiving data representative of a set of digital images, each digital image representative of one subject having an identity; a memory device coupled to the input module for storing the data representative of the set of digital images; a processor coupled to the memory device for iteratively retrieving data representative of two images of the set of images, the processor configured to calculate a conic affinity measure between the two digital images, configured to compose an affinity matrix with the conic affinity measures of substantially all the digital images of the set of digital images, and configured to apply an identity-based clustering algorithm to the affinity matrix to determine a subset of digital images corresponding to a same subject having a first identity, wherein the images of said subset are related by a mathematical representation of a structure in a multidimensional space, and wherein the first identity is undetermined prior to said applying the identity-based clustering algorithm.
Claim 17
Dependent Claim
172 words
An image processing computer system for identifying images representing subjects comprising: an input module for receiving data representative of a set of digital images, each digital image representative of one subject having an identity; a memory device coupled to the input module for storing the data representative of the set of digital images; a processor coupled to the memory device for iteratively retrieving data representative of two images of the set of images, the processor configured to calculate a conic affinity measure between the two digital images, configured to compose an affinity matrix with the conic affinity measures of substantially all the digital images of the set of digital images, and configured to apply an identity-based clustering algorithm to the affinity matrix to determine a subset of digital images corresponding to a same subject having a first identity, wherein the images of said subset are related by a mathematical representation of a structure in a multidimensional space, and wherein the first identity is undetermined prior to said applying the identity-based clustering algorithm.
Claim 18
Dependent Claim
14 words
The computer system of claim 14 , wherein said conic affinity measure is non-negative.
References Cited (Backward Citations)
US20020097914A1
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2009-09-04 | 2010-03-06 | 2010-09-05 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2013-09-04 | 2014-03-06 | 2014-09-05 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2017-09-04 | 2018-03-06 | 2018-09-05 | $7700.00 | Window Closed / Lapsed |