.png){kind=icon}
返回
A compression-based backward approach for the forward sparse modeling with application to speech coding
.png){kind=icon}
PRE
AI
DOI：10.1016/j.compeleceng.2017.05.005.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper concentrates on the development of an efficient and robust backward solution for the forward sparse greedy algorithms and applies this solution in the field of speech compression. All existing backward solutions are based on constraining more and more weights to zero while re-optimizing the remaining nonzero weights to compensate. Our approach is termed Backward Replacement (BRe) algorithm and its idea is to replace the k-sparse weights vector with a k-sparse symmetric matrix. The key result of this paper showed that, the replacement approach has demonstrated successfully the superiority over existing backward elimination algorithms in both enhancing the compression capabilities of the forward greedy algorithms, and reducing the time complexity. (C) 2017 Elsevier Ltd. All rights reserved.
Keyword:
Sparse representation
Forward greedy pursuit
Backward elimination
Backward replacement
Speech coding
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.9
论文数:
6.7K
被引数:
1.3W
机构
引用论文
THE RISK OF RECURRENT VENOUS THROMBOEMBOLSIM AND HEMORRHAGE IN THE POSTPARTUM PATIENT REQURING ANTICOAGULATION产后需要抗凝治疗的患者的静脉血栓栓塞复发和出血风险
.png){kind=icon}
PREAI
分享收藏
A micromachined efficient parametric array loudspeaker with a wide radiation frequency band具有宽辐射频带的微机械高效参量阵列扬声器
PREAI
分享收藏
查看更多内容