Geometry and Symmetry in Short-and-Sparse Deconvolution
From MaRDI portal
Publication:5027025
DOI10.1137/19M1237569zbMath1482.94030arXiv1901.00256MaRDI QIDQ5027025
No author found.
Publication date: 3 February 2022
Published in: SIAM Journal on Mathematics of Data Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1901.00256
Nonconvex programming, global optimization (90C26) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Complexity and performance of numerical algorithms (65Y20)
Related Items
Simultaneous Phase Retrieval and Blind Deconvolution via Convex Programming, Adaptive iterative hard thresholding for low-rank matrix recovery and rank-one measurements, Exact Recovery of Multichannel Sparse Blind Deconvolution via Gradient Descent
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A feasible method for optimization with orthogonality constraints
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Using negative curvature in solving nonlinear programs
- Least angle regression. (With discussion)
- Speech dereverberation
- Direct Blind Deconvolution
- Identifiability in Blind Deconvolution With Subspace or Sparsity Constraints
- Blind Deconvolution Using Convex Programming
- Complete Dictionary Recovery Over the Sphere II: Recovery by Riemannian Trust-Region Method
- Self-calibration and biconvex compressive sensing
- New criteria for blind deconvolution of nonminimum phase systems (channels)
- Removing camera shake from a single photograph
- Curvilinear path steplength algorithms for minimization which use directions of negative curvature
- A review of methods for spike sorting: the detection and classification of neural action potentials
- A new approach to variable selection in least squares problems
- Recovery of Sparse Translation-Invariant Signals With Continuous Basis Pursuit
- Structured Local Optima in Sparse Blind Deconvolution
- Optimal Injectivity Conditions for Bilinear Inverse Problems with Applications to Identifiability of Deconvolution Problems
- Blind Deconvolution Meets Blind Demixing: Algorithms and Performance Bounds
- Identifiability and Stability in Blind Deconvolution Under Minimal Assumptions
- Image Super-Resolution Via Sparse Representation
- Image Deblurring and Super-Resolution by Adaptive Sparse Domain Selection and Adaptive Regularization
