Approximation and Compression of Piecewise Smooth Functions

Wavelet or sub–band coding has been quite successful in compression applications, and this success can be attributed in part to the good approximation properties of wavelets. In this paper, we revisit rate–distortion (RD) bounds for the wavelet approximation of piecewise smooth functions, and piecewise polynomial functions in particular. We contrast these results with RD bounds achievable using an oracle–based method. We then introduce a practical dynamic programming algorithm, which achieves performance similar to the oracle method, and present experimental results.


Published in:
Phil. Transaction R. Soc. Lond. A., 357, 1760, 2573-2591
Year:
1999
Laboratories:




 Record created 2005-04-18, last modified 2018-01-27

External link:
Download fulltext
n/a
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)