On Sparse Representations in Arbitrary Redundant Bases

DOI10.1109/TIT.2004.828141zbMath1284.94018MaRDI QIDQ3546508

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Quadratic programming (90C20) Linear programming (90C05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items

A fast \(\ell_1\)-solver and its applications to robust face recognition, Computing and analyzing recoverable supports for sparse reconstruction, Sparse solutions to an underdetermined system of linear equations via penalized Huber loss, Minimizers of sparsity regularized Huber loss function, Eventual linear convergence of the Douglas-Rachford iteration for basis pursuit, One condition for solution uniqueness and robustness of both \(\ell_1\)-synthesis and \(\ell_1\)-analysis minimizations, Convergence rates for the joint solution of inverse problems with compressed sensing data, Counting the faces of randomly-projected hypercubes and orthants, with applications, Cosparsity in Compressed Sensing, Matrix sparsification and the sparse null space problem, Sensitivity Analysis for Mirror-Stratifiable Convex Functions, Model Selection With Lasso-Zero: Adding Straw to the Haystack to Better Find Needles, 1-bit compressive sensing: reformulation and RRSP-based sign recovery theory, Unnamed Item, Multiple sparse measurement gradient reconstruction algorithm for DOA estimation in compressed sensing, Recovery of high-dimensional sparse signals via \(\ell_1\)-minimization, When does OMP achieve exact recovery with continuous dictionaries?, ParNes: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals, Highly sparse representations from dictionaries are unique and independent of the sparseness measure, Simple bounds for recovering low-complexity models, Approximation accuracy, gradient methods, and error bound for structured convex optimization, Convex optimization in sums of Banach spaces, Quadratic growth conditions and uniqueness of optimal solution to Lasso, Exact support recovery for sparse spikes deconvolution, Strengthening hash families and compressive sensing, Optimal dual certificates for noise robustness bounds in compressive sensing, Remote sensing via \(\ell_1\)-minimization, A smoothing method for sparse optimization over convex sets, Solution uniqueness of convex piecewise affine functions based optimization with applications to constrained ℓ₁ minimization, A gradient enhanced \(\ell_{1}\)-minimization for sparse approximation of polynomial chaos expansions, A hierarchical framework for recovery in compressive sensing, Phase transition in limiting distributions of coherence of high-dimensional random matrices, Sampling rates for \(\ell^1\)-synthesis, LASSO Reloaded: A Variational Analysis Perspective with Applications to Compressed Sensing, Tsallis entropy based uncertainty relations on sparse representation for vector and matrix signals, Sparsity-Assisted Signal Smoothing, Sparse representations and approximation theory, Representation recovery via \(L_1\)-norm minimization with corrupted data, Sharp support recovery from noisy random measurements by \(\ell_1\)-minimization, On verifiable sufficient conditions for sparse signal recovery via \(\ell_{1}\) minimization, Model selection with low complexity priors, Compressive Sensing, Sparse spikes super-resolution on thin grids II: the continuous basis pursuit, Limiting laws of coherence of random matrices with applications to testing covariance structure and construction of compressed sensing matrices, Learning and estimation applications of an online homotopy algorithm for a generalization of the LASSO, Sparse linear regression from perturbed data, Constructing New Weighted ℓ₁-Algorithms for the Sparsest Points of Polyhedral Sets, Robust recovery of signals with partially known support information using weighted BPDN, Necessary and sufficient conditions for the asymptotic distributions of coherence of ultra-high dimensional random matrices, Consistency of \(\ell_1\) recovery from noisy deterministic measurements, On the conditioning of random subdictionaries, A look at robustness and stability of \(\ell_1\)-versus \(\ell_0\)-regularization: discussion of papers by Bertsimas et al. and Hastie et al., Weighted-average alternating minimization method for magnetic resonance image reconstruction based on compressive sensing, Musical audio analysis using sparse representations, A necessary and sufficient condition for exact sparse recovery by \(\ell_1\) minimization, Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications, A Barzilai-Borwein type method for minimizing composite functions, On the solution uniqueness characterization in the L1 norm and polyhedral gauge recovery, A Gradient-Enhanced L1 Approach for the Recovery of Sparse Trigonometric Polynomials, The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder)., IDENT: identifying differential equations with numerical time evolution, An evaluation of the sparsity degree for sparse recovery with deterministic measurement matrices, Fast thresholding algorithms with feedbacks for sparse signal recovery, Spectral dynamics and regularization of incompletely and irregularly measured data, A coordinate gradient descent method for \(\ell_{1}\)-regularized convex minimization, Sparsity in time-frequency representations, Necessary and sufficient conditions of solution uniqueness in 1-norm minimization, A numerical exploration of compressed sampling recovery, On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them, Processing MUSE hyperspectral data: denoising, deconvolution and detection of astrophysical sources, Unnamed Item, Randomized pick-freeze for sparse Sobol indices estimation in high dimension, Probability of unique integer solution to a system of linear equations, When do stepwise algorithms meet subset selection criteria?, Low Complexity Regularization of Linear Inverse Problems, Analysis of basis pursuit via capacity sets, Weak Stability of ℓ₁-Minimization Methods in Sparse Data Reconstruction, Unnamed Item, Unnamed Item, Existence and uniqueness of solutions to the norm minimum problem on digraphs, Necessary and Sufficient Conditions for Noiseless Sparse Recovery via Convex Quadratic Splines, Risk bound of transfer learning using parametric feature mapping and its application to sparse coding, Outlier deletion based improvement on the stomp algorithm for sparse solution of large-scale underdetermined problems, Submatrices with NonUniformly Selected Random Supports and Insights into Sparse Approximation, A New Computational Method for the Sparsest Solutions to Systems of Linear Equations, Simultaneous cartoon and texture image inpainting using morphological component analysis (MCA), Solving Basis Pursuit, Locally sparse reconstruction using the \(\ell^{1,\infty}\)-norm