Atomic decomposition by basis pursuit
From MaRDI portal
Publication:2706429
DOI10.1137/S003614450037906XzbMATH Open0979.94010DBLPjournals/siamrev/ChenDS01WikidataQ56564479 ScholiaQ56564479MaRDI QIDQ2706429FDOQ2706429
Authors: Scott Shaobing Chen, David Donoho, Michael A. Saunders 
Publication date: 19 March 2001
Published in: SIAM Review (Search for Journal in Brave)
Recommendations
- Atomic Decomposition by Basis Pursuit
- Stable recovery of sparse overcomplete representations in the presence of noise
- Probing the Pareto frontier for basis pursuit solutions
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Matching pursuits with time-frequency dictionaries
waveletsdenoisingtime-frequency analysistime-scale analysiswavelet packetsmatching pursuitmultiscale edgestotal variation denoisingMATLAB code\(\ell^1\) norm optimizationcosine packetsinterior-point methods for linear programmingovercomplete signal representation
Numerical mathematical programming methods (65K05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Algorithms for approximation of functions (65D15) Approximation by arbitrary linear expressions (41A45)
Cited In (only showing first 100 items - show all)
- Independent multiresolution component analysis and matching pursuit
- Another look at Huber's estimator: a new minimax estimator in regression with stochastically bounded noise
- A shrinkage principle for heavy-tailed data: high-dimensional robust low-rank matrix recovery
- Spectral Compressed Sensing via Projected Gradient Descent
- An efficient descent method for locally Lipschitz multiobjective optimization problems
- Spectral dynamics and regularization of incompletely and irregularly measured data
- Two-dimensional random projection
- Computing non-negative tensor factorizations
- A gradient projection method for the sparse signal reconstruction in compressive sensing
- Two dictionaries matching pursuit for sparse decomposition of signals
- A parameterized proximal point algorithm for separable convex optimization
- Geometric separation by single-pass alternating thresholding
- The smoothing FR conjugate gradient method for solving a kind of nonsmooth optimization problem with \(l_1\)-norm
- High resolution pursuit for feature extraction
- On the uniqueness of solutions for the basis pursuit in the continuum
- An adaptive generalized multiscale discontinuous Galerkin method for high-contrast flow problems
- A tuning-free robust and efficient approach to high-dimensional regression
- Primal-dual optimization algorithms over Riemannian manifolds: an iteration complexity analysis
- Efficient uncertainty quantification of stochastic problems in CFD by combination of compressed sensing and POD-kriging
- Extragradient method in optimization: convergence and complexity
- An adaptive primal-dual framework for nonsmooth convex minimization
- Title not available (Why is that?)
- Sparse identification of nonlinear dynamical systems via reweighted \(\ell_1\)-regularized least squares
- Source localization using a sparse representation framework to achieve superresolution
- Sampling and reconstruction of sparse signals on circulant graphs. An introduction to graph-FRI
- Compressive sampling and rapid reconstruction of broadband frequency hopping signals with interference
- An adaptive gradient projection algorithm for piecewise convex optimization and its application in compressed spectrum sensing
- Efficient Coding of Time-Relative Structure Using Spikes
- Truncated $l_{1-2}$ Models for Sparse Recovery and Rank Minimization
- Geometric separation of singularities using combined multiscale dictionaries
- Sparse Bayesian learning approach for discrete signal reconstruction
- Projected shrinkage algorithm for box-constrained \(\ell _1\)-minimization
- A sharp nonasymptotic bound and phase diagram of \(L_{1/2}\) regularization
- Deterministic construction of sparse binary matrices via incremental integer optimization
- Construction, management, and performance of sparse Markowitz portfolios
- A variable fixing version of the two-block nonlinear constrained Gauss-Seidel algorithm for \(\ell_1\)-regularized least-squares
- Sparse dual frames and dual Gabor functions of minimal time and frequency supports
- Preserving injectivity under subgaussian mappings and its application to compressed sensing
- The \(\ell_{2,q}\) regularized group sparse optimization: lower bound theory, recovery bound and algorithms
- Theoretical guarantees for graph sparse coding
- Convergence study of indefinite proximal ADMM with a relaxation factor
- Fast thresholding algorithms with feedbacks for sparse signal recovery
- Sparsity considerations for dependent variables
- Beyond sparsity: the role of \(L_{1}\)-optimizer in pattern classification
- CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion
- Sparse signal reconstruction via the approximations of \(\ell_0\) quasinorm
- Effective zero-norm minimization algorithms for noisy compressed sensing
- Bias-variance trade-off for prequential model list selection
- Discover latent discriminant information for dimensionality reduction: non-negative sparseness preserving embedding
- Title not available (Why is that?)
- Incomplete variables truncated conjugate gradient method for signal reconstruction in compressed sensing
- Geometric separation in \(\mathbb{R}^3\)
- An iterative support shrinking algorithm for non-Lipschitz optimization in image restoration
- Analysis of convergence for the alternating direction method applied to joint sparse recovery
- A pseudo-heuristic parameter selection rule for \(l^1\)-regularized minimization problems
- Statistical multiresolution Dantzig estimation in imaging: fundamental concepts and algorithmic framework
- Image reconstruction using analysis model prior
- Compressed history matching: Exploiting transform-domain sparsity for regularization of nonlinear dynamic data integration problems
- Approximations with evolutionary pursuit
- Block orthogonal greedy algorithm for stable recovery of block-sparse signal representations
- Average Performance of the Sparsest Approximation Using a General Dictionary
- Compressive sensing with cross-validation and stop-sampling for sparse polynomial chaos expansions
- Multi-layer sparse coding: the holistic way
- Sparsest piecewise-linear regression of one-dimensional data
- Super-resolution by means of Beurling minimal extrapolation
- Compressing sensing based source localization for controlled acoustic signals using distributed microphone arrays
- A weighted randomized sparse Kaczmarz method for solving linear systems
- Asynchronous parallel primal-dual block coordinate update methods for affinely constrained convex programs
- Divide and conquer: an incremental sparsity promoting compressive sampling approach for polynomial chaos expansions
- Multiresolution approximation for volatility processes
- Sparse deconvolution using support vector machines
- An automatic and parameter-free information-based method for sparse representation in wavelet bases
- Blind identification of fully observed linear time-varying systems via sparse recovery
- Computing Sparse Representations of Multidimensional Signals Using Kronecker Bases
- A general null space property for sparse principal component analysis
- Spark-level sparsity and the \(\ell_1\) tail minimization
- Dictionary evaluation and optimization for sparse coding based speech processing
- A perturbation view of level-set methods for convex optimization
- Accelerated primal-dual proximal block coordinate updating methods for constrained convex optimization
- FUNCTIONAL APPROXIMATION IN MULTISCALE COMPLEX SYSTEMS
- Identifiability of an X-rank decomposition of polynomial maps
- Sparse recovery with coherent tight frames via analysis Dantzig selector and analysis LASSO
- Propagation and recovery of singularities in the inverse conductivity problem
- A Critical Review of LASSO and Its Derivatives for Variable Selection Under Dependence Among Covariates
- Dimensionality reduction and greedy learning of convoluted stochastic dynamics
- A golden ratio primal-dual algorithm for structured convex optimization
- A new sensor selection scheme for Bayesian learning based sparse signal recovery in WSNs
- Sparse support vector machines in reproducing kernel Banach spaces
- Super greedy type algorithms
- Large-scale hyperspectral image compression via sparse representations based on online learning
- A novel detection scheme with multiple observations for sparse signal based on likelihood ratio test with sparse estimation
- Underdetermined separation of speech mixture based on sparse Bayesian learning
- Norm-minimized scattering data from intensity spectra
- Prediction of protein-protein interaction by metasample-based sparse representation
- Improving the incoherence of a learned dictionary via rank shrinkage
- Linearized alternating directions method for \(\ell_1\)-norm inequality constrained \(\ell_1\)-norm minimization
- Regularized sparse representation for image deconvolution
- Generalizing CoSaMP to signals from a union of low dimensional linear subspaces
- Autoencoders reloaded
- Model selection with distributed SCAD penalty
Uses Software
This page was built for publication: Atomic decomposition by basis pursuit
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2706429)
