Publication

Fast Computation of Polyharmonic B-Spline Autocorrelation Filters

Michaël Unser, Dimitri Nestor Alice Van De Ville, Thierry Blu
2008
Journal Articles

Abstract

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.

Official source

https://infoscience.epfl.ch/entities/publication/e97de68b-54f1-42a6-b93c-765e41aec7e8

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Fast Computation of Polyharmonic B-Spline Autocorrelation Filters

Chat with Graph Search

Verification of the Fourier-enhanced 3D finite element Poisson solver of the gyrokinetic full-f code PICLS

Impact of beam-coupling impedance on the Schottky spectrum of bunched beam

Stability of the Faber-Krahn inequality for the short-time Fourier transform