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

Actions

Email

Email this record

Send the bibliographic details of this record to your email address.

Your Email
Please enter the email address that the record information will be sent to.

-
Your message (optional)
Please add any additional information to be included within the email.
Cite

Cite this record

APA Style

Cartis, C., & Thompson, A. (2013). An exact tree projection algorithm for wavelets. IEEE Signal Processing Letters, 20(11), 1026–1029.

MLA Style

Cartis, C., and A. Thompson. “An Exact Tree Projection Algorithm for Wavelets.” IEEE Signal Processing Letters, vol. 20, no. 11, IEEE, 2013, pp. 1026–29.

Chicago Style

Cartis, C, and A Thompson. 2013. “An Exact Tree Projection Algorithm for Wavelets.” IEEE Signal Processing Letters 20 (11): 1026–29.
Share
Print

Access Document

Files:: An exact tree projection algorithm for wavelets.pdf

(Preview, pdf, 241.8KB, Terms of use)

Publisher copy:: 10.1109/LSP.2013.2278147

Authors

+ Cartis, C More by this author

Institution:: University of Oxford
Division:: MPLS
Department:: Mathematical Institute
Role:: Author

+ Thompson, A More by this author

Institution:: University of Oxford
Division:: MPLS
Department:: Mathematical Institute
Role:: Author

Publisher:: IEEE
Journal:: IEEE Signal Processing Letters More from this journal
Volume:: 20
Issue:: 11
Pages:: 1026-1029
Publication date:: 2013-11-01
DOI:: 10.1109/LSP.2013.2278147
EISSN:: 1558-2361
ISSN:: 1070-9908

Keywords:: wavelets

compressed sensing

complexity analysis

sparse representations

dynamic programming
Pubs id:: pubs:420689
UUID:: uuid:c71438da-f6b9-4eb5-811e-a809c69dbe55
Local pid:: pubs:420689
Source identifiers:: 420689
Deposit date:: 2013-11-16

Terms of use

Copyright holder:: IEEE
Copyright date:: 2013
Notes:: 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.

Licence:: Terms and Conditions of Use for Oxford University Research Archive

Views and Downloads

About 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