- 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.
- Publication status:
- Peer review status:
- Peer reviewed
- Accepted Manuscript
- Copyright holder:
- Copyright date:
- Copyright © 2013 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.
An exact tree projection algorithm for wavelets
Views and Downloads
If you are the owner of this record, you can report an update to it here: Report update to this record