Anda belum login :: 18 Apr 2025 18:14 WIB
Home
|
Logon
Hidden
»
Administration
»
Collection Detail
Detail
Robust Speech Recognition Based on Joint Model and Feature Space Optimization of Hidden Markov Models
Oleh:
Moon, Seokyong
;
Hwang, Jenq-Neng
Jenis:
Article from Journal - ilmiah internasional
Dalam koleksi:
IEEE Transactions on Neural Networks vol. 8 no. 2 (1997)
,
page 194-204.
Topik:
recognition
;
robust
;
speech recognition
;
joint model. feature
;
space optimization
;
hidden markov models
Ketersediaan
Perpustakaan Pusat (Semanggi)
Nomor Panggil:
II36.2
Non-tandon:
1 (dapat dipinjam: 0)
Tandon:
tidak ada
Lihat Detail Induk
Isi artikel
The hidden Markov model (HMM) inversion algorithm, based on either the gradient search or the Baum - Welch reestimation of input speech features, is proposed and applied to the robust speech recognition tasks under general types of mismatch conditions. This algorithm stems from the gradient - based inversion algorithm of an artificial neural network (ANN) by viewing an HMM as a special type of ANN. Given input speech features s, the forward training of an HMM finds the model parameters ? subject to an optimization criterion. On the other hand, the inversion of an HMM finds speech features, s, subject to an optimization criterion with given model parameters ?. The gradient - based HMM inversion and the Baum - Welch HMM inversion algorithms can be successfully integrated with the model space optimization techniques, such as the robust MINIMAX technique, to compensate the mismatch in the joint model and feature space. The joint space mismatch compensation technique achieves better performance than the single space, i. e. either the model space or the feature space alone, mismatch compensation techniques. It is also demonstrated that approximately 10 - dB signal - to - noise ratio (SNR) gain is obtained in the low SNR environments when the joint model and feature space mismatch compensation technique is used.
Opini Anda
Klik untuk menuliskan opini Anda tentang koleksi ini!
Kembali
Process time: 0.03125 second(s)