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.
Cite this item
Barbotin, Y., Van De Ville, D., Blu, T., & Unser, M. (2008). Fast Computation of Polyharmonic B-Spline Autocorrelation Filters. IEEE Signal Processing Letters, 15, 773–776. https://doi.org/10.1109/LSP.2008.2006714
Click Copy to copy the citation, or select the text manually.
barbotin0801.pdf
openaccess
242.17 KB
Adobe PDF
949308a4ca12060173dd1a2e52f301df