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.


Publié dans:
Ieee Signal Processing Letters, 15, 773-776
Année
2008
Publisher:
Institute of Electrical and Electronics Engineers
ISSN:
1070-9908
Mots-clefs:
Laboratoires:




 Notice créée le 2010-11-30, modifiée le 2019-12-05

n/a:
Télécharger le documentPDF
Lien externe:
Télécharger le documentURL
Évaluer ce document:

Rate this document:
1
2
3
 
(Pas encore évalué)