.png){kind=icon}
返回
Blind Deconvolution From Multiple Sparse Inputs
.png){kind=icon}
PRE
AI
DOI：10.1109/LSP.2016.2599104.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Blind deconvolution is an inverse problem when both the input signal and the convolution kernel are unknown. We propose a convex algorithm based on l(1)-minimization to solve the blind deconvolution problem, given multiple observations from sparse input signals. The proposed method is related to other problems such as blind calibration and finding sparse vectors in a subspace. Sufficient conditions for exact and stable recovery using the pro-posed method are developed that shed light on the sample com-plexity. Finally, numerical examples are provided to showcase the performance of the proposed method.
Keyword:
Blind calibration
blind deconvolution
convex programming
dictionary learning
sparsity
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
9.6
论文数:
1.1W
被引数:
1.7W
机构
引用论文
Ecosystem legacy of the introduced N2-fixing tree Robinia pseudoacacia in a coastal forest.png)
Oecologia
OecologiaIF0
PREAI
分享收藏Identification of a point mutation in factor XIII A subunit deficiency在凝血因子XIII A亚基缺乏症中发现了一个点突变。Blood
OAAI
BloodIF0
OAAI分享收藏分享收藏
查看更多内容