An exact tree projection algorithm for wavelets

DOI10.1109/LSP.2013.2278147MaRDI QIDQ6241190zbMATH OpenFDO

Authors Coralia Cartis, Andrew Thompson

Publication date 16 April 2013

Full work available at URL https://doi.org/10.1109/LSP.2013.2278147

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Integer programming (90C10) Dynamic programming (90C39) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Abstract: We propose a dynamic programming algorithm for projection onto wavelet tree structures. In contrast to other recently proposed algorithms which only give approximate tree projections for a given sparsity, our algorithm is guaranteed to calculate the projection exactly. We also prove that our algorithm has O(Nk) complexity, where N is the signal dimension and k is the sparsity of the tree approximation.

This page was built for publication: An exact tree projection algorithm for wavelets

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