Gaussian mixture Kalman predictive coding of line spectral frequencies

Authors:
Shaminda Subasingha;Manohar N. Murthi;Søren Vang Andersen
Affiliations:
Department of Electrical and Computer Engineering, University of Miami, Coral Gables, FL;Department of Electrical and Computer Engineering, University of Miami, Coral Gables, FL;Department of Electronic Systems, Aalborg University, Aalborg, Denmark
Venue:
IEEE Transactions on Audio, Speech, and Language Processing
Year:
2009

Citing 3
Cited 3

Speech LSF quantization with rate independent complexity, bit scalability and learning

ICASSP '01 Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02
High-Rate Optimized Recursive Vector Quantization Structures Using Hidden Markov Models

IEEE Transactions on Audio, Speech, and Language Processing
Low-complexity source coding using Gaussian mixture models, lattice vector quantization, and recursive coding with application to speech spectrum quantization

IEEE Transactions on Audio, Speech, and Language Processing

A Kalman filtering approach to GMM predictive coding of LSFS for packet loss conditions

DSP'09 Proceedings of the 16th international conference on Digital Signal Processing
Analysis of Wyner-Ziv quantizers for packet loss

Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
Adaptive long-term coding of LSF parameters trajectories for large-delay/very- to ultra-low bit-rate speech coding

EURASIP Journal on Audio, Speech, and Music Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Gaussian mixture model (GMM)-based predictive coding of line spectral frequencies (LSFs) has gained wide acceptance. In such coders, each mixture of a GMM can be interpreted as defining a linear predictive transform coder. In this paper, we use Kalman filtering principles to model each of these linear predictive transform coders to present GMM Kalman predictive coding. In particular, we show how suitable modeling of quantization noise leads to an adaptive a posteriori GMM that defines a signal-adaptive predictive coder that provides improved coding of LSFs in comparison with the baseline recursive GMM predictive coder. Moreover, we show how running the GMM Kalman predictive coders to convergence can be used to design a stationary GMM Kalman predictive coding system which again provides improved coding of LSFs but now with only a modest increase in run-time complexity over the baseline. In packet loss conditions, this stationary GMM Kalman predictive coder provides much better performance than the recursive GMM predictive coder, and in fact has comparable mean performance to a memoryless GMM coder. Finally, we illustrate how one can utilize Kalman filtering principles to design a postfilter which enhances decoded vectors from a recursive GMM predictive coder without any modifications to the encoding process.