Identifiability in Blind Deconvolution With Subspace or Sparsity Constraints

DOI10.1109/TIT.2016.2569578zbMath1359.94124arXiv1505.03399OpenAlexW2162615905MaRDI QIDQ2976728

Yanjun Li, Kiryung Lee, Yoram Bresler

Publication date: 28 April 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1505.03399

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (13)

Efficient Identification of Butterfly Sparse Matrix Factorizations ⋮ The numerics of phase retrieval ⋮ Optimal Injectivity Conditions for Bilinear Inverse Problems with Applications to Identifiability of Deconvolution Problems ⋮ Convex and Nonconvex Optimization Are Both Minimax-Optimal for Noisy Blind Deconvolution Under Random Designs ⋮ Blind three dimensional deconvolution via convex optimization ⋮ Riemannian thresholding methods for row-sparse and low-rank matrix recovery ⋮ Recent Theoretical Advances in Non-Convex Optimization ⋮ Multichannel blind deconvolution via maximum likelihood estimator: application in neural recordings ⋮ Exact Recovery of Multichannel Sparse Blind Deconvolution via Gradient Descent ⋮ Self-Calibration and Bilinear Inverse Problems via Linear Least Squares ⋮ Multi-target detection with application to cryo-electron microscopy ⋮ Spectral Methods for Passive Imaging: Nonasymptotic Performance and Robustness ⋮ Geometry and Symmetry in Short-and-Sparse Deconvolution

This page was built for publication: Identifiability in Blind Deconvolution With Subspace or Sparsity Constraints