An adaptive inverse scale space method for compressed sensing
From MaRDI portal
Publication:4911904
DOI10.1090/S0025-5718-2012-02599-3zbMath1260.49053OpenAlexW1990851110MaRDI QIDQ4911904
Martin Benning, Martin Burger, Michael Moeller, Stanley J. Osher
Publication date: 20 March 2013
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0025-5718-2012-02599-3
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Ill-posedness and regularization problems in numerical linear algebra (65F22) Convex programming (90C25) Numerical methods involving duality (49M29)
Related Items
A new conjugate gradient hard thresholding pursuit algorithm for sparse signal recovery, Fast sparse reconstruction: Greedy inverse scale space flows, A survey on compressive sensing: classical results and recent advancements, Nonlinear spectral analysis via one-homogeneous functionals: overview and future prospects, A Greedy Algorithm for Sparse Precision Matrix Approximation, A dual split Bregman method for fast $\ell ^1$ minimization, \(\mathrm{L_1RIP}\)-based robust compressed sensing, Bregman Itoh-Abe methods for sparse optimisation, Bias reduction in variational regularization, The homotopy method revisited: Computing solution paths of $\ell _1$-regularized problems, A Guide to the TV Zoo, Sparse recovery via differential inclusions, Modern regularization methods for inverse problems, A time continuation based fast approximate algorithm for compressed sensing related optimization, Choose Your Path Wisely: Gradient Descent in a Bregman Distance Framework, An Algorithm Solving Compressive Sensing Problem Based on Maximal Monotone Operators
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Iterative hard thresholding for compressed sensing
- Error estimation for Bregman iterations and inverse scale space methods in image restoration
- Fast linearized Bregman iteration for compressive sensing and sparse denoising
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
- Adaptive wavelet methods. II: Beyond the elliptic case
- Nonlinear inverse scale space methods
- Analysis and Generalizations of the Linearized Bregman Method
- Linearized Bregman iterations for compressed sensing
- Convergence of the linearized Bregman iteration for ℓ₁-norm minimization
- Inverse Total Variation Flow
- Decoding by Linear Programming
- Just relax: convex programming methods for identifying sparse signals in noise
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Adaptive wavelet methods for elliptic operator equations: Convergence rates
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Adaptive Wavelet Methods for Saddle Point Problems---Optimal Convergence Rates
- Matching pursuits with time-frequency dictionaries
- A Guide to the TV Zoo
- Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- An Iterative Regularization Method for Total Variation-Based Image Restoration
- Sparse Signal Reconstruction via Iterative Support Detection
- Compressed sensing
