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.
Sarrut, D & Vandemeulebroucke, J 2010, 'B-LUT: Fast and low memory B-spline image interpolation', Computer Methods and Programs in Biomedicine, vol. 99, no. 2, pp. 172-178. https://doi.org/10.1016/j.cmpb.2009.11.013
Sarrut, D., & Vandemeulebroucke, J. (2010). B-LUT: Fast and low memory B-spline image interpolation. Computer Methods and Programs in Biomedicine, 99(2), 172-178. https://doi.org/10.1016/j.cmpb.2009.11.013
@article{9659c6616eec4695a037665492c69f10,
title = "B-LUT: Fast and low memory B-spline image interpolation",
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.",
keywords = "Algorithms, Computer Graphics, Image Interpretation, Computer-Assisted, Image Processing, Computer-Assisted, Imaging, Three-Dimensional, Signal Processing, Computer-Assisted, Tomography, X-Ray Computed",
author = "David Sarrut and Jef Vandemeulebroucke",
note = "2009 Elsevier Ireland Ltd. All rights reserved.",
year = "2010",
month = aug,
doi = "10.1016/j.cmpb.2009.11.013",
language = "English",
volume = "99",
pages = "172--178",
journal = "Computer Methods and Programs in Biomedicine",
issn = "0169-2607",
publisher = "Elsevier",
number = "2",
}