Point source super-resolution via non-convex \(L_1\) based methods

DOI10.1007/s10915-016-0169-xzbMath1354.65125OpenAlexW2471604734MaRDI QIDQ333212

Penghang Yin, Yifei Lou, Jack X. Xin

Publication date: 28 October 2016

Published in: Journal of Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10915-016-0169-x

zbMATH Keywords

regularizationnumerical experimentnumerical testsuper-resolution\(\ell_1\) minimizationminimum separation factornon-convex \(\ell_1\) based minimizationRayleigh lengthreconstruction of sparse signals

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical methods for trigonometric approximation and interpolation (65T40) Numerical solution to inverse problems in abstract spaces (65J22)

Related Items

A General Framework of Rotational Sparse Approximation in Uncertainty Quantification, Minimizing L ₁ over L ₂ norms on the gradient, Image Segmentation via Fischer-Burmeister Total Variation and Thresholding, Super-resolution wavelets for recovery of arbitrarily close point-masses with arbitrarily small coefficients, A novel regularization based on the error function for sparse recovery, Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity, A novel robust fractional-time anisotropic diffusion for multi-frame image super-resolution, Accelerated sparse recovery via gradient descent with nonlinear conjugate gradient momentum, Sorted \(L_1/L_2\) minimization for sparse signal recovery, A generalized non-convex method for robust tensor completion, Fast L1-L2 minimization via a proximal operator, DC programming and DCA: thirty years of developments, Minimization of transformed \(L_1\) penalty: theory, difference of convex function algorithm, and robust application in compressed sensing, Consistency bounds and support recovery of d-stationary solutions of sparse sample average approximations, Alternating direction method of multipliers with difference of convex functions, Low-rank factorization for rank minimization with nonconvex regularizers, A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems, An image sharpening operator combined with framelet for image deblurring, ℓ ₁ − αℓ ₂ minimization methods for signal and image reconstruction with impulsive noise removal, Truncated $l_{1-2}$ Models for Sparse Recovery and Rank Minimization, New Restricted Isometry Property Analysis for $\ell_1-\ell_2$ Minimization Methods, Limited-Angle CT Reconstruction via the $L_1/L_2$ Minimization, A Weighted Difference of Anisotropic and Isotropic Total Variation for Relaxed Mumford--Shah Color and Multiphase Image Segmentation, The Dantzig selector: recovery of signal via ℓ ₁ − αℓ ₂ minimization

Uses Software

• BLOOMP

Cites Work

• Unnamed Item
• Exact reconstruction using Beurling minimal extrapolation
• Optimal computational and statistical rates of convergence for sparse nonconvex learning problems
• Super-resolution from noisy data
• Computing sparse representation in a highly coherent dictionary based on difference of \(L_1\) and \(L_2\)
• Image super-resolution by TV-regularization and Bregman iteration
• Exact support recovery for sparse spikes deconvolution
• A bilinear formulation for vector sparsity optimization
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• A theory of super-resolution from short-time Fourier transform measurements
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• Spike detection from inaccurate samplings
• Super-Resolution of Positive Sources: The Discrete Setup
• Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization
• Coherence Pattern–Guided Compressive Sensing with Unresolved Grids
• Near Minimax Line Spectral Estimation
• Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization
• Greed is Good: Algorithmic Results for Sparse Approximation
• Statistical and Information-Theoretic Analysis of Resolution in Imaging
• Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
• Superresolution via Sparsity Constraints
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• Super-resolution of point sources via convex programming
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Likelihood-Based Selection and Sharp Parameter Estimation
• Minimization of $\ell_{1-2}$ for Compressed Sensing
• Computational Aspects of Constrained L 1-L 2 Minimization for Compressive Sensing
• Generalizing the Nonlocal-Means to Super-Resolution Reconstruction
• Image Super-Resolution Via Sparse Representation
• Super-Resolution With Sparse Mixing Estimators
• Towards a Mathematical Theory of Super‐resolution
• Stable signal recovery from incomplete and inaccurate measurements
• Compressed sensing