Logo
Search for

Volume 99, Issue 2, Pages 172-178 (August 2010)


View previous. 5 of 8 View next.

B-LUT: Fast and low memory B-spline image interpolation

David SarrutabcCorresponding Author Informationemail address, Jef Vandemeulebrouckeabc

Received 15 July 2009; received in revised form 24 November 2009; accepted 24 November 2009.

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.

a Université de Lyon, F-69622 Lyon, France

b Creatis, CNRS UMR 5220, F-69622 Villeurbanne, France

c Léon Bérard Cancer Center, 28 rue Laennec, F-69373 Lyon cedex 08, France

Corresponding Author InformationCorresponding author at: Léon Bérard Cancer Center, CREATIS, 28 rue Laennec, F-69373 Lyon cedex 08, France. Tel.: +33 478785151.

PII: S0169-2607(09)00303-4

doi:10.1016/j.cmpb.2009.11.013


View previous. 5 of 8 View next.