On Sparse Representations in Arbitrary Redundant Bases

DOI10.1109/TIT.2004.828141zbMATH Open1284.94018MaRDI QIDQ3546508FDOQ3546508

Publication date: 21 December 2008

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

Recommendations

Sparse representations in unions of bases
On sparse representation in pairs of bases
Sparse and redundant representations. From theory to applications in signal and image processing.
Sparse representations and approximation theory
On Sparse Representation in Fourier and Local Bases
An Open Problem on Sparse Representations in Unions of Bases
Computing Sparse Representations of Multidimensional Signals Using Kronecker Bases
Sparse representation of vectors in lattices and semigroups

Mathematics Subject Classification ID

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

Cited In (only showing first 100 items - show all)

Compressive Sensing
Locally sparse reconstruction using the \(\ell^{1,\infty}\)-norm
A generalized uncertainty principle and sparse representation in pairs of bases
Remote sensing via \(\ell_1\)-minimization
Spectral dynamics and regularization of incompletely and irregularly measured data
Eventual linear convergence of the Douglas-Rachford iteration for basis pursuit
A bilinear algorithm for sparse representations
Minimizers of sparsity regularized Huber loss function
On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them
Necessary and sufficient conditions for the asymptotic distributions of coherence of ultra-high dimensional random matrices
Approximation accuracy, gradient methods, and error bound for structured convex optimization
On verifiable sufficient conditions for sparse signal recovery via \(\ell_{1}\) minimization
Sparse representations and approximation theory
Computing and analyzing recoverable supports for sparse reconstruction
A gradient enhanced \(\ell_{1}\)-minimization for sparse approximation of polynomial chaos expansions
Necessary and sufficient conditions of solution uniqueness in 1-norm minimization
The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
One condition for solution uniqueness and robustness of both \(\ell_1\)-synthesis and \(\ell_1\)-analysis minimizations
Sharp support recovery from noisy random measurements by \(\ell_1\)-minimization
Phase transition in limiting distributions of coherence of high-dimensional random matrices
Processing MUSE hyperspectral data: denoising, deconvolution and detection of astrophysical sources
Computing Sparse Representations of Multidimensional Signals Using Kronecker Bases
Highly sparse representations from dictionaries are unique and independent of the sparseness measure
Low complexity regularization of linear inverse problems
Sensitivity analysis for mirror-stratifiable convex functions
When do stepwise algorithms meet subset selection criteria?
Sparse representations are most likely to be the sparsest possible
A Gradient-Enhanced L1 Approach for the Recovery of Sparse Trigonometric Polynomials
ParNes: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals
A coordinate gradient descent method for \(\ell_{1}\)-regularized convex minimization
Analysis of basis pursuit via capacity sets
Exact support recovery for sparse spikes deconvolution
A numerical exploration of compressed sampling recovery
Matrix sparsification and the sparse null space problem
Stable recovery of sparse overcomplete representations in the presence of noise
Optimal dual certificates for noise robustness bounds in compressive sensing
Cosparsity in Compressed Sensing
On sparse representation in pairs of bases
Multiple sparse measurement gradient reconstruction algorithm for DOA estimation in compressed sensing
Simple bounds for recovering low-complexity models
Submatrices with nonuniformly selected random supports and insights into sparse approximation
Weighted-average alternating minimization method for magnetic resonance image reconstruction based on compressive sensing
Convex optimization in sums of Banach spaces
Multi-frame representations in linear inverse problems with mixed multi-constraints
On the conditioning of random subdictionaries
1-bit compressive sensing: reformulation and RRSP-based sign recovery theory
Musical audio analysis using sparse representations
Local identifiability of \(\ell_1\)-minimization dictionary learning: a sufficient and almost necessary condition
Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications
On the stability of the basis pursuit in the presence of noise
Recovery of Exact Sparse Representations in the Presence of Bounded Noise
Simultaneous cartoon and texture image inpainting using morphological component analysis (MCA)
A Barzilai-Borwein type method for minimizing composite functions
Recovery of high-dimensional sparse signals via \(\ell_1\)-minimization
Fast thresholding algorithms with feedbacks for sparse signal recovery
Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
Solving basis pursuit: heuristic optimality check and solver comparison
Probability of unique integer solution to a system of linear equations
On Polar Polytopes and the Recovery of Sparse Representations
Sparse representations in unions of bases
On the solution uniqueness characterization in the L1 norm and polyhedral gauge recovery
Sparse linear regression from perturbed data
A necessary and sufficient condition for exact sparse recovery by \(\ell_1\) minimization
Counting the faces of randomly-projected hypercubes and orthants, with applications
Consistency of \(\ell_1\) recovery from noisy deterministic measurements
Limiting laws of coherence of random matrices with applications to testing covariance structure and construction of compressed sensing matrices
Sparsity in time-frequency representations
A new computational method for the sparsest solutions to systems of linear equations
A linear system output transformation for sparse approximation
LASSO Reloaded: A Variational Analysis Perspective with Applications to Compressed Sensing
Learning and estimation applications of an online homotopy algorithm for a generalization of the LASSO
Title not available (Why is that?)
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
IDENT: identifying differential equations with numerical time evolution
Convergence rates for the joint solution of inverse problems with compressed sensing data
Tsallis entropy based uncertainty relations on sparse representation for vector and matrix signals
Identifying the source term in the potential equation with weighted sparsity regularization
Sparsity-assisted signal smoothing
Sparse solutions to an underdetermined system of linear equations via penalized Huber loss
Randomized pick-freeze for sparse Sobol indices estimation in high dimension
Sparse system identification in pairs of pulse and Takenaka-Malmquist bases
A look at robustness and stability of \(\ell_1\)-versus \(\ell_0\)-regularization: discussion of papers by Bertsimas et al. and Hastie et al.
An evaluation of the sparsity degree for sparse recovery with deterministic measurement matrices
Sparse spikes super-resolution on thin grids II: the continuous basis pursuit
Robust recovery of signals with partially known support information using weighted BPDN
Model selection with low complexity priors
Constructing New Weighted ℓ₁-Algorithms for the Sparsest Points of Polyhedral Sets
Necessary and Sufficient Conditions for Noiseless Sparse Recovery via Convex Quadratic Splines
Unique sharp local minimum in \(\ell_1\)-minimization complete dictionary learning
Solution uniqueness of convex piecewise affine functions based optimization with applications to constrained \(\ell_1\) minimization
When does OMP achieve exact recovery with continuous dictionaries?
Representation recovery via \(L_1\)-norm minimization with corrupted data
On the uniqueness of the sparse signals reconstruction based on the missing samples variation analysis
Quadratic growth conditions and uniqueness of optimal solution to Lasso
Model Selection With Lasso-Zero: Adding Straw to the Haystack to Better Find Needles
Sparse approximation using new greedy-like bases in superreflexive spaces
Exact recovery of the support of piecewise constant images via total variation regularization
Sampling rates for \(\ell^1\)-synthesis
Box Constraints and Weighted Sparsity Regularization for Identifying Sources in Elliptic PDEs

This page was built for publication: On Sparse Representations in Arbitrary Redundant Bases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546508)