.png){kind=icon}
.png){kind=icon}
Return
Blind Deconvolution From Multiple Sparse Inputs
.png){kind=icon}
PRE
AI
DOI：10.1109/LSP.2016.2599104.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Blind calibration
blind deconvolution
convex programming
dictionary learning
sparsity
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
9.6
Papers:
1.1W
Citations:
1.7W