Efficient backward recursion for computing posterior...

Data processing: measuring – calibrating – or testing – Measurement system – Statistical measurement

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C702S179000, C702S180000, C702S181000, C702S182000, C714S794000

Reexamination Certificate

active

07062407

ABSTRACT:
A method and apparatus are provided that reduce the amount of memory needed to perform forward-backward recursion to identify posterior probabilities. Under the invention, a forward recursion is performed to identify forward recursion scores. The forward recursion scores are then used directly in a backward recursion to determine posterior probabilities for each state in a set of time frames. The usefulness of this invention is especially high when there is a large number of discrete states, such as when there are more than one set of discrete states in the model.

REFERENCES:
patent: 5721746 (1998-02-01), Hladik et al.
patent: 6128765 (2000-10-01), Ross et al.
patent: 6145114 (2000-11-01), Crozier et al.
patent: 6813743 (2004-11-01), Eidson
D. Broad and F. Clermont, Formant Estimation by Linear Transformation of the LPC Cepstrum,J. Acout. Soc. Am., vol. 86, 1989, pp. 2013-2017.
L. Deng and D. Geisler, “A Composite Auditory Model for Processing Speech Sounds,”J. Acoust. Soc. Am., vol. 82, Dec. 1987, pp. 2001-2012.
H. Hermansky and D. Braod, “The Effective Second Formant F2 and the Vocal Tract Front-Cavity,”Proc. ICASSP, vol. 1, 1989, pp. 480-483.
D. Klatt, “Software for a Cascade/Parallel Formant Synthesizer,”J. Acoust. Soc. Am., vol. 67, 1980, pp. 971-995.
S. McCandless, “An Algorithm for Automatic Formant Extraction Using Linear Prediction Spectra,”IEEE Trans. Acoust. Speech and Signal Proc., vol. 22, 1974, pp. 135-141.
C.S. Huang and H.C. Wang, “Bandwidth-Adjusted LPC Analysis for Robust Speech Recognition,;”Pattern Recognition Letters, vol. 24, 2003 pp. 1583-1587.
A.P. Dempster, N.M. Laird, and D.B. Rubin, “Maximum Likelihood from Incomplete Data Via the EM Algorithm,”J. Royal Statistical Society, vol. 39, No. 1, pp. 1-38, 1997.
J. Holmes, W. Holmes, and P. Garner, Using Format Frequencies in Speech Recognition,: inProc. Eurospeech, Rhodes, Greece, Sep., 1997, pp. 2083-2086.
Seide, F. et al., “Coarticulation Modeling by Embedding a Target-Directed Hidden Trajectory Model into HMM -Map Decoding and Evaluation,”Proc. ICASSP, 2003, pp. 748-751.
L. Deng, et al., “Spontaneous Speech Recognition Using a Statistical Coarticulatory Model for the Vocal-Tract-Dynamics,”J. Acoust. Soc. Am., vol. 108, 2000, pp. 3036-3048.
Sun, J. et al., “Data-Driven Model Construction for Continuos Speech Recognition Using Overlapping Articulatory Features,”Proc. ICSLP, 2000, vol. 1, pp. 437-440.
S. Dusan et al., “Recovering Vocal Tract Shapes From MFCC Parameters,”Proc. ICSLP, 1998, pp. 3087-3090.
L. Deng, et al., “Tracking Vocal Tract Resonance Using an Analytical Nonlinear Predictor and a Target-Guided Temporal Constraint,”Proc. Eurospeech, 2003, vol. I, pp. 73-76.
A. Acero, “Formant Analysis and Synthesis Using Hidden Markov Models,” inProc. Eurospeech, Budapest, Sep. 1999.
Bazzi, I. et al., “An Expectation Maximization Approach for Formant Tracking Using a Parameter-Free Non-Linear Predictor,”Proc. ICASSP, Hong Kong, Apr. 2003.
Bruce, I. et al., “Robust Formant Tracking in Noise,”Proc. ICASSP, Orlando, FL, 2002, pp. 281-284.
Deng, Li et al., Speech Processing—A Dynamic and Optimization-Oriented Approach, chapters 7 and 10, Marcel Dekker Inc., New York, NY, 2003.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Efficient backward recursion for computing posterior... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Efficient backward recursion for computing posterior..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient backward recursion for computing posterior... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3642571

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.