z-logo
open-access-imgOpen Access
<title>Comparison of wavelets from the point of view of their approximation error</title>
Author(s) -
Michaël Unser,
Thierry Blu
Publication year - 1998
Publication title -
proceedings of spie, the international society for optical engineering/proceedings of spie
Language(s) - English
Resource type - Conference proceedings
SCImago Journal Rank - 0.192
H-Index - 176
eISSN - 1996-756X
pISSN - 0277-786X
DOI - 10.1117/12.328141
Subject(s) - wavelet , mathematics , daubechies wavelet , approximation error , constant (computer programming) , function (biology) , sampling (signal processing) , infinity , wavelet transform , mathematical analysis , discrete wavelet transform , computer science , artificial intelligence , filter (signal processing) , evolutionary biology , computer vision , biology , programming language
We present new quantitative results for the characterization of the b-error of wavelet-like expansions as a function of the scale a. This yields an extension as well as a simplification of the asymptotic error formulas that have been published previously. We use our bound determinations to compare the approximation power of various families of wavelet transforms. We present explicit formulas for the leading asymptotic constant for both splines and Daubechies wavelets. For a specified approximation error, this allows us to predict the sampling rate reduction that can obtained by using splines instead Daubechies wavelets. In particular, we prove that the gain in sampling density (splines vs. Daubechies)

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom