US6205247B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and arrangement for pattern recognition on the basis of statistics
Assignee: Siemens AG
•
Filing: 1997-05-23
•
Granted: 2001-03-20
•
Expires: 2017-05-23
Abstract
Abstract A method and an arrangement are presented for pattern recognition on the basis of statistics. According to the method, for an object to be recognized on the basis of a complete set of two-class or multiclass classifiers, the association with each target class of the class set is estimated with a numerical value that is produced by cascaded use of polynomial classifiers. According to the invention, on a learning sample in which all class patterns to be recognized are sufficiently represented, there is a selection, from all the two-class or multiclass classifiers by way of their estimation vector spectrum, of those two-class or multiclass classifiers with estimations contributing the most to minimize a scalar quantity calculated over the estimation vector spectrum and having high separating relevance. The selected two-class or multiclass classifiers are subsequently used to form, via an expanded learning sample, estimation vectors from which expanded characteristic vectors are produced by polynomial linking. An evaluation classifier is formed on the basis of said characteristic vectors for estimating all target classes.
Inventors
- 👤 Thomas Breuer
- 👤 Wilfried Hanisch
- 👤 Jürgen Franke
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-04 05:20
CPC Classifications
G; G06; G06F; G06F18/00; G06F18/20; G06F18/24; G06F18/243; G06F18/24317; G06F18/245; G06F18/2453
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
157 words
A method of pattern recognition on the basis of statistics, which, for an object to be recognized, estimates an association of each target class of a class set with a numerical value on the basis of a complete ensemble of two- or multi-class classifiers, the numerical value resulting from cascaded application of polynomial classifiers, comprising the steps of: selecting the two- or multi-class classifiers whose estimates contribute the most, with high separation relevance, to minimizing a scalar measure calculated over an estimation-vector spectrum, from all two- or multi-class classifiers, over their estimation-vector spectrum on a learning sample in which all class patterns to be recognized are represented sufficiently; using the selected two- or multi-class classifiers to form estimate vectors over an expanded learning sample; using said estimate vectors to generate feature vectors that have been expanded through polynomial linking; and on the basis of said feature vectors, calculating an assessment classifier for estimating onto all target classes.
Claim 2
Independent Claim
157 words
A method of pattern recognition on the basis of statistics, which, for an object to be recognized, estimates an association of each target class of a class set with a numerical value on the basis of a complete ensemble of two- or multi-class classifiers, the numerical value resulting from cascaded application of polynomial classifiers, comprising the steps of: selecting the two- or multi-class classifiers whose estimates contribute the most, with high separation relevance, to minimizing a scalar measure calculated over an estimation-vector spectrum, from all two- or multi-class classifiers, over their estimation-vector spectrum on a learning sample in which all class patterns to be recognized are represented sufficiently; using the selected two- or multi-class classifiers to form estimate vectors over an expanded learning sample; using said estimate vectors to generate feature vectors that have been expanded through polynomial linking; and on the basis of said feature vectors, calculating an assessment classifier for estimating onto all target classes.
Claim 3
Dependent Claim
30 words
The method according to claim 1 , wherein said step of selecting includes the step of using a sum of error squares in a discrimination space as said scalar measure.
Claim 4
Dependent Claim
47 words
The method according to claim 1 , wherein said step of selecting includes the step of using entropy in a distribution space as said scalar measure, wherein frequency of appearance of each feature state of the two- or multi-class classifier estimates is determined over all feature states.
Claim 5
Dependent Claim
56 words
The method according to claim 1 , further comprising the steps of: dividing a large target-class quantity into a plurality of target-class quantities, for which said selecting of the two- or multi-class classifiers is performed, and wherein, from this, the assessment classifier is generated; and determining a resulting total estimate from results of the assessment classifiers.
Claim 6
Dependent Claim
43 words
The method according to claim 4 , wherein said determining step includes the step of forming a Cartesian-expanded product vector from result vectors of the assessment classifiers, from which Cartesian-expanded product vector a quadratic assessment classifier that determines the total estimate is formed.
Claim 7
Dependent Claim
96 words
The pattern-recognition method according to claim 4 , wherein said determining step includes the steps of forming a Cartesian-expanded product vector from result vectors of the assessment classifiers; transferring said Cartesian-expanded product vector into a transformed vector by means of a subspace transformation using a transformation matrix having a corresponding eigenvalue distribution; adapting a quadratic classifier using only the most critical components of said transformed vector, which components correspond to the eigenvalue distribution of the transformation matrix; and using the adapted quadratic classifier, mapping the transformed and reduced vector onto target classes for an estimated value.
Claim 8
Dependent Claim
129 words
The method according to claim 4 , further comprising the step of, prior to activation of the step of selecting the two- or multi-class classifiers, a meta-class classifier that is trained over groups of class quantities generates estimates over the groups, which contain characters; and wherein: said step of selecting includes the step of activating the two- or multi-class classifiers for the characters of the groups whose estimated values lie above an established threshold; and said determining step includes the step of linking the group estimates to the estimates of the respectively-associated character-assessment classifiers for the character classes contained in the respective group according to a unified rule such that the sum over all character estimates linked in this manner yields a number that can be normalized to 1.
Claim 9
Dependent Claim
208 words
An arrangement for pattern recognition on the basis of statistics, which, for an object to be recognized, estimates an association of each target class of a class set with a numerical value on the basis of a complete ensemble of two- or multi-class classifiers, the numerical value resulting from cascaded application of polynomial classifiers, comprising: means for statistically-optimized selection of the two- or multi-class classifiers whose estimates contribute the most, with high separation relevance, to minimizing a scalar measure calculated over an estimation-vector spectrum, from a complete ensemble of all two- or multi-class classifiers based on their estimation-vector spectrum over a learning sample in which all class patterns to be recognized are represented to a sufficient extent; means for generating polynomial-expanded feature vectors that represent the order of the system of selected two- or multi-class classifiers, said polynomial-expanded feature vectors being formed over an expanded learning sample, said expanding carried out by means of polynomial linking; and means for calculating an assessment classifier that uses the feature vectors of the system of selected two- or multi-class classifiers to calculate an estimation vector that, for each target class, contains a numerical value as an approximated conclusion probability regarding the association of a classified pattern with said class of patterns.
Claim 10
Dependent Claim
208 words
An arrangement for pattern recognition on the basis of statistics, which, for an object to be recognized, estimates an association of each target class of a class set with a numerical value on the basis of a complete ensemble of two- or multi-class classifiers, the numerical value resulting from cascaded application of polynomial classifiers, comprising: means for statistically-optimized selection of the two- or multi-class classifiers whose estimates contribute the most, with high separation relevance, to minimizing a scalar measure calculated over an estimation-vector spectrum, from a complete ensemble of all two- or multi-class classifiers based on their estimation-vector spectrum over a learning sample in which all class patterns to be recognized are represented to a sufficient extent; means for generating polynomial-expanded feature vectors that represent the order of the system of selected two- or multi-class classifiers, said polynomial-expanded feature vectors being formed over an expanded learning sample, said expanding carried out by means of polynomial linking; and means for calculating an assessment classifier that uses the feature vectors of the system of selected two- or multi-class classifiers to calculate an estimation vector that, for each target class, contains a numerical value as an approximated conclusion probability regarding the association of a classified pattern with said class of patterns.
Claim 11
Independent Claim
127 words
A method of pattern recognition for estimating input characters using probabilities of their memberships in n character classes, comprising the steps of: performing an optimal selection procedure, the optimal selection procedure determining from a given system of N statistically non-independent classifiers a set of K classifiers that contribute the most to minimizing a scalar classification measure for all comparable subsystems of fixed dimension K, where K<N; adjusting K such that a linear K-dimensional output vector of the subsystem can be polynomially extended to at least quadratic terms below a predetermined magnitude of terms; and constructing an optimal assessment classifier that uses the polynomially-extended output vector of the optimal subsystem as its input and maps it to a final probability vector for the n classes as its output.
Claim 12
Independent Claim
127 words
A method of pattern recognition for estimating input characters using probabilities of their memberships in n character classes, comprising the steps of: performing an optimal selection procedure, the optimal selection procedure determining from a given system of N statistically non-independent classifiers a set of K classifiers that contribute the most to minimizing a scalar classification measure for all comparable subsystems of fixed dimension K, where K<N; adjusting K such that a linear K-dimensional output vector of the subsystem can be polynomially extended to at least quadratic terms below a predetermined magnitude of terms; and constructing an optimal assessment classifier that uses the polynomially-extended output vector of the optimal subsystem as its input and maps it to a final probability vector for the n classes as its output.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2004-03-19 | 2004-09-18 | 2005-03-20 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2008-03-19 | 2008-09-18 | 2009-03-20 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2012-03-19 | 2012-09-18 | 2013-03-20 | $7700.00 | Window Closed / Lapsed |