Efficient wavelet prefilters with optimal time-shifts
2005 (English)In: IEEE Transactions on Signal Processing, ISSN 1053-587X, E-ISSN 1941-0476, Vol. 53, no 7, 2451-2461 p.Article in journal (Refereed) Published
A wavelet prefilter maps sample values of an analyzed signal to the scaling function coefficient input of standard discrete wavelet transform (DWT) algorithms. The prefilter is the inverse of a certain postfilter convolution matrix consisting of integer sample values of a noninteger-shifted wavelet scaling function. For the prefilter and the DWT algorithms to have similar computational complexity, it is often necessary to use a "short enough" approximation of the prefilter. In addition to well-known quadrature formula and identity matrix prefilter approximations, we propose a Neumann series approximation, which is a band matrix truncation of the optimal prefilter, and derive simple formulas for the operator norm approximation error. This error shows a dramatic dependence on how the postfilter noninteger shift is chosen. We explain the meaning of this shift in practical applications, describe how to choose it, and plot optimally shifted prefilter approximation errors for 95 different Daubechies, Symlet, and B-spline wavelets. Whereas the truncated inverse is overall superior, the Neumann filters are by far the easiest ones to compute, and for some short support wavelets, they also give the smallest approximation error. For example, for Daubechies 1-5 wavelets, the simplest Neumann prefilter provide an approximation error reduction corresponding to 100-10 000 times oversampling in a nonprefiltered system.
Place, publisher, year, edition, pages
2005. Vol. 53, no 7, 2451-2461 p.
Research subject Mathematics
IdentifiersURN: urn:nbn:se:ltu:diva-13797DOI: 10.1109/TSP.2005.849188Local ID: d1722700-a544-11db-8975-000ea68e967bOAI: oai:DiVA.org:ltu-13797DiVA: diva2:986750
Validerad; 2005; 20070116 (evan)2016-09-292016-09-29Bibliographically approved