.png){kind=icon}
返回
Generalized sparse covariance-based estimation
.png){kind=icon}
OA
AI
DOI：10.1016/j.sigpro.2017.09.010.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this work, we generalize the recent sparse iterative covariance-based estimator (SPICE) by extending the problem formulation to allow for different norm constraints on the signal and noise parameters in the covariance model. The resulting extended SPICE algorithm offers the same benefits as the regular SPICE algorithm, including being hyper-parameter free, but the choice of norms allows further control of the sparsity in the resulting solution. We also show that the proposed extension is equivalent to solving a penalized regression problem, providing further insight into the differences between the extended and original SPICE formulations. The performance of the method is evaluated for different choices of norms, indicating the preferable performance of the extended formulation as compared to the original SPICE algorithm. Finally, we introduce two implementations of the proposed algorithm, one gridless formulating for the sinusoidal case, resulting in a semi-definite programming problem, and one grid-based, for which an efficient implementation is given. (C) 2017 Elsevier B.V. All rights reserved.
Keyword:
Covariance fitting
Sparse reconstruction
Convex optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
10.0K
被引数:
1.7W
机构
引用论文
分享收藏
分享收藏High resolution sparse estimation of exponentially decaying N-dimensional signals.png)
SIGNAL PROCESSING
SIGNAL PROCESSINGIF3.6
PREAI
分享收藏
查看更多内容