arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2003.02927eess.SP
收藏

压缩感知语音恢复的最大可行子系统算法

Maximum Feasible Subsystem Algorithms for Recovery of Compressively Sensed Speech

Fereshteh Fakhar Firouzeh, John W. Chinneck, Sreeraman Rajan

摘要:

信号压缩的目标是减小输入信号的大小,而不显著损失恢复信号的质量。实现该目标的单向式是应用压缩感知的原理,但是这对于诸如语音之类的不够稀疏的真实世界的信号并不是特别成功。我们提出了三种新的算法的基础上解决方案的最大可行子系统问题(MAX FS),提高了最先进的压缩语音信号的恢复:更高度压缩的信号可以成功地恢复更高的质量。与使用传统的压缩感知恢复算法获得的解相比,新的恢复算法提供更稀疏的解。当通过恢复TIMIT语音数据库中的压缩感知语音信号进行测试时,恢复的语音具有比使用传统的压缩感知恢复算法恢复的语音更好的感知质量。

英文摘要:

The goal in signal compression is to reduce the size of the input signal without a significant loss in the quality of the recovered signal. One way to achieve this goal is to apply the principles of compressive sensing, but this has not been particularly successful for real-world signals that are insufficiently sparse, such as speech. We present three new algorithms based on solutions for the maximum feasible subsystem problem (MAX FS) that improve on the state of the art in recovery of compressed speech signals: more highly compressed signals can be successfully recovered with greater quality. The new recovery algorithms deliver sparser solutions when compared with those obtained using traditional compressive sensing recovery algorithms. When tested by recovering compressively sensed speech signals in the TIMIT speech database, the recovered speech has better perceptual quality than speech recovered using traditional compressive sensing recovery algorithms.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑