scientific article; zbMATH DE number 2079345
From MaRDI portal
zbMath1094.41500MaRDI QIDQ4471300
No author found.
Publication date: 28 July 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Approximation by other special function classes (41A30)
Related Items
Book Review: A mathematical introduction to compressive sensing, On Lebesgue-type inequalities for greedy approximation, Sparse approximation is provably hard under coherent dictionaries, Complex best \(r\)-term approximations almost always exist in finite dimensions, Highly sparse representations from dictionaries are unique and independent of the sparseness measure, Approximation accuracy, gradient methods, and error bound for structured convex optimization, Sparse approximation over the cube, Error estimates for orthogonal matching pursuit and random dictionaries, On the optimality of the orthogonal greedy algorithm for \(\mu\)-coherent dictionaries, Explicit constructions of RIP matrices and related problems, A note on the complexity of \(L _{p }\) minimization, A note on the hardness of sparse approximation, Dictionary descent in optimization, Compressed sensing with coherent and redundant dictionaries, Unnamed Item, On performance of greedy algorithms, On the size of incoherent systems, On some deterministic dictionaries supporting sparsity, CoSaMP: Iterative signal recovery from incomplete and inaccurate samples, On Optimal Estimate of the Block Orthogonal Greedy Algorithm for g-Frames, Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit, SPARSE APPROXIMATION AND RECOVERY BY GREEDY ALGORITHMS IN BANACH SPACES
