Stable recovery of sparse overcomplete representations in the presence of noise
From MaRDI portal
Publication:3546813
DOI10.1109/TIT.2005.860430zbMath1288.94017WikidataQ60308909 ScholiaQ60308909MaRDI QIDQ3546813
David L. Donoho, Michael Elad, Vladimir N. Temlyakov
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Lassosparse representationstepwise regressionsuperresolutiongreedy approximationincoherent dictionaryovercomplete representationKruskal rankBasis Pursuit\(\ell^1\)-norm penalizationMatching Pursuitstability, mixed \(\ell^1\)-\(\ell^2\) norm minimization
Related Items
Signal recovery under cumulative coherence, Some sharp performance bounds for least squares regression with \(L_1\) regularization, Near-ideal model selection by \(\ell _{1}\) minimization, Sparsity in penalized empirical risk minimization, Data-driven design of two degree-of-freedom nonlinear controllers: the \(\operatorname{D}^2\)-IBC approach, Compressed sensing image restoration based on data-driven multi-scale tight frame, Fields of experts, Wavelet denoising via sparse representation, Compressed history matching: Exploiting transform-domain sparsity for regularization of nonlinear dynamic data integration problems, Variational multiscale nonparametric regression: smooth functions, Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods, Instrumental variable-based OMP identification algorithm for Hammerstein systems, A sublinear algorithm for the recovery of signals with sparse Fourier transform when many samples are missing, Reweighted \(\ell_1\) minimization method for stochastic elliptic differential equations, On stepwise pattern recovery of the fused Lasso, Sparse SAR imaging based on \(L_{1/2}\) regularization, Compressed sensing SAR imaging based on sparse representation in fractional Fourier domain, Recovery of high-dimensional sparse signals via \(\ell_1\)-minimization, On greedy algorithms for dictionaries with bounded cumulative coherence, Sparse recovery under matrix uncertainty, Approximation accuracy, gradient methods, and error bound for structured convex optimization, Asymptotic properties of Lasso+mLS and Lasso+Ridge in sparse high-dimensional linear regression, \(\ell _{1}\)-regularized linear regression: persistence and oracle inequalities, Bayesian linear regression with sparse priors, Robust estimation for an inverse problem arising in multiview geometry, Sparse identification of posynomial models, Model-based multiple rigid object detection and registration in unstructured range data, Approximation of rectangular beta-Laguerre ensembles and large deviations, Optimization over finite frame varieties and structured dictionary design, Phase transition in limiting distributions of coherence of high-dimensional random matrices, Sampling in the analysis transform domain, On the optimality of the orthogonal greedy algorithm for \(\mu\)-coherent dictionaries, Adaptive Dantzig density estimation, Sparse support recovery using correlation information in the presence of additive noise, The residual method for regularizing ill-posed problems, Sharp support recovery from noisy random measurements by \(\ell_1\)-minimization, Two are better than one: fundamental parameters of frame coherence, On verifiable sufficient conditions for sparse signal recovery via \(\ell_{1}\) minimization, Direct data domain STAP using sparse representation of clutter spectrum, Improved stability conditions of BOGA for noisy block-sparse signals, Registration-based compensation using sparse representation in conformal-array STAP, Limiting laws of coherence of random matrices with applications to testing covariance structure and construction of compressed sensing matrices, Sparse regression learning by aggregation and Langevin Monte-Carlo, Honest variable selection in linear and logistic regression models via \(\ell _{1}\) and \(\ell _{1}+\ell _{2}\) penalization, Thresholding-based iterative selection procedures for model selection and shrinkage, Mirror averaging with sparsity priors, Existence of the best \(n\)-term approximants for structured dictionaries, Block orthogonal greedy algorithm for stable recovery of block-sparse signal representations, Oracle inequalities and optimal inference under group sparsity, Stable recovery of sparse signals via \(\ell_p\)-minimization, Finding effective points by surrogate models with overcomplete bases, Signal recovery under mutual incoherence property and oracle inequalities, A new perspective on least squares under convex constraint, Analysis of convergence for the alternating direction method applied to joint sparse recovery, Linear versus non-linear acquisition of step-functions, Noise folding in completely perturbed compressed sensing, A remark on compressed sensing, A remark on joint sparse recovery with OMP algorithm under restricted isometry property, A preconditioning approach for improved estimation of sparse polynomial chaos expansions, A data-driven framework for sparsity-enhanced surrogates with arbitrary mutually dependent randomness, Convergence radius and sample complexity of ITKM algorithms for dictionary learning, Debiasing the Lasso: optimal sample size for Gaussian designs, Limited-complexity controller tuning: a set membership data-driven approach, Spectral dynamics and regularization of incompletely and irregularly measured data, A performance guarantee for orthogonal matching pursuit using mutual coherence, Two-dimensional random projection, Sparsity in time-frequency representations, A non-adapted sparse approximation of PDEs with stochastic inputs, On algebraic properties of low rank approximations of Prony systems, Sparse approximate solution of partial differential equations, SPADES and mixture models, On performance of greedy algorithms, Concave programming for minimizing the zero-norm over polyhedral sets, A unified approach to model selection and sparse recovery using regularized least squares, Feature selection guided by structural information, When do stepwise algorithms meet subset selection criteria?, Model recovery for Hammerstein systems using the hierarchical orthogonal matching pursuit method, Enhancing \(\ell_1\)-minimization estimates of polynomial chaos expansions using basis selection, Enhancing sparsity of Hermite polynomial expansions by iterative rotations, A novel STAP algorithm for airborne MIMO radar based on temporally correlated multiple sparse Bayesian learning, Lasso-type recovery of sparse representations for high-dimensional data, Some theoretical results on the grouped variables Lasso, Three novel edge detection methods for incomplete and noisy spectral data, Linear convergence of iterative soft-thresholding, Atoms of all channels, unite! Average case analysis of multi-channel sparse recovery using greedy algorithms, Overcomplete blind source separation based on generalized Gaussian function and SL0 norm, Optimal feature selection for sparse linear discriminant analysis and its applications in gene expression data, On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD, Aggregation by exponential weighting, sharp PAC-Bayesian bounds and sparsity, Accuracy guaranties for \(\ell_{1}\) recovery of block-sparse signals, Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\), Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit, Compressive sensing for subsurface imaging using ground penetrating radar, KFCE: a dictionary generation algorithm for sparse representation, Structured iterative hard thresholding with on- and off-grid applications, Sparse solutions to underdetermined Kronecker product systems, Theoretical guarantees for graph sparse coding, Direction of arrival estimation via reweighted \(l_1\) norm penalty algorithm for monostatic MIMO radar, Adaptive estimation of the baseline hazard function in the Cox model by model selection, with high-dimensional covariates, Nomonotone spectral gradient method for sparse recovery, Unconstrained \(\ell_1\)-\(\ell_2\) minimization for sparse recovery via mutual coherence, Influence of Gibbs phenomenon on the mutual coherence in sparse representations, Adaptive log-density estimation, A comparison of block based Kalman filter and H-infinity algorithms for blind image separation, A General Framework of Rotational Sparse Approximation in Uncertainty Quantification, Efficient Blind Compressed Sensing Using Sparsifying Transforms with Convergence Guarantees and Application to Magnetic Resonance Imaging, The asymptotic distribution and Berry-Esseen bound of a new test for independence in high dimension with an application to stochastic optimization, Multi-receivers and sparse-pixel pseudo-thermal light source for compressive ghost imaging against turbulence, Book Review: A mathematical introduction to compressive sensing, Constructing Surrogate Models of Complex Systems with Enhanced Sparsity: Quantifying the Influence of Conformational Uncertainty in Biomolecular Solvation, Recovering Structured Signals in Noise: Least-Squares Meets Compressed Sensing, Model Selection With Lasso-Zero: Adding Straw to the Haystack to Better Find Needles, Simultaneous analysis of Lasso and Dantzig selector, Bayesian factor-adjusted sparse regression, The restricted isometry property of block diagonal matrices for group-sparse signal recovery, Illumination Strategies for Intensity-Only Imaging, Analysis of simultaneous inpainting and geometric separation based on sparse decomposition, Recovery error analysis of noisy measurement in compressed sensing, Reconstruction of sparse signals in impulsive disturbance environments, Sparsest representations and approximations of an underdetermined linear system, Improved RIP conditions for compressed sensing with coherent tight frames, Local and Global Geometry of Prony Systems and Fourier Reconstruction of Piecewise-Smooth Functions, Reprint of: A forward-backward greedy approach for sparse multiscale learning, Iterative hard thresholding for compressed data separation, A smoothing method for sparse optimization over convex sets, Uncertainty Principles for Inverse Source Problems, Far Field Splitting, and Data Completion, Unnamed Item, A near-optimal sampling strategy for sparse recovery of polynomial chaos expansions, Sup-norm convergence rate and sign concentration property of Lasso and Dantzig estimators, Sparse estimation via lower-order penalty optimization methods in high-dimensional linear regression, Effective zero-norm minimization algorithms for noisy compressed sensing, Unnamed Item, Gradient-based method with active set strategy for $\ell _1$ optimization, Sliced-Inverse-Regression--Aided Rotated Compressive Sensing Method for Uncertainty Quantification, Compressive sensing adaptation for polynomial chaos expansions, A general framework for Bayes structured linear models, Necessary and sufficient conditions for the asymptotic distributions of coherence of ultra-high dimensional random matrices, Asymptotic theory for maximum deviations of sample covariance matrix estimates, Some greedy algorithms for sparse polynomial chaos expansions, Hierachical Bayesian models and sparsity: ℓ 2 -magic, An Introduction to Compressed Sensing, Aggregation for Gaussian regression, DASSO: Connections Between the Dantzig Selector and Lasso, WEAK LFM SIGNAL DECTECTION BASED ON WAVELET TRANSFORM MODULUS MAXIMA DENOISING AND OTHER TECHNIQUES, Sparse approximation based on a random overcomplete basis, Microlocal Analysis of the Geometric Separation Problem, Gaussian averages of interpolated bodies and applications to approximate reconstruction, Sparsity- and continuity-promoting seismic image recovery with curvelet frames, A Tight Bound of Hard Thresholding, Sharp RIP bound for sparse signal and low-rank matrix recovery, Geometric separation by single-pass alternating thresholding, Stable restoration and separation of approximately sparse signals, Fast thresholding algorithms with feedbacks for sparse signal recovery, Sparse recovery with coherent tight frames via analysis Dantzig selector and analysis LASSO, Energy preserved sampling for compressed sensing MRI, Ways to sparse representation: An overview, A numerical exploration of compressed sampling recovery, On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them, Unnamed Item, Randomized pick-freeze for sparse Sobol indices estimation in high dimension, A Compressive Sensing Based Analysis of Anomalies in Generalized Linear Models, Distributed compressed sensing based joint detection and tracking for multistatic radar system, Fast Sparse Representation Based on Smoothed ℓ0 Norm, Sparse Component Analysis in Presence of Noise Using an Iterative EM-MAP Algorithm, Blind Source Separation with Outliers in Transformed Domains, Necessary and sufficient conditions for linear convergence of ℓ1-regularization, Denoising for multiple image copies through joint sparse representation, Construction of Sparse Binary Sensing Matrices Using Set Systems, On the differences between \(L_2\) boosting and the Lasso, Model recovery for Hammerstein systems using the auxiliary model based orthogonal matching pursuit method, A Mixture of Wisharts (MOW) Model for Multifiber Reconstruction, The Doubly Adaptive LASSO for Vector Autoregressive Models, Divide and conquer: an incremental sparsity promoting compressive sampling approach for polynomial chaos expansions, Sparse set membership identification of nonlinear functions and application to fault detection, Stochastic Collocation Methods via Minimisation of the Transformed L<sub>1</sub>-Penalty, Estimation of Sparse Nonnegative Sources from Noisy Overcomplete Mixtures Using MAP, Asymptotic analysis for extreme eigenvalues of principal minors of random matrices, Truncated sparse approximation property and truncated \(q\)-norm minimization, Sparse radial basis function approximation with spatially variable shape parameters, A review on restoration of seismic wavefields based on regularization and compressive sensing, Binary sparse signal recovery with binary matching pursuit *, Robust sparse recovery via a novel convex model, A forward-backward greedy approach for sparse multiscale learning, Compressed sensing MR image reconstruction exploiting TGV and wavelet sparsity, One-bit compressed sensing via ℓ p (0 < p < 1)-minimization method, ℓ 1 − αℓ 2 minimization methods for signal and image reconstruction with impulsive noise removal, Optimal RIP bounds for sparse signals recovery via \(\ell_p\) minimization, Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit, Preconditioning for orthogonal matching pursuit with noisy and random measurements: the Gaussian case, A convex relaxation framework consisting of a primal-dual alternative algorithm for solving \(\ell_0\) sparsity-induced optimization problems with application to signal recovery based image restoration, Asymptotic Equivalence of Regularization Methods in Thresholded Parameter Space, Unnamed Item, The Dantzig selector: recovery of signal via ℓ 1 − αℓ 2 minimization, Alternating direction method of multipliers for solving dictionary learning models, Simultaneous cartoon and texture image inpainting using morphological component analysis (MCA), Theory and applications of compressed sensing, Maximal Function Pooling with Applications, Sparse learning via Boolean relaxations, Finding sparse solutions of systems of polynomial equations via group-sparsity optimization, A Theoretical Perspective on Hyperdimensional Computing, A prediction-oriented optimal design for visualisation recommender systems, Compressed data separation via unconstrained l1-split analysis, A combined dictionary learning and TV model for image restoration with convergence analysis, Performance analysis for unconstrained analysis based approaches*, Asymptotic Theory of \(\boldsymbol \ell _1\) -Regularized PDE Identification from a Single Noisy Trajectory, A Critical Review of LASSO and Its Derivatives for Variable Selection Under Dependence Among Covariates, Nonlinear system identification in Sobolev spaces, A Smoothing Method for Sparse Optimization over Polyhedral Sets, Binary generalized orthogonal matching pursuit, Nonconvex \(\ell_p-\alpha\ell_q\) minimization method and \(p\)-RIP condition for stable recovery of approximately \(k\)-sparse signals, \(k\)-sparse vector recovery via truncated \(\ell_1 -\ell_2\) local minimization, Some results on OMP algorithm for MMV problem, On lower bounds for the bias-variance trade-off, On the determination of Lagrange multipliers for a weighted Lasso problem using geometric and convex analysis techniques, Sparse Probability Assessment Heuristic Based on Orthogonal Matching Pursuit, Improved Sparse Coding Under the Influence of Perceptual Attention, An unbiased approach to compressed sensing, Sparsity Promoting Hybrid Solvers for Hierarchical Bayesian Inverse Problems, Sparse solution of nonnegative least squares problems with applications in the construction of probabilistic Boolean networks, A SMOOTH APPROXIMATION TO PROBABILITY CONSTRAINED OPTIMIZATION MODEL IN COMPRESSED SENSING, Sparse Recovery via Partial Regularization: Models, Theory, and Algorithms, Weak Stability of ℓ1-Minimization Methods in Sparse Data Reconstruction, Imaging with highly incomplete and corrupted data, An improved bound of cumulative coherence for signal recovery, Modern regularization methods for inverse problems, Unnamed Item, The Restricted Isometry Property of Subsampled Fourier Matrices, New Restricted Isometry Property Analysis for $\ell_1-\ell_2$ Minimization Methods, Sparse Solutions of a Class of Constrained Optimization Problems, A Generalized Sampling and Preconditioning Scheme for Sparse Approximation of Polynomial Chaos Expansions
