An Exact Tree Projection Algorithm for Wavelets

@article{Cartis2013AnET,
  title={An Exact Tree Projection Algorithm for Wavelets},
  author={C. Cartis and A. Thompson},
  journal={IEEE Signal Processing Letters},
  year={2013},
  volume={20},
  pages={1026-1029}
}
  • C. Cartis, A. Thompson
  • Published 2013
  • Mathematics, Computer Science
  • IEEE Signal Processing Letters
  • 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. 
    22 Citations
    A fast approximation algorithm for tree-sparse recovery
    • 27
    • PDF
    Improved Algorithms For Structured Sparse Recovery
    Sparse group covers and greedy tree approximations
    • 2
    • PDF
    Better Approximations for Tree Sparsity in Nearly-Linear Time
    • 24
    • PDF
    Inexact Gradient Projection and Fast Data Driven Compressed Sensing
    • 11
    • PDF
    Tree Structure Sparsity Pattern Guided Convex Optimization for Compressive Sensing of Large-Scale Images
    • 4
    Fast Algorithms for Structured Sparsity (ICALP 2015 Invited Tutorial)
    Structured Sparsity: Discrete and Convex approaches
    • 24
    • PDF

    References

    SHOWING 1-10 OF 22 REFERENCES
    Optimal tree approximation with wavelets
    • 85
    A signal-dependent time-frequency representation: fast algorithm for optimal kernel design
    • 79
    • PDF
    Sampling Theorems for Signals From the Union of Finite-Dimensional Linear Subspaces
    • 284
    • PDF
    Embedded image coding using zerotrees of wavelet coefficients
    • J. M. Shapiro
    • Mathematics, Computer Science
    • IEEE Trans. Signal Process.
    • 1993
    • 5,694
    • PDF
    Entropy-based algorithms for best basis selection
    • 3,158
    • PDF
    CART AND BEST-ORTHO-BASIS: A CONNECTION'
    • 229
    • PDF
    Trading Accuracy for Simplicity in Decision Trees
    • 161
    • PDF