Dictionary Preconditioning for Greedy Algorithms
From MaRDI portal
Publication:4568680
DOI10.1109/TSP.2007.911494zbMATH Open1390.94396MaRDI QIDQ4568680FDOQ4568680
P. Vandergheynst, Karin Schnass
Publication date: 27 June 2018
Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)
Cited In (14)
- Sparse Legendre expansions via \(\ell_1\)-minimization
- Preconditioning for orthogonal matching pursuit with noisy and random measurements: the Gaussian case
- Submatrices with NonUniformly Selected Random Supports and Insights into Sparse Approximation
- Signal recovery under cumulative coherence
- Improving the Incoherence of a Learned Dictionary via Rank Shrinkage
- Atoms of all channels, unite! Average case analysis of multi-channel sparse recovery using greedy algorithms
- \(p\)-adic Welch bounds and \(p\)-adic Zauner conjecture
- Compressive sampling and rapid reconstruction of broadband frequency hopping signals with interference
- On a simple derivation of the complementary matching pursuit
- Signal recovery under mutual incoherence property and oracle inequalities
- Influences of preconditioning on the mutual coherence and the restricted isometry property of Gaussian/Bernoulli measurement matrices
- Title not available (Why is that?)
- An improved bound of cumulative coherence for signal recovery
- Greedy approach to sparse multi-path channel estimation using sensing dictionary
This page was built for publication: Dictionary Preconditioning for Greedy Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4568680)
