2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) 2012
DOI: 10.1109/icassp.2012.6288982
|View full text |Cite
|
Sign up to set email alerts
|

An integrated approach to feature compensation combining particle filters and hidden Markov models for robust speech recognition

Abstract: All praise and thank is for Almighty Allah, who is the All-Powerful and the Generous. I am extremely grateful to Dr. Chin-Hui Lee. He consented to be my PhD thesis advisor, and guided me while I was conducting research in the challenging area of speech recognition.He not only supervised me throughout my research work, but also helped me a lot in all aspects of my PhD degree.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
8
0

Year Published

2012
2012
2021
2021

Publication Types

Select...
4
3
1

Relationship

2
6

Authors

Journals

citations
Cited by 12 publications
(8 citation statements)
references
References 46 publications
0
8
0
Order By: Relevance
“…Context‐based prediction can be used to determine the probability of a value, as the frequency of its occurrence in a certain context and, thus, it has been successfully applied as statistical model in several computer science areas such as computational biology [29], web mining [30], ubiquitous computing [31], information retrieval [32], speech recognition [33] and even in computer architecture [34]. Similar to a Markov process, it consists of a set of N distinct states S = { S 1 , S 2 , …, S N } [35].…”
Section: Description Of the Proposed Context‐based Prediction Filtementioning
confidence: 99%
“…Context‐based prediction can be used to determine the probability of a value, as the frequency of its occurrence in a certain context and, thus, it has been successfully applied as statistical model in several computer science areas such as computational biology [29], web mining [30], ubiquitous computing [31], information retrieval [32], speech recognition [33] and even in computer architecture [34]. Similar to a Markov process, it consists of a set of N distinct states S = { S 1 , S 2 , …, S N } [35].…”
Section: Description Of the Proposed Context‐based Prediction Filtementioning
confidence: 99%
“…Being a Monte Carlo method, particle filters are versatile and can handle a broad category of dynamical systems as they are not constrained by linearity and Gaussianity requirements that inhibit Kalman Filter [11] and the extended Kalman Filter [12]. Particle filter compensation (PFC) [13] [14] algorithms compensate noisy speech features by directly tracking the clean speech features in the spectral domain. The recognition is performed on melfrequency cepstral coefficient (MFCC) features extracted from the newly estimated filter bank features.…”
Section: Introductionmentioning
confidence: 99%
“…We incorporate statistical information available in the acoustic models of clean speech, e.g., the HMMs trained with clean speech, as an alternative state transition model [10][11]. The similarity between HMMs and particles filters can be seen from the fact that an observation probability density function corresponding to each state of an HMM describes, in statistical terms, the characteristics of the source generating a signal of interest if the source is in that particular state, whereas in particle filters we try to estimate the probability distribution of the state the system is in when it generates the observed signal of interest.…”
Section: Speech and Noise Tracking For Noise Compensationmentioning
confidence: 99%