Method for training of subspace coded gaussian models

Details Method for training of subspace coded gaussian models Method for training of subspace coded gaussian models

2003-03-13

2009-08-04

Dorvil, Richemond (Department: 2626)

Data processing: speech signal processing, linguistics, language

Speech signal processing

Recognition

C704S245000

Reexamination Certificate

active

07571097

ABSTRACT:
A method for compressing multiple dimensional gaussian distributions with diagonal covariance matrixes includes clustering a plurality of gaussian distributions in a multiplicity of clusters for each dimension. Each cluster can be represented by a centroid having a mean and a variance. A total decrease in likelihood of a training dataset is minimized for the representation of the plurality of gaussian distributions.

REFERENCES:
patent: 5182773 (1993-01-01), Bahl et al.
patent: 5271088 (1993-12-01), Bahler
patent: 5793891 (1998-08-01), Takahashi et al.
patent: 5839105 (1998-11-01), Ostendorf et al.
patent: 5857169 (1999-01-01), Seide
patent: 5878388 (1999-03-01), Nishiguchi et al.
patent: 5960388 (1999-09-01), Nishiguchi et al.
patent: 6141641 (2000-10-01), Hwang et al.
patent: 6317712 (2001-11-01), Kao et al.
patent: 6526379 (2003-02-01), Rigazio et al.
patent: 6687336 (2004-02-01), Holeys
patent: 6931351 (2005-08-01), Verma et al.
patent: 7072795 (2006-07-01), Haft et al.
Kenneth Rose, “Deterministic Annealing for Clustering, Compression, Classification, Regression, and Related Optimization Problems”, IEEE, 1998.
Luca Rigazio, Brice Tsakam, Jean-Claude Junqua, “An Optimal Bhattacharyya Centroid Algorithm for Gaussian Clustering with Applications in Automatic Speech Recognition”, IEEE, 2000.
Pedro Moreno, Bhiksha Raj, Evandro Gouvea, Richard Stern, “Multivariate-Gaussian-Based Cepstral Normalization for Robust Speech Recognition”, IEEE 1995.
Foote et al., “A Model Distance Measure For Talker Clustering and Identification”, pp. 1-4, IEEE 1994.
Mak et al., “Stream Derivation and Clustering Scheme for Subspace Distribution Clustering Hidden Markov Model”, pp. 339-346, IEEE 1997.
Bocchieri et al., “Subspace Distribution Clustering Hidden Markov Model”, pp. 264-275, IEEE Transaction on Speech and Audio Processing, vol. 9, No. 3, Mar. 2001.
Boulis, “Clustering of Cepstrum Coefficients Using Pairwise Mutual Information”, Technical Report EE516, Electrical Engineering Dept. University of Washington, Seattle, 2002.
Axelrod et al., “Dimensional Reduction, Covariance Modeling, and Computational Complexity in ASR Systems”, ICASSP 2003.
Communication and European Search Report EP04006013.9, dated Oct. 18, 2004.
Enrico Bocchieri, et al. Subspace Distribution Clustering, Hidden Markov Model, IEEE Transactions on Speech and Audio Processing, vol. 9, No. 3, Mar. 2001.
Enrico Bocchieri, et al., State Tying of Triphone HMM's For The 1994 AT&T ATIS Recognizer, ESCA. EUROSPEECH '95 4thEuropean Conference on Speech Communication and Technology. Madrid, Sep. 1995. ISSN 1018-4074.
Satoshi Takahashi, et al.,Four-Level Tied-Structure For Efficient Representation of Acoustic Modeling, 1995 IEEE.
A. Kannan, et al., Maximum Likelihood Clustering of Gaussians for Speech Recognition, 1994 IEEE.
R. Haeb-Umbach, et al., Speech Recognition Algorithms For Voice Control Interfaces, Philips Journal of Research, vol. 49, No. 4, 1995.
Communication from the European Patent Office in counterpart foreign application No. 04006013.9 filed Mar. 12, 2004.
Official Search Report of the European Patent Office in counterpart foreign application No. 06025047.9 filed Mar. 12, 2004.

Affiliated with

Also associated with

Rating

Method for training of subspace coded gaussian models does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method for training of subspace coded gaussian models, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for training of subspace coded gaussian models will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4135904