US5289562A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Pattern representation model training apparatus
Assignee: Mitsubishi Electric Corp
•
Filing: 1991-03-21
•
Granted: 1994-02-22
•
Expires: 2011-03-21
Abstract
Abstract Disclosed is an Hidden Markov Model (HMM) training apparatus in which a capacity for discriminating between models is taken into consideration so as to allow a high level of recognition accuracy to be obtained. A probability of a vector sequence appearing from HMMs is computed with respect to an input vector and continuous mixture density HMMs. Through this computation, the nearest different-category HMM, with which the maximum probability is obtained and which belongs to a category different from that of a training vector sequence of a known category, is selected. The respective central vectors of continuous densities constituting the output probability densities of the same-category HMM belonging to the same category as that of the training vector sequence and the nearest different-category HMM are moved on the basis of the vector sequence.
Inventors
- 👤 Shinobu Mizuta
- 👤 Kunio Nakajima
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-04 05:01
CPC Classifications
G; G10; G10L; G10L15/00; G10L15/08; G10L15/14; G10L15/142; G10L15/144; G06; G06F; G06F18/00; G06F18/20; G06F18/29; G06F18/295
Claims Analysis
Total Claims: 26
Claim 1
Independent Claim
158 words
An apparatus for training a pattern representation model for classifying and discriminating an input acoustic feature vector sequence, comprised of at least one vector, into one of a plurality of categories, the model including a hidden Markov model for each category having output probability densities defined by a mixture of continuous densities and having a central vector representing the means of the continuous densities, the apparatus comprising: means for comparing a training acoustic feature vector sequence of a known category to the hidden Markov models to compute a probability for each of the categories; means for selecting the hidden Markov model, of a category other than the known category, which provided the maximum probability in response to the training acoustic feature vector sequence; and vector control means for moving, on the basis of the training acoustic feature vector sequence, the central vectors of the selected hidden Markov model and of the hidden Markov model of the known category.
Claim 2
Independent Claim
158 words
An apparatus for training a pattern representation model for classifying and discriminating an input acoustic feature vector sequence, comprised of at least one vector, into one of a plurality of categories, the model including a hidden Markov model for each category having output probability densities defined by a mixture of continuous densities and having a central vector representing the means of the continuous densities, the apparatus comprising: means for comparing a training acoustic feature vector sequence of a known category to the hidden Markov models to compute a probability for each of the categories; means for selecting the hidden Markov model, of a category other than the known category, which provided the maximum probability in response to the training acoustic feature vector sequence; and vector control means for moving, on the basis of the training acoustic feature vector sequence, the central vectors of the selected hidden Markov model and of the hidden Markov model of the known category.
Claim 3
Dependent Claim
124 words
The apparatus of claim 1, wherein the vector control means comprises: means for correlating the vectors constituting the training acoustic feature vector sequence with the plurality of output probability densities of the plurality of hidden Markov models; means for selecting, from among the continuous densities of the correlated output probability densities, the continuous density which maximizes a partial probability with respect to the vectors; and means for moving, on the basis of the vectors constituting the training acoustic feature vector sequence, the central vector of the selected continuous density in the direction of the vectors when the selected continuous density belongs to the known category and in the opposite direction when the selected continuous density belongs to a category other than the known category.
Claim 4
Dependent Claim
17 words
The apparatus of claim 2, wherein the means for correlating includes means for applying a Viterbi algorithm.
Claim 5
Dependent Claim
17 words
The apparatus of claim 1, wherein said means for comparing includes means for applying a Viterbi algorithm.
Claim 6
Dependent Claim
28 words
The apparatus of claim 1, further comprising means for repeatedly applying the training acoustic feature vector sequence so as to train parameters of the hidden Markov models sequentially.
Claim 7
Dependent Claim
58 words
The apparatus of claim 1, further comprising speech analysis means for analyzing speech to transform the speech into a time sequence of acoustic feature vectors, said speech analysis means being used to provide a training acoustic feature vector sequence to train the hidden Markov models of the pattern recognition model to be used as a speech recognition apparatus.
Claim 8
Independent Claim
161 words
An apparatus for training a pattern representation model for classifying a vector sequence of physical data into one of a plurality of categories, the model including a hidden Markov model for each category having output probability densities defined by a mixture of continuous densities and having a central vector representing the means of the continuous densities, the apparatus comprising: means for comparing a training vector sequence of a known category to continuous mixture density hidden Markov models to compute a probability for each of the categories; means operative in response to the means for comparing for selecting the hidden Markov model, of a category other than the known category, which provided the maximum probability in response to the training vector sequence; and means responsive to a selection by the means for selecting for moving, on the basis of the training vector sequence, the central vectors of the selected hidden Markov model and of the hidden Markov model of the known category.
Claim 9
Independent Claim
161 words
An apparatus for training a pattern representation model for classifying a vector sequence of physical data into one of a plurality of categories, the model including a hidden Markov model for each category having output probability densities defined by a mixture of continuous densities and having a central vector representing the means of the continuous densities, the apparatus comprising: means for comparing a training vector sequence of a known category to continuous mixture density hidden Markov models to compute a probability for each of the categories; means operative in response to the means for comparing for selecting the hidden Markov model, of a category other than the known category, which provided the maximum probability in response to the training vector sequence; and means responsive to a selection by the means for selecting for moving, on the basis of the training vector sequence, the central vectors of the selected hidden Markov model and of the hidden Markov model of the known category.
Claim 10
Dependent Claim
25 words
The apparatus of claim 7, wherein the vector sequence of physical data is an acoustic feature vector sequence obtained through analysis of an audio signal.
Claim 11
Dependent Claim
19 words
The apparatus of claim 7, wherein the vector sequence of physical data is a vector sequence of image data.
Claim 12
Independent Claim
117 words
A method for training a continuous density hidden Markov model representation of patterns of physical data, comprising the steps of: preparing a plurality of hidden Markov models, each hidden Markov model corresponding to a category and having a central vector indicative of the means of the continuous mixture density; computing a probability corresponding to an input pattern of a known category for each prepared hidden Markov model; selecting the category of the prepared hidden Markov model which has the maximum probability corresponding to the input pattern; moving, when the selected category is not the known category, the central vectors of the hidden Markov models of the known category and of the selected category prepared hidden Markov model.
Claim 13
Independent Claim
117 words
A method for training a continuous density hidden Markov model representation of patterns of physical data, comprising the steps of: preparing a plurality of hidden Markov models, each hidden Markov model corresponding to a category and having a central vector indicative of the means of the continuous mixture density; computing a probability corresponding to an input pattern of a known category for each prepared hidden Markov model; selecting the category of the prepared hidden Markov model which has the maximum probability corresponding to the input pattern; moving, when the selected category is not the known category, the central vectors of the hidden Markov models of the known category and of the selected category prepared hidden Markov model.
Claim 14
Dependent Claim
25 words
The method of claim 10, wherein the vector sequence of physical data is an acoustic feature vector sequence obtained through analysis of an audio signal.
Claim 15
Dependent Claim
19 words
The method of claim 10, wherein the vector sequence of physical data is a vector sequence of image data.
Claim 16
Independent Claim
192 words
An apparatus for training a pattern representation model comprised of a plurality of hidden Markov models with continuous mixture densities, each hidden Markov model representing a separate category of pattern of physical data and having a central vector indicative of the means of the continuous mixture density, the apparatus comprising: first means for comparing a training pattern of a known category to the plurality of hidden Markov models to obtain a probability for each hidden Markov model; means for selecting each hidden Markov model, of a category other than the known category, which provided in response to the training pattern a probability within a predetermined distance of the probability provided by the hidden Markov model of the known category; second means, operative in response to a selection by the means for selecting, for comparing the maximum probability provided by the selected hidden Markov model to the probability provided by the hidden Markov model of the known category; and means, operative in response to the comparison by the second means for comparing, for moving the central vectors of the hidden Markov model of the known category and of the selected hidden Markov model.
Claim 17
Independent Claim
192 words
An apparatus for training a pattern representation model comprised of a plurality of hidden Markov models with continuous mixture densities, each hidden Markov model representing a separate category of pattern of physical data and having a central vector indicative of the means of the continuous mixture density, the apparatus comprising: first means for comparing a training pattern of a known category to the plurality of hidden Markov models to obtain a probability for each hidden Markov model; means for selecting each hidden Markov model, of a category other than the known category, which provided in response to the training pattern a probability within a predetermined distance of the probability provided by the hidden Markov model of the known category; second means, operative in response to a selection by the means for selecting, for comparing the maximum probability provided by the selected hidden Markov model to the probability provided by the hidden Markov model of the known category; and means, operative in response to the comparison by the second means for comparing, for moving the central vectors of the hidden Markov model of the known category and of the selected hidden Markov model.
Claim 18
Independent Claim
149 words
An method for training a pattern representation model for classifying and discriminating an acoustic feature vector sequence into one of a plurality of categories, the model including a hidden Markov model for each category having output probability densities defined by a mixture of continuous densities and having a central vector representing the means of the continuous densities, the method comprising the steps of: comparing a training acoustic feature vector sequence of a known category to the continuous mixture density hidden Markov models of compute a probability for each of the categories; selecting the hidden Markov model, of a category other than the known category, which provided the maximum probability in response to the training acoustic feature vector sequence; and moving, on the basis of the training acoustic feature vector sequence, the central vectors of the selected hidden Markov model and of the hidden Markov model of the known category.
Claim 19
Independent Claim
149 words
An method for training a pattern representation model for classifying and discriminating an acoustic feature vector sequence into one of a plurality of categories, the model including a hidden Markov model for each category having output probability densities defined by a mixture of continuous densities and having a central vector representing the means of the continuous densities, the method comprising the steps of: comparing a training acoustic feature vector sequence of a known category to the continuous mixture density hidden Markov models of compute a probability for each of the categories; selecting the hidden Markov model, of a category other than the known category, which provided the maximum probability in response to the training acoustic feature vector sequence; and moving, on the basis of the training acoustic feature vector sequence, the central vectors of the selected hidden Markov model and of the hidden Markov model of the known category.
Claim 20
Dependent Claim
122 words
The method of claim 14, wherein the step of moving comprises the steps of: correlating the vectors constituting said training acoustic feature vector sequence with the plurality of output probability densities of the plurality of hidden Markov models; selecting, from among the continuous densities of the correlated output probability densities, the continuous density which maximizes a partial probability with respect to the vectors; and moving, on the basis of the vectors constituting the training input acoustic feature vector sequence, the central vector of the selected continuous density in the direction of the vectors when the selected continuous density belongs to the known category and in the opposite direction when the selected continuous density belongs to a category other than the known category.
Claim 21
Dependent Claim
18 words
The method of claim 15, wherein the step of correlating includes the step of applying a Viterbi algorithm.
Claim 22
Dependent Claim
18 words
The method of claim 14, wherein the step of comparing includes the step of applying a Viterbi algorithm.
Claim 23
Dependent Claim
29 words
The method of claim 14, further comprising the step of repeatedly applying the training acoustic feature vector sequence so as to train parameters of the hidden Markov models sequentially.
Claim 24
Dependent Claim
54 words
The method of claim 14, further comprising the step of analyzing speech to transform the speech into a time sequence of acoustic feature vectors, the step of analyzing providing a training acoustic feature vector sequence to train the hidden Markov models of the pattern recognition model to be used as a speech recognition apparatus.
Claim 25
Independent Claim
172 words
A method for training a pattern representation model comprised of a plurality of hidden Markov models with continuous mixture densities, each hidden Markov model representing a separate category of pattern of physical data and having a central vector indicative of the means of the continuous mixture density, the method comprising: (a) comparing a training pattern of a known category to the plurality of hidden Markov models to obtain a probability for each hidden Markov model; (b) selecting each hidden Markov model, of a category other than the known category, which provided in response to the training pattern a probability within a predetermined distance of the probability provided by the hidden Markov model of the known category; (c) comparing the maximum probability provided by the selected hidden Markov model to the probability provided by the hidden Markov model of the known category; and (d) moving the central vectors of the hidden Markov model of the known category and of the selected hidden Markov model on the basis of the step (c) of comparing.
Claim 26
Independent Claim
172 words
A method for training a pattern representation model comprised of a plurality of hidden Markov models with continuous mixture densities, each hidden Markov model representing a separate category of pattern of physical data and having a central vector indicative of the means of the continuous mixture density, the method comprising: (a) comparing a training pattern of a known category to the plurality of hidden Markov models to obtain a probability for each hidden Markov model; (b) selecting each hidden Markov model, of a category other than the known category, which provided in response to the training pattern a probability within a predetermined distance of the probability provided by the hidden Markov model of the known category; (c) comparing the maximum probability provided by the selected hidden Markov model to the probability provided by the hidden Markov model of the known category; and (d) moving the central vectors of the hidden Markov model of the known category and of the selected hidden Markov model on the basis of the step (c) of comparing.
References Cited (Backward Citations)
US4783804A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1997-02-21 | 1997-08-23 | 1998-02-22 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2001-02-21 | 2001-08-23 | 2002-02-22 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2005-02-21 | 2005-08-23 | 2006-02-22 | $7700.00 | Window Closed / Lapsed |