Fast implementation of orthogonal greedy algorithm for tight wavelet frames

DOI10.1016/J.SIGPRO.2005.05.025MaRDI QIDQ1027245zbMATH OpenOpenAlexFDO

Authors 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

wavelet frameimage compressionorthogonal greedy algorithm

Mathematics Subject Classification ID

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

Recommendations

• Tight wavelet frames with matrix dilations
• On optimal estimate of the block orthogonal greedy algorithm for g-frames
• scientific article; zbMATH DE number 910673
• Adaptive algorithms of nonlinear approximation with finite terms
• Tight wavelet frames theory based decomposition and reconstruction algorithms and perfect reconstructed symmetric extension transforms technology

Cited in

(8)

• Fast implementation of \(\ell ^1\)-greedy algorithm
• Continuous wavelet based linear time-varying system identification
• Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
• High-order block RIP for nonconvex block-sparse compressed sensing
• A constrained optimization reformulation and a feasible descent direction method for \(L_{1/2}\) regularization
• A new sparse recovery method for the inverse acoustic scattering problem
• 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

This page was built for publication: Fast implementation of orthogonal greedy algorithm for tight wavelet frames

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1027245)