An exact tree projection algorithm for wavelets
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.
Keywords: Sparse representations, wavelets, dynamic programming, complexity analysis, compressed sensing
Category 1: Applications -- Science and Engineering
Category 2: Other Topics (Dynamic Programming )
Citation: ERGO Technical Report 13-006, School of Mathematics, University of Edinburgh, UK, 2013.
Entry Submitted: 04/18/2013
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|