Blind Deconvolution Using Convex Programming
From MaRDI portal
Publication:2986493
DOI10.1109/TIT.2013.2294644zbMath1360.94057arXiv1211.5608WikidataQ60123039 ScholiaQ60123039MaRDI QIDQ2986493
No author found.
Publication date: 16 May 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1211.5608
Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Related Items (57)
An optimal statistical and computational framework for generalized tensor estimation ⋮ Efficient Identification of Butterfly Sparse Matrix Factorizations ⋮ The numerics of phase retrieval ⋮ Simultaneous Phase Retrieval and Blind Deconvolution via Convex Programming ⋮ $L_1$-Norm Regularization for Short-and-Sparse Blind Deconvolution: Point Source Separability and Region Selection ⋮ Lifting for Blind Deconvolution in Random Mask Imaging: Identifiability and Convex Relaxation ⋮ Self-calibration and biconvex compressive sensing ⋮ Sparse Model Uncertainties in Compressed Sensing with Application to Convolutions and Sporadic Communication ⋮ Solving systems of phaseless equations via Kaczmarz methods: a proof of concept study ⋮ Unnamed Item ⋮ Low rank matrix recovery from rank one measurements ⋮ On the robustness of noise-blind low-rank recovery from rank-one measurements ⋮ Parametric PSF estimation based on recursive SURE for sparse deconvolution ⋮ Robust recovery of low-rank matrices with non-orthogonal sparse decomposition from incomplete measurements ⋮ Guarantees of Riemannian optimization for low rank matrix completion ⋮ Image completion and blind deconvolution: model and algorithm ⋮ Optimal Injectivity Conditions for Bilinear Inverse Problems with Applications to Identifiability of Deconvolution Problems ⋮ Neural network approximation of continuous functions in high dimensions with applications to inverse problems ⋮ Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution ⋮ Non-smooth non-convex Bregman minimization: unification and new algorithms ⋮ Convex and Nonconvex Optimization Are Both Minimax-Optimal for Noisy Blind Deconvolution Under Random Designs ⋮ Blind three dimensional deconvolution via convex optimization ⋮ Sparse blind deconvolution and demixing through \(\ell_{1,2}\)-minimization ⋮ Riemannian thresholding methods for row-sparse and low-rank matrix recovery ⋮ Near-optimal bounds for generalized orthogonal Procrustes problem via generalized power method ⋮ Approximate Global Minimizers to Pairwise Interaction Problems via Convex Relaxation ⋮ Identification of affinely parameterized state-space models with unknown inputs ⋮ Painless breakups -- efficient demixing of low rank matrices ⋮ Noisy Matrix Completion: Understanding Statistical Guarantees for Convex Relaxation via Nonconvex Optimization ⋮ Multichannel blind deconvolution via maximum likelihood estimator: application in neural recordings ⋮ Reconstruction Methods in THz Single-Pixel Imaging ⋮ Exact Recovery of Multichannel Sparse Blind Deconvolution via Gradient Descent ⋮ A convex variational model for learning convolutional image atoms from incomplete data ⋮ Sparse power factorization: balancing peakiness and sample complexity ⋮ Estimation from nonlinear observations via convex programming with application to bilinear regression ⋮ On recovery guarantees for one-bit compressed sensing on manifolds ⋮ Self-Calibration and Bilinear Inverse Problems via Linear Least Squares ⋮ Modeling and identification of uncertain-input systems ⋮ Multi-target detection with application to cryo-electron microscopy ⋮ Low-Rank Spectral Optimization via Gauge Duality ⋮ Sensor calibration for off-the-grid spectral estimation ⋮ Bridging convex and nonconvex optimization in robust PCA: noise, outliers and missing data ⋮ Guarantees of Riemannian Optimization for Low Rank Matrix Recovery ⋮ Structured random measurements in signal processing ⋮ Spectral Methods for Passive Imaging: Nonasymptotic Performance and Robustness ⋮ On Representer Theorems and Convex Regularization ⋮ Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence ⋮ Solving equations of random convex functions via anchored regression ⋮ Blind Deconvolution by a Steepest Descent Algorithm on a Quotient Manifold ⋮ A scalable estimator of sets of integral operators ⋮ BranchHull: convex bilinear inversion from the entrywise product of signals with known signs ⋮ Rapid, robust, and reliable blind deconvolution via nonconvex optimization ⋮ Plug in estimation in high dimensional linear inverse problems a rigorous analysis ⋮ Low-Rank Matrix Estimation from Rank-One Projections by Unlifted Convex Optimization ⋮ Proof methods for robust low-rank matrix recovery ⋮ Multilinear Compressive Sensing and an Application to Convolutional Linear Networks ⋮ Geometry and Symmetry in Short-and-Sparse Deconvolution
This page was built for publication: Blind Deconvolution Using Convex Programming
