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...

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...

Linear Approximation in Time Domain

Linear Approximation in Time Domain

Nonlinear systems often require sophisticated approaches for accurate modeling and analysis, with state-space representation being particularly effective. This method is especially useful for systems where variables and parameters vary with time or operating conditions, such as in a simple pendulum or a translational mechanical system with nonlinear springs.
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length, the...

Linearization and Approximation

Linearization and Approximation

Linearization is a mathematical technique used to approximate complex, nonlinear functions with simpler linear models in the vicinity of a chosen reference point. The method is based on the idea that, although a function may be difficult to evaluate exactly, its behavior near a specific input value can often be closely approximated by the tangent line at that point. This approach is particularly useful when small deviations from a known value are involved.Consider the square root function, for...

Linear Approximation in Frequency Domain

Linear Approximation in Frequency Domain

Linear systems are characterized by two main properties: superposition and homogeneity. Superposition allows the response to multiple inputs to be the sum of the responses to each individual input. Homogeneity ensures that scaling an input by a scalar results in the response being scaled by the same scalar.
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear.

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...

You might also read

Related Articles

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

Sort by

Same author

FOXP3-stained image analysis for follicular lymphoma: Optimal adaptive thresholding with maximal nucleus coverage.

Proceedings of SPIE--the International Society for Optical Engineering·2017

Same author

WE-E-217A-02: Methodologies for Evaluation of Standalone CAD System Performance.

Medical physics·2017

Same author

Treatment response assessment of head and neck cancers on CT using computerized volume analysis.

AJNR. American journal of neuroradiology·2010

Same author

Computer-aided characterization of mammographic masses: accuracy of mass segmentation and its effects on characterization.

IEEE transactions on medical imaging·2002

Same author

Analysis of temporal changes of mammographic features: computer-aided classification of malignant and benign breast masses.

Medical physics·2002

Same author

Selection of an optimal neural network architecture for computer-aided detection of microcalcifications--comparison of automated optimization techniques.

Medical physics·2001

Search research articles

Related Experiment Video

Updated: Jul 7, 2026

High-resolution, High-speed, Three-dimensional Video Imaging with Digital Fringe Projection Techniques

High-resolution, High-speed, Three-dimensional Video Imaging with Digital Fringe Projection Techniques

Published on: December 3, 2013

A fast algorithm for backprojection with linear interpolation.

B Sahiner¹, A E Yagle

¹Dept. of Electr. Eng. and Comput. Sci., Michigan Univ., Ann Arbor, MI.

IEEE Transactions on Image Processing : a Publication of the IEEE Signal Processing Society

|January 1, 1993

Summary

This summary is machine-generated.

A new algorithm significantly speeds up image reconstruction by reducing multiplications by 50% during filtered backprojection. This method efficiently processes multiple views together for faster medical imaging.

More Related Videos

Time Multiplexing Super Resolving Technique for Imaging from a Moving Platform

Time Multiplexing Super Resolving Technique for Imaging from a Moving Platform

Published on: February 12, 2014

Related Experiment Videos

Last Updated: Jul 7, 2026

High-resolution, High-speed, Three-dimensional Video Imaging with Digital Fringe Projection Techniques

High-resolution, High-speed, Three-dimensional Video Imaging with Digital Fringe Projection Techniques

Published on: December 3, 2013

Time Multiplexing Super Resolving Technique for Imaging from a Moving Platform

Time Multiplexing Super Resolving Technique for Imaging from a Moving Platform

Published on: February 12, 2014

Area of Science:

Medical Imaging
Computational Science

Background:

Filtered backprojection is crucial for image reconstruction from projections.
The backprojection stage is computationally intensive, dominating processing time.

Purpose of the Study:

To introduce a computationally efficient algorithm for filtered backprojection.
To reduce the computational load, specifically multiplications, in image reconstruction.

Main Methods:

A novel algorithm is proposed that integrates linear interpolation and backprojection.
The method processes multiple projection views (specifically four) concurrently.
This approach aims to decrease the number of multiplications required.

Main Results:

The algorithm achieves a 50% reduction in multiplications during interpolation and backprojection.
There is a minor increase in the number of addition operations.
Implementation examples demonstrate the algorithm's effectiveness.

Conclusions:

The proposed algorithm offers a significant computational speed-up for filtered backprojection.
It provides an efficient method for image reconstruction, particularly in time-sensitive applications.
The approach is extensible to interpolating more than four views, offering further optimization potential.