Fast Computation of Polyharmonic B-Spline Autocorrelation Filters
Y. Barbotin, D. Van De Ville, T. Blu, M. Unser
IEEE Signal Processing Letters, vol. 15, pp. 773–776, 2008.
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.
@ARTICLE(http://bigwww.epfl.ch/publications/barbotin0801.html,
AUTHOR="Barbotin, Y. and Van De Ville, D. and Blu, T. and Unser, M.",
TITLE="Fast Computation of Polyharmonic \mbox{{B}-Spline}
Autocorrelation Filters",
JOURNAL="{IEEE} Signal Processing Letters",
YEAR="2008",
volume="15",
number="",
pages="773--776",
month="",
note="")
© 2008 IEEE. Personal use of this material is permitted. However, permission to
reprint/republish this material for advertising or promotional purposes or for creating
new collective works for resale or redistribution to servers or lists, or to reuse any
copyrighted component of this work in other works must be obtained from IEEE.
This material is presented to ensure timely dissemination of scholarly and technical work.
Copyright and all rights therein are retained by authors or by other copyright holders.
All persons copying this information are expected to adhere to the terms and constraints
invoked by each author's copyright. In most cases, these works may not be reposted without
the explicit permission of the copyright holder.