Journal article icon

Journal article

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.
Publication status:
Published
Peer review status:
Peer reviewed
Version:
Accepted Manuscript

Actions


Access Document


Files:
Publisher copy:
10.1109/LSP.2013.2278147

Authors


More by this author
Institution:
University of Oxford
Department:
Oxford, MPLS, Mathematical Inst
Role:
Author
More by this author
Institution:
University of Oxford
Department:
Oxford, MPLS, Mathematical Inst
Role:
Author
Publisher:
IEEE Publisher's website
Journal:
IEEE Signal Processing Letters Journal website
Volume:
20
Issue:
11
Pages:
1026-1029
Publication date:
2013-11-05
DOI:
EISSN:
1558-2361
ISSN:
1070-9908
URN:
uuid:c71438da-f6b9-4eb5-811e-a809c69dbe55
Source identifiers:
420689
Local pid:
pubs:420689

Terms of use


Metrics


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP