Blind Recovery of Sparse Signals From Subsampled Convolution

DOI10.1109/TIT.2016.2636204zbMath1364.94261arXiv1511.06149OpenAlexW2963805962MaRDI QIDQ2989627

Yoram Bresler, Kiryung Lee, Yanjun Li, Marius Junge

Publication date: 8 June 2017

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

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

Mathematics Subject Classification ID

Sampling theory in information and communication theory (94A20)

Related Items

Robust recovery of low-rank matrices with non-orthogonal sparse decomposition from incomplete measurements ⋮ Robust sensing of low-rank matrices with non-orthogonal sparse decomposition ⋮ Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution ⋮ Fundamental limits of weak recovery with applications to phase retrieval ⋮ Convex and Nonconvex Optimization Are Both Minimax-Optimal for Noisy Blind Deconvolution Under Random Designs ⋮ Blind three dimensional deconvolution via convex optimization ⋮ Median-Truncated Gradient Descent: A Robust and Scalable Nonconvex Approach for Signal Estimation ⋮ Sparse power factorization: balancing peakiness and sample complexity ⋮ A geometric analysis of phase retrieval ⋮ Self-Calibration and Bilinear Inverse Problems via Linear Least Squares ⋮ Multi-target detection with application to cryo-electron microscopy ⋮ $$L^p$$ Continuity and Microlocal Properties for Pseudodifferential Operators ⋮ Spectral Methods for Passive Imaging: Nonasymptotic Performance and Robustness ⋮ Blind Deconvolution by a Steepest Descent Algorithm on a Quotient Manifold ⋮ Proof methods for robust low-rank matrix recovery ⋮ Solving phase retrieval with random initial guess is nearly as good as by spectral initialization

This page was built for publication: Blind Recovery of Sparse Signals From Subsampled Convolution