1996
DOI: 10.1121/1.416480
|View full text |Cite
|
Sign up to set email alerts
|

Robust speech recognition using singular value decomposition based speech enhancement

Abstract: Speech recognition systems work reasonably well in laboratory conditions, but their performance deteriorates drastically when they are deployed in practical situations where the speech is corrupted by additive noise. One way to improve the performance of a speech recognition system in the presence of noise, is to enhance the speech prior to its recognition. Two singular value decomposition based techniques have been recently proposed for speech enhancement [5] [6]. In these techniques, singular value decomposi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2008
2008
2009
2009

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 5 publications
0
2
0
Order By: Relevance
“…The MWF [1] approximates the Wiener filter from a Krylov subspace. Contrary to [6], [7], the MWF does not require knowledge of the full covariance matrices, and it does not employ eigenvalue or singular value decomposition. The MWF tends to achieve nearly the Wiener performance using a reduced rank filter and has been successfully applied to numerous problems, specifically in Radar Detection [8]- [10] and communications [11]- [13].…”
Section: Introductionmentioning
confidence: 98%
See 1 more Smart Citation
“…The MWF [1] approximates the Wiener filter from a Krylov subspace. Contrary to [6], [7], the MWF does not require knowledge of the full covariance matrices, and it does not employ eigenvalue or singular value decomposition. The MWF tends to achieve nearly the Wiener performance using a reduced rank filter and has been successfully applied to numerous problems, specifically in Radar Detection [8]- [10] and communications [11]- [13].…”
Section: Introductionmentioning
confidence: 98%
“…The Wiener filter coupled with subspace reduction (see, e.g., [6], [7]), have performed surprisingly well in this problem. The MWF [1] approximates the Wiener filter from a Krylov subspace.…”
Section: Introductionmentioning
confidence: 99%