Fast implementation of orthogonal greedy algorithm for tight wavelet frames

DOI10.1016/j.sigpro.2005.05.025zbMath1163.94371OpenAlexW2054699267MaRDI QIDQ1027245

J. Blot

Publication date: 1 July 2009

Published in: Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.sigpro.2005.05.025

zbMATH Keywords

image compressionwavelet frameorthogonal greedy algorithm

Mathematics Subject Classification ID

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

Related Items

Analysis of the equivalence relationship between \(l_{0}\)-minimization and \(l_{p}\)-minimization, Group sparse recovery in impulsive noise via alternating direction method of multipliers, Continuous wavelet based linear time-varying system identification, A constrained optimization reformulation and a feasible descent direction method for \(L_{1/2}\) regularization, Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\), A new sparse recovery method for the inverse acoustic scattering problem, Fast Implementation of ℓ 1-Greedy Algorithm