Sciweavers

116 search results - page 12 / 24
» Minimum Message Length Hidden Markov Modelling
Sort
View
INTERSPEECH
2010
13 years 4 months ago
Efficient HMM-based estimation of missing features, with applications to packet loss concealment
In this paper, we present efficient HMM-based techniques for estimating missing features. By assuming speech features to be observations of hidden Markov processes, we derive a mi...
Bengt J. Borgström, Per Henrik Borgström...
TIT
2008
102views more  TIT 2008»
13 years 9 months ago
On Low-Complexity Maximum-Likelihood Decoding of Convolutional Codes
Abstract--This letter considers the average complexity of maximum-likelihood (ML) decoding of convolutional codes. ML decoding can be modeled as finding the most probable path take...
Jie Luo
IJFCS
2008
49views more  IJFCS 2008»
13 years 9 months ago
A Markovian Approach for the Analysis of the gene Structure
Hidden Markov models (HMMs) are effective tools to detect series of statistically homogeneous structures, but they are not well suited to analyse complex structures. Numerous meth...
Christelle Melo de Lima, Laurent Gueguen, Christia...
CSL
2007
Springer
13 years 9 months ago
Discriminative semi-parametric trajectory model for speech recognition
Hidden Markov Models (HMMs) are the most commonly used acoustic model for speech recognition. In HMMs, the probability of successive observations is assumed independent given the ...
K. C. Sim, M. J. F. Gales
ICPR
2000
IEEE
14 years 11 months ago
Unsupervised Selection and Estimation of Finite Mixture Models
We propose a new method for fitting mixture models that performs component selection and does not require external initialization. The novelty of our approach includes: a minimum ...
Anil K. Jain, Mário A. T. Figueiredo