EP0283266A2
Expired / Lapsed
EP
⏱️ 0.0 years remaining
Pattern recognition system
Assignee: Toshiba Corp
•
Filing: 1988-03-16
•
Granted: —
•
Expires: 2008-03-16
Abstract
Abstract Multiple similarities between phoneme feature data extracted from a word input signal and reference pattern data read out from a reference pattern memory (3) are calculated by a similarity calculation section (2). The multiple similarities are converted by a conversion filter (4) into posterior probabilities using parameter sets which are read out from a filter parameter bank (5) in accordance with the obtained multiple similarities. The posterior probabilities are subjected to matching with data stored in word dictionary (7) by a word matching section (6), thus discriminating the input word.
Inventors
- 👤 Hideo C/O Patent Division Segawa
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-10-26 16:07
CPC Classifications
G; G10; G10L; G10L15/00; G06; G06F; G06F18/00; G06F18/20; G06F18/24; G06F18/241; G06F18/2413; G06F18/2415; G06F18/24155
Claims Analysis
Total Claims: 8
Claim 1
Independent Claim
197 words
A pattern recognition system characterized by comprising: a feature extraction section (1) for extracting feature data of an input pattern; a memory (3) storing a reference pattern of each category; a multiple similarity calculation section (2) for calculating multiple similarities between the feature data extracted by said feature extraction section and the reference patterns stored in said memory; and posterior probability conversion means for converting the multiple similarities obtained by said similarity calculation section into posterior probabilities, wherein said posterior probability conversion means (4) includes: a parameter table (5) storing parameter sets each composed of a plurality of paramenter pairs of α and β, said parameter α indicating a number of components which are not involved in a subspace spanned by a reference pattern, the parameter β indicating a variance in a direction of non-reference subspace, and both parameters α and β being estimated from multiple similarity values between a reference pattern and training data, for each category of learning patterns, and for every category of reference patterns; and means (4) for calculating the posterior probabilities based on the multiple similarities calculated by said multiple similarity calculation section and the parameter sets stored in said parameter table.
Claim 2
Dependent Claim
197 words
A pattern recognition system characterized by comprising: a feature extraction section (1) for extracting feature data of an input pattern; a memory (3) storing a reference pattern of each category; a multiple similarity calculation section (2) for calculating multiple similarities between the feature data extracted by said feature extraction section and the reference patterns stored in said memory; and posterior probability conversion means for converting the multiple similarities obtained by said similarity calculation section into posterior probabilities, wherein said posterior probability conversion means (4) includes: a parameter table (5) storing parameter sets each composed of a plurality of paramenter pairs of α and β, said parameter α indicating a number of components which are not involved in a subspace spanned by a reference pattern, the parameter β indicating a variance in a direction of non-reference subspace, and both parameters α and β being estimated from multiple similarity values between a reference pattern and training data, for each category of learning patterns, and for every category of reference patterns; and means (4) for calculating the posterior probabilities based on the multiple similarities calculated by said multiple similarity calculation section and the parameter sets stored in said parameter table.
Claim 3
Dependent Claim
26 words
A system according to claim 1, characterized in that said parameter table (5) comprises the parameter sets for only categories which tend to be erroneously recognized.
Claim 4
Dependent Claim
39 words
A system according to claim 1, characterized in that the input pattern is a word speech input signal pattern, and said feature extraction section (1) has means (2) for extracting data representing a phoneme feature of the input signal.
Claim 5
Dependent Claim
29 words
A system according to claim 3, characterized in that said feature extraction section (1) includes a filter bank (1a) for extracting a frequency spectrum of the speech input signal.
Claim 6
Dependent Claim
96 words
A system according to claim 1, characterized in that said posterior probability calculating means (4) has means (10) for fetching, from said parameter table (5), a plurality of parameter sets (αij, βij) (i = 1 to n, j = 1 to n) for each of a plurality of obtained multiple similarities Si (i = 1 to n), means for calculating, using the fetched parameter sets (αij, βij), a probability distribution: P(Si | Cj) (j = 1 to n) and means (10) for calculating posterior probabilities P(Ci | Si) based on the probability distribution P(Si | Cj).
Claim 7
Dependent Claim
99 words
A pattern recognition system characterized by comprising: means (1) for extracting feature data of an input pattern; means (2) for calculating multiple similarities Si (i = 1 to n) between reference patterns and the input pattern; means (4, 5) for obtaining predetermined parameter sets (α, β) in accordance with the resultant similarities Si; means (4, 10) for calculating a posterior probability represented by: where Ci is an input category, and P(Ci) and P(Cj) are respectively probabilities that the input category is categories Ci and Cj; and means (6, 7) for determining the input pattern using the resultant posterior probability.
Claim 8
Dependent Claim
99 words
A pattern recognition system characterized by comprising: means (1) for extracting feature data of an input pattern; means (2) for calculating multiple similarities Si (i = 1 to n) between reference patterns and the input pattern; means (4, 5) for obtaining predetermined parameter sets (α, β) in accordance with the resultant similarities Si; means (4, 10) for calculating a posterior probability represented by: where Ci is an input category, and P(Ci) and P(Cj) are respectively probabilities that the input category is categories Ci and Cj; and means (6, 7) for determining the input pattern using the resultant posterior probability.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.