B-LUT: Fast and low memory B-spline image interpolation
Related Experiment Video
Updated: Jun 17, 2026

Rapid Setup of Tissue Microarray and Tiled Area Imaging on the Multiplexed Ion Beam Imaging Microscope Using the Tile/SED/Array Interface
Published on: September 15, 2023
David Sarrut1, Jef Vandemeulebroucke
1Université de Lyon, France. david.sarrut@creatis.insa-lyon.fr
Abstract:
We propose a fast alternative to B-splines in image processing based on an approximate calculation using precomputed B-spline weights. During B-spline indirect transformation, these weights are efficiently retrieved in a nearest-neighbor fashion from a look-up table, greatly reducing overall computation time. Depending on the application, calculating a B-spline using a look-up table, called B-LUT, will result in an exact or approximate B-spline calculation. In case of the latter the obtained accuracy can be controlled by the user. The method is applicable to a wide range of B-spline applications and has very low memory requirements compared to other proposed accelerations. The performance of the proposed B-LUTs was compared to conventional B-splines as implemented in the popular ITK toolkit for the general case of image intensity interpolation. Experiments illustrated that highly accurate B-spline approximation can be obtained all while computation time is reduced with a factor of 5-6. The B-LUT source code, compatible with the ITK toolkit, has been made freely available to the community.
Related Concept Videos
Reconstruction of Signal using Interpolation
Fast Fourier Transform
The computational efficiency of the FFT becomes...
Upsampling
Boundary Conditions: Lossless Lines
At the receiving end, the boundary condition states that the voltage equals the product of the receiving-end impedance and current. This relationship is expressed as a function of the incident and...
Linear Approximations
Downsampling
The Fourier transform of the decimated sequence reveals a combination of scaled and shifted versions of the original spectrum. This...
