Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Reconstruction of Signal using Interpolation

Reconstruction of Signal using Interpolation

Signal processing techniques are essential for accurately converting continuous signals to digital formats and vice versa. When a continuous signal is sampled with a period T, the resulting sampled signal exhibits replicas of the original spectrum in the frequency domain, spaced at intervals equal to the sampling frequency. To handle this sampled signal, a zero-order hold method can be applied, which creates a piecewise constant signal by retaining each sample's value until the next sampling...

Fast Fourier Transform

Fast Fourier Transform

The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...

Upsampling

Upsampling

Managing signal sampling rates is essential in digital signal processing to maintain signal integrity. A decimated signal, characterized by a reduced frequency range due to its lower sampling rate, can be upsampled by inserting zeros between each sample. This upsampling process expands the original spectrum and introduces repeated spectral replicas at intervals dictated by the new Nyquist frequency. To refine this zero-inserted sequence, it is passed through a lowpass filter with a cutoff...

Boundary Conditions: Lossless Lines

Boundary Conditions: Lossless Lines

Consider a single-phase, two-wire, lossless transmission line terminated by an impedance at the receiving end and a source with Thevenin voltage and impedance at the sending end. The line, with length, has a surge impedance and wave velocity determined by the line's inductance and capacitance.
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

Linear Approximations

For a differentiable function of two variables, linear approximation estimates values near a known point by replacing the curved surface with its tangent plane. Consider the function\begin{equation*}f(x,y)=x^2+3y^2\end{equation*}near the point (2, 1). The exact value at this point is f(2, 1) = 22 + 3(1)2 = 4 + 3 = 7.The linear approximation of f(x, y)) near (a, b) is\begin{equation*}L(x,y)=f(a,b)+f_x(a,b)(x-a)+f_y(a,b)(y-b)\end{equation*}First, compute the partial derivatives: fx(x, y) = 2x and...

Downsampling

Downsampling

When considering a sampled sequence with zero values between sampling instants, one can replace it by taking every N-th value of the sequence. At these integer multiples of N, the original and sampled sequences coincide. This process, known as decimation, involves extracting every N-th sample from a sequence, thereby creating a more efficient sequence.
The Fourier transform of the decimated sequence reveals a combination of scaled and shifted versions of the original spectrum. This...

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by

Same author

Perceptual quality assessment in digital pathology: Modeling diagnostic usability from expert opinions.

Computer methods and programs in biomedicine·2026

Same author

Evaluation of a quasi-automatic treatment planning workflow for head-and-neck cancer in radiotherapy.

Physics and imaging in radiation oncology·2026

Same author

Enhancing automatic landmark localization in X-ray images using combined segmentation and regression models: application to lower limb alignment assessment.

Scientific reports·2026

Same author

Free flight angular acceptance (FFAA) variance reduction technique for SPECT Monte Carlo simulations.

Physics in medicine and biology·2026

Same author

Prognostic Value of <i>O</i>-(2-<sup>18</sup>F-Fluoroethyl)-l-Tyrosine PET for Patients with Recurrent Glioblastoma.

Journal of nuclear medicine : official publication, Society of Nuclear Medicine·2026

Same author

Clinically aligned whole-body MRI segmentation of skeletal metastases via Supervised Anatomical Pretraining.

Journal of bone oncology·2026

Search research articles

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

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

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

David Sarrut¹, Jef Vandemeulebroucke

¹Université de Lyon, France. david.sarrut@creatis.insa-lyon.fr

Computer Methods and Programs in Biomedicine

|December 26, 2009

Summary

This summary is machine-generated.

We developed a faster B-spline calculation method using precomputed weights in a look-up table (B-LUT). This approach significantly reduces computation time for image processing while maintaining high accuracy, offering a practical acceleration for B-spline applications.

More Related Videos

High-plex Imaging using Spectral Confocal Microscopy to Minimize Non-specific Tissue Fluorescence

High-plex Imaging using Spectral Confocal Microscopy to Minimize Non-specific Tissue Fluorescence

Published on: October 28, 2025

Related Experiment Videos

Last 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

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

High-plex Imaging using Spectral Confocal Microscopy to Minimize Non-specific Tissue Fluorescence

High-plex Imaging using Spectral Confocal Microscopy to Minimize Non-specific Tissue Fluorescence

Published on: October 28, 2025

Area of Science:

Computer Vision
Image Processing
Numerical Analysis

Background:

B-splines are fundamental in image processing for interpolation and transformation.
Conventional B-spline calculations can be computationally intensive, limiting real-time applications.
Existing acceleration methods often require substantial memory resources.

Purpose of the Study:

To introduce a computationally efficient alternative to traditional B-spline calculations.
To reduce the computational time for B-spline transformations in image processing.
To offer a memory-efficient acceleration technique for B-spline applications.

Main Methods:

Developed a B-spline approximation using precomputed weights stored in a look-up table (B-LUT).
Implemented nearest-neighbor retrieval of weights from the B-LUT for rapid B-spline indirect transformations.
Evaluated accuracy and performance against conventional B-splines in the ITK toolkit for image intensity interpolation.

Main Results:

Achieved a significant reduction in computation time, with speedups of 5-6 times compared to conventional B-splines.
Demonstrated that B-LUTs can provide highly accurate B-spline approximations.
The method exhibits low memory requirements and offers user-controlled accuracy for approximate calculations.

Conclusions:

The proposed B-LUT method offers a fast and accurate alternative for B-spline calculations in image processing.
This technique provides a practical solution for accelerating B-spline transformations with minimal memory overhead.
Freely available source code compatible with the ITK toolkit facilitates community adoption and further research.