Patent US4827522A successfully refreshed from Google Patents.
US4827522A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Pattern recognition apparatus for determining a reference pattern by K-L expansion utilizing a power method
Assignee: Toshiba Corp
•
Filing: 1986-09-25
•
Granted: 1989-05-02
•
Expires: 2006-09-25
Abstract
Abstract Disclosed is a pattern recognition and learning apparatus which compares an input pattern with a reference patterns to recognize a category of the input pattern, and learns a reference pattern from input patterns of a specific category. Learning of input patterns for obtaining a reference pattern is performed by means of Kathunen-Loeve expansion of a covariance matrix of input patterns using a power method.
Inventors
- 👤 Hiroshi Matsuura
- 👤 Shoichi Hirai
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 16:26
CPC Classifications
G; G10; G10L; G10L15/00; G10L15/06; G10L15/063
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
433 words
A method of obtaining a reference pattern from a plurality of input patterns of a specific category, comprising the steps of: a first step of obtaining a covariance matrix K of said plurality of input patterns of the specific category, said covariance matrix K having a elements in n columns and n rows; a second step of multiplying said covariance matrix K by a first vector ξ1 consisting of elements of a first column of said covariance matrix to obtain a second vector ξ2; a third step of obtaining a first maximum element of aboslute value ABS(B1) in said second vector ξ2; a fourth step of multiplying said covariance matrix by said second vector ξ2, obtained in said second step, to obtain a third vector ξ3; a fifth step of obtaining a second maximum element or absolute value ABS(B2) of said third vector ξ3; a sixth step of determining convergence of said second vector and said third vector obtained in said second and fourth steps, respectively, said convergence being determined by obtaining a first value and a second value from the first maximum element of absolute value ABS(B1) and from the second maximum element of absolute value ABS(B2) which are obtained in said third and fifth steps, respectively, and comparing the first value with the second value; a seventh step of repeatedly performing calculations in said second and fourth steps within a predetermined calculation time, if the convergence of said second vector and said third vector does not occur in said sixth step; an eighth step of storing said vector obtained in said fourth step as an eigen vector of a first axis and said maximum element in absolute value of said vector as an eigdn value of said first axis in a directionary memory, when the convergence is determined in said sixth step; a ninth step of obtaining a new covariance matrix K' adapted for obtaining eigen vectors and eigen values of axes subsequent to the first axis, by subtracting the eigen vector and eigen value of the first axis from said covariance matrix K; a tenth step of determining whether eigen vectors and eigen values for a predetermined number of axes have been obtained; and an eleventh step, a power method step, of sequentially obtaining eigen vectors and eigen values up to the predetermined number of axes by repeating steps corresponding to said second to tenth steps with respect to said new covariance matrix K', when it is determined in said tenth step that the eigen vectors and eigen values have not been obtained up to the predetermined number of axes.
Claim 2
Independent Claim
433 words
A method of obtaining a reference pattern from a plurality of input patterns of a specific category, comprising the steps of: a first step of obtaining a covariance matrix K of said plurality of input patterns of the specific category, said covariance matrix K having a elements in n columns and n rows; a second step of multiplying said covariance matrix K by a first vector ξ1 consisting of elements of a first column of said covariance matrix to obtain a second vector ξ2; a third step of obtaining a first maximum element of aboslute value ABS(B1) in said second vector ξ2; a fourth step of multiplying said covariance matrix by said second vector ξ2, obtained in said second step, to obtain a third vector ξ3; a fifth step of obtaining a second maximum element or absolute value ABS(B2) of said third vector ξ3; a sixth step of determining convergence of said second vector and said third vector obtained in said second and fourth steps, respectively, said convergence being determined by obtaining a first value and a second value from the first maximum element of absolute value ABS(B1) and from the second maximum element of absolute value ABS(B2) which are obtained in said third and fifth steps, respectively, and comparing the first value with the second value; a seventh step of repeatedly performing calculations in said second and fourth steps within a predetermined calculation time, if the convergence of said second vector and said third vector does not occur in said sixth step; an eighth step of storing said vector obtained in said fourth step as an eigen vector of a first axis and said maximum element in absolute value of said vector as an eigdn value of said first axis in a directionary memory, when the convergence is determined in said sixth step; a ninth step of obtaining a new covariance matrix K' adapted for obtaining eigen vectors and eigen values of axes subsequent to the first axis, by subtracting the eigen vector and eigen value of the first axis from said covariance matrix K; a tenth step of determining whether eigen vectors and eigen values for a predetermined number of axes have been obtained; and an eleventh step, a power method step, of sequentially obtaining eigen vectors and eigen values up to the predetermined number of axes by repeating steps corresponding to said second to tenth steps with respect to said new covariance matrix K', when it is determined in said tenth step that the eigen vectors and eigen values have not been obtained up to the predetermined number of axes.
Claim 3
Dependent Claim
56 words
A method according to claim 1, wherein said sixth step includes the steps of: comparing a difference between the second maximum element of absolute value ABS(B2) obtained in said fifth step and a maximum element of absolute value ABS(B0) of the second vector ξ2 prior to the calculation in said fourth step with a predetermined value.
Claim 4
Dependent Claim
61 words
A method according to claim 2, further comprising the steps of: obtaining a sum of absolute values of differences of respective elements in said second vector and said third vector obtained in said second and fourth steps; and comparing the sum of absolute value of differences of respective elements of said second vector and said third vector with a predetermined value.
Claim 5
Dependent Claim
33 words
A method according to claim 1, wherein said eighth step includes the step of: normalizing each element of the third vector obtained in said fourth step with the norm of the third vector.
Claim 6
Dependent Claim
48 words
A method according to claim 1, wherein said third and fifth steps include the step of: normalizing each element of the second vector and the third vector in accordance with the first maximum element of absolute value ABS(B1) and the second maximum element of absolute value ABS(B2), respectively.
Claim 7
Dependent Claim
51 words
A method according to claim 1, further comprising the steps of: a step of obtaining a new maximum element of absolute value of the new covariance matrix K', obtained in said ninth step; and normalizing each element of the new covariance matrix K', with the new maximum element of absolute value.
Claim 8
Dependent Claim
131 words
A reference pattern learning apparatus for obtaining a reference pattern from a plurality of input patterns of a specific category comprising: means for providing a covariance matrix K from said plurality of input patterns of the specific category; means responsive to said covariance matrix K for obtaining eighen values and eigen vectors of a predetermined number of axes in Karhunen-Loeve expansion of said covariance matrix K by repeatedly performing the following calculations given by V s+1=K Us U s+1=V s+1/b s+1 (s=0, 1, 2, . . . ) where U0 (s=0) represents a unit vector and b s+1 represents a maximum element in absolute value of said vector V s+1; and means for storing the eigen value and eigen vector of each axis obtained in the calculations in a dictionary memory.
Claim 9
Dependent Claim
131 words
A reference pattern learning apparatus for obtaining a reference pattern from a plurality of input patterns of a specific category comprising: means for providing a covariance matrix K from said plurality of input patterns of the specific category; means responsive to said covariance matrix K for obtaining eighen values and eigen vectors of a predetermined number of axes in Karhunen-Loeve expansion of said covariance matrix K by repeatedly performing the following calculations given by V s+1=K Us U s+1=V s+1/b s+1 (s=0, 1, 2, . . . ) where U0 (s=0) represents a unit vector and b s+1 represents a maximum element in absolute value of said vector V s+1; and means for storing the eigen value and eigen vector of each axis obtained in the calculations in a dictionary memory.
Claim 10
Dependent Claim
80 words
An apparatus according to claim 7, wherein: the calculations are performed by a first sum-of-products operation circuit and a second sum-of-products operation circuit, each operation circuit having first and seocnd inputs and calculating a sum-of-products of numerical data applied to said first and second inputs thereof, said second sum-of-products operation circuit being arranged on an output side of said first sum-of-products operation circuit; and an arithmetic logic unit being arranged on an output side of said second sum-of-products operation circuit.
Claim 11
Dependent Claim
91 words
A pattern recognition apparatus comprising: means for providing a plurality of input patterns; pattern recognizing means for recognizing the input patterns, using reference patterns stored in reference pattern memory means; and pattern learning means for learning the input patterns, to form the reference patterns form the input patterns; said pattern learning means including means for obtaining a covariance matrix of the input patterns, and means for performing a Karhunen-Loeve expansion of the covariance matrix, using a power method, to obtain a reference pattern corresponding to a category of the input patterns.
Claim 12
Dependent Claim
91 words
A pattern recognition apparatus comprising: means for providing a plurality of input patterns; pattern recognizing means for recognizing the input patterns, using reference patterns stored in reference pattern memory means; and pattern learning means for learning the input patterns, to form the reference patterns form the input patterns; said pattern learning means including means for obtaining a covariance matrix of the input patterns, and means for performing a Karhunen-Loeve expansion of the covariance matrix, using a power method, to obtain a reference pattern corresponding to a category of the input patterns.
References Cited (Backward Citations)
US4152772A
Cited
US3981443A
Cited
US4068311A
Cited
US4164023A
Cited
US4254399A
Cited
US4381418A
Cited
US4651289A
Cited
US4625287A
Cited
US4661913A
Cited
US4783802A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1992-05-01 | 1992-10-31 | 1993-05-02 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1996-05-01 | 1996-10-31 | 1997-05-02 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2000-05-01 | 2000-10-31 | 2001-05-02 | $7700.00 | Window Closed / Lapsed |