Fast Computation of Polyharmonic B-Spline Autocorrelation Filters

A fast computational method is given for the Fourier transform of the polyharmonic B-spline autocorrelation sequence in d dimensions. The approximation error is exponentially decaying with the number of terms taken into account. The algorithm improves speed upon a simple truncated-sum approach. Moreover, it is virtually independent of the spline's order. The autocorrelation filter directly serves for various tasks related to polyharmonic splines, such as interpolation, orthonormalization, and wavelet basis design.


Published in:
Ieee Signal Processing Letters, 15, 773-776
Year:
2008
Publisher:
Institute of Electrical and Electronics Engineers
ISSN:
1070-9908
Keywords:
Laboratories:




 Record created 2010-11-30, last modified 2018-01-28

External links:
Download fulltextURL
Download fulltextn/a
Rate this document:

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