On sparse representation in pairs of bases
From MaRDI portal
Publication:4680124
DOI10.1109/TIT.2003.811926zbMath1063.42018OpenAlexW2115090644WikidataQ57392933 ScholiaQ57392933MaRDI QIDQ4680124
Publication date: 1 June 2005
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2003.811926
Related Items (12)
Highly sparse representations from dictionaries are unique and independent of the sparseness measure ⋮ Asymptotic Theory of \(\boldsymbol \ell _1\) -Regularized PDE Identification from a Single Noisy Trajectory ⋮ Tsallis entropy based uncertainty relations on sparse representation for vector and matrix signals ⋮ Sparse representations and approximation theory ⋮ A null-space-based weightedl1minimization approach to compressed sensing ⋮ On sparse recovery algorithms in unions of orthonormal bases ⋮ Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications ⋮ Beyond sparsity: recovering structured representations by \({\ell}^1\) minimization and greedy algorithms ⋮ Stable restoration and separation of approximately sparse signals ⋮ A numerical exploration of compressed sampling recovery ⋮ Linearized Bregman iterations for compressed sensing ⋮ On the differences between \(L_2\) boosting and the Lasso
This page was built for publication: On sparse representation in pairs of bases