Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Journal articles
  4. Fast Computation of Polyharmonic B-Spline Autocorrelation Filters
 
research article

Fast Computation of Polyharmonic B-Spline Autocorrelation Filters

Barbotin, Yann
•
Van De Ville, Dimitri  
•
Blu, Thierry  
Show more
2008
Ieee Signal Processing Letters

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.

  • Files
  • Details
  • Metrics
Loading...
Thumbnail Image
Name

barbotin0801.pdf

Access type

openaccess

Size

242.17 KB

Format

Adobe PDF

Checksum (MD5)

949308a4ca12060173dd1a2e52f301df

Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés