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)
- 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
- The matrix splitting based proximal fixed-point algorithms for quadratically constrained \(\ell_{1}\) minimization and Dantzig selector
- Sparse approximation over the cube
- Large sparse signal recovery by conjugate gradient algorithm based on smoothing technique
- Sparse signal recovery via ECME thresholding pursuits
- Example-based single document image super-resolution: a global MAP approach with outlier rejection
- Proximal methods for reweighted \(l_Q\)-regularization of sparse signal recovery
- A near-optimal sampling strategy for sparse recovery of polynomial chaos expansions
- Optimal representative sample weighting
- Iterative identification for multivariable systems with time-delays based on basis pursuit de-noising and auxiliary model
- Analysis and algorithms for some compressed sensing models based on L1/L2 minimization
- Exact matrix completion based on low rank Hankel structure in the Fourier domain
- Estimation and Uncertainty Quantification for Piecewise Smooth Signal Recovery
- Approximate \(\ell_0\)-penalized estimation of piecewise-constant signals on graphs
- Title not available (Why is that?)
- Identifying small mean-reverting portfolios
- A generalized sampling and preconditioning scheme for sparse approximation of polynomial chaos expansions
- Optimal subgradient methods: computational properties for large-scale linear inverse problems
- A preconditioning approach for improved estimation of sparse polynomial chaos expansions
- Inferring sparse Gaussian graphical models with latent structure
- Persistene in high-dimensional linear predictor-selection and the virtue of overparametrization
- On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them
- Embedded feature-selection support vector machine for driving pattern recognition
- Adaptive Dantzig density estimation
- Model-based multiple rigid object detection and registration in unstructured range data
- A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints
- On the size of incoherent systems
- A convex optimization approach to filtering in jump linear systems with state dependent transitions
- Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization
- Sparse recovery under weak moment assumptions
- Regularity properties for sparse regression
- High-dimensional graphs and variable selection with the Lasso
- Best subset selection, persistence in high-dimensional statistical learning and optimization under \(l_1\) constraint
- Convolutional neural networks analyzed via convolutional sparse coding
- A remark on compressed sensing
- On constrained and regularized high-dimensional regression
- \(L^1\) regularization method in electrical impedance tomography by using the \(L^1\)-curve (Pareto frontier curve)
- An implementable splitting algorithm for the \(\ell_1\)-norm regularized split feasibility problem
- A linearly convergent algorithm for solving a class of nonconvex/affine feasibility problems
- Exact reconstruction using Beurling minimal extrapolation
- A non-adapted sparse approximation of PDEs with stochastic inputs
- Aggregation for Gaussian regression
- Coordinate and subspace optimization methods for linear least squares with non-quadratic regularization
- Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework
- Mixed linear system estimation and identification
- Primal and dual alternating direction algorithms for \(\ell _{1}\)-\(\ell _{1}\)-norm minimization problems in compressive sensing
- Sparse approximations with interior point methods
- Sparse solutions of a class of constrained optimization problems
- On model selection consistency of regularized M-estimators
- PAC-Bayesian bounds for sparse regression estimation with exponential weights
- Improved bounds for the RIP of subsampled circulant matrices
- MultiDimensional Sparse Super-Resolution
- SPADES and mixture models
- A nonconvex model with minimax concave penalty for image restoration
- A superlinearly convergent \(R\)-regularized Newton scheme for variational models with concave sparsity-promoting priors
- Learning sparse FRAME models for natural image patterns
- Sparse estimation via lower-order penalty optimization methods in high-dimensional linear regression
- Microlocal analysis of the geometric separation problem
- Portfolio optimization with linear and fixed transaction costs
- Sparsity and Smoothness Via the Fused Lasso
- Image denoising by generalized total variation regularization and least squares fidelity
- Sparsity- and continuity-promoting seismic image recovery with curvelet frames
- Concave programming for minimizing the zero-norm over polyhedral sets
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)
