Internet Archive Scholar

An efficient approximation of the forward-backward algorithm to deal with packet loss, with applications to remote speech recognition

Bengt J. Borgstrom, Abeer Alwan
2008 Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (166.8 kB)
https://web.archive.org/web/20170808235622/http://www.seas.ucla.edu/spapl/paper/borgstrom_icassp_08.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL. The file type is application/pdf.

This paper proposes an efficient approximation of the forwardbackward (FB) algorithm, for the purpose of estimating missing features, based on downsampling statistical models. The paper discusses the role of Hidden Markov Models (HMMs) in the estimation process, and presents an approximation to the FB method by developing HMMs based on lower resolution quantizers, which are obtained through a tree-structure mapping of quantizer centroids. To illustrate the effectiveness of the proposed method,
more » ... e apply it to the problem of error concealment in remote speech recognition, using the Aurora-2 database. The FB approximation provides comparable word recognition accuracy results relative to the standard FB method, while reducing the computational load by a large factor (> 250 in this case).
doi:10.1109/icassp.2008.4518637 dblp:conf/icassp/BorgstromA08 fatcat:kqofq3smb5gdha3sixmquvcjza
Citation

Bengt J. Borgstrom, Abeer Alwan. "An efficient approximation of the forward-backward algorithm to deal with packet loss, with applications to remote speech recognition." Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing (2008) 4425-4428