The stochastic weighted viterbi algorithm: a frame work to compensate additive noise and low-bit rate coding distortion

نویسندگان

  • Néstor Becerra Yoma
  • Ivan Brito
  • Carlos Molina
چکیده

A solution to the problem of speech recognition with signals corrupted by additive noise and distorted by low-bit rate coders is presented in this paper. The additive noise and the coding distortion are cancelled according to the following scheme: firstly, the pdf of the clean coded-decoced speech is estimated with an additive noise model; second, the pdf of the clean uncoded signal is also estimated with a coding distortion model; and finally, the HMM is compensated by using the expected value of the observation pdf in the context of the stochastic weighted Viterbi (SWV) algorithm. The approach leads to reductions as high as 50% or 60% in word error rate.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Uncertainty in Signal Estimation and Stochastic Weighted Viterbi Algorithm: A Unified Framework to Address Robustness in Speech Recognition and Speaker Verification

Robustness to noise and low-bit rate coding distortion is one of the main problems faced by automatic speech recognition (ASR) and speaker verification (SV) systems in real applications. Usually, ASR and SV models are trained with speech signals recorded in conditions that are different from testing environments. This mismatch between training and testing can lead to unacceptable error rates. N...

متن کامل

Low complexity near-optimal unit-selection algorithm for ultra low bit-rate speech coding based on n-best lattice and Viterbi search

We propose a low complexity unit-selection algorithm for ultra low bit-rate speech coding based on a first-stage N-best prequantization lattice and a second-stage run-length constrained Viterbi search to efficiently approximate the complete search space of the fully-optimal unit-selection algorithm recently proposed by us. By this, the proposed low complexity algorithm continues to be near-opti...

متن کامل

A Novel method of Reducing Additive Distortion in Steganography with Embedding Operation

–This paper proposes a new methodology for reducing additive distortion in steganography with embedding operation. In this paper it is planned to introduce a method that embed 2 bits information in a pixel and alter one bit from one bit plane but the message does not necessarily place in the least significant bit of pixel and second less significant bit plane and fourth less significant bit pla...

متن کامل

Error Control Coding Based on Support Vector Machine

A novel approach of decoding convolutional codes using a multi-class support vector machine is presented in this paper. Support vector machine is a recently developed and well recognized algorithm for constructing maximum margin classifiers. Unlike traditional adaptive learning approaches such as a multi-layer neural network, it is able to converge to a global optimum solution, hence achieving ...

متن کامل

Experimental Study on Performance Analysis of Viterbi Algorithm based on Hidden Markov Model considering Soft Decision Decoding

Convolutional code is relatively popular technique in decreasing the bit error rate (BER). The transmitted data under Additive white Gaussian noise (AWGN) channel can be successfully recovered at the receiver side by using Viterbi algorithm based on hidden Markov model (HMM) to decode and correct the data. Viterbi algorithm work by calculating the hamming distance, comparing the path metric, an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004