Dictionary Preconditioning for Greedy Algorithms

DOI10.1109/TSP.2007.911494MaRDI QIDQ4568680zbMATH OpenFDO

Authors Karin Schnass, P. Vandergheynst

Publication date 27 June 2018

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TSP.2007.911494

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cited in

(14)

• Sparse Legendre expansions via _1-minimization
• Preconditioning for orthogonal matching pursuit with noisy and random measurements: the Gaussian case
• Signal recovery under cumulative coherence
• Convolutional neural networks analyzed via convolutional sparse coding
• Atoms of all channels, unite! Average case analysis of multi-channel sparse recovery using greedy algorithms
• Compressive sampling and rapid reconstruction of broadband frequency hopping signals with interference
• p-adic Welch bounds and p-adic Zauner conjecture
• Submatrices with nonuniformly selected random supports and insights into sparse approximation
• Improving the incoherence of a learned dictionary via rank shrinkage
• 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
• 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)