FPGA Implementation of the Coupled Filtering Method and the Affine Warping Method
IEEE Transactions on Nanobioscience
|May 24, 2017
Summary
Field-programmable gate array (FPGA) implementations accelerate ultrasound speckle tracking for tissue elasticity analysis. This approach overcomes computational challenges, offering significant speed improvements over graphics processing unit (GPU) methods.
Area of Science:
- Medical imaging
- Biomedical engineering
- Ultrasound technology
Background:
- Speckle tracking is crucial for ultrasound-based tissue elasticity analysis.
- Feature-motion decorrelation and high computational complexity limit current methods, even with GPU acceleration.
Purpose of the Study:
- To develop and evaluate Field-Programmable Gate Array (FPGA) implementations of coupled filtering and affine warping methods for enhanced ultrasound speckle tracking.
- To address the computational bottlenecks of existing high-deformation tissue analysis techniques.
Main Methods:
- Reformulation of algorithms for efficient pipelining on FPGAs.
- Development of a fast, memory-saving image warping approach tailored for FPGA architecture.
- Implementation and testing on a Xilinx Virtex-7 FPGA platform.
Main Results:
- FPGA-based implementations significantly accelerate strain estimation in ultrasound image analysis.
- Achieved speedup of at least 13 times compared to a high-performance GPU (NVIDIA GeForce GTX 580).
- Demonstrated the effectiveness of FPGAs in handling complex image processing for speckle tracking.
Conclusions:
- FPGA acceleration provides a viable solution for computationally intensive ultrasound speckle tracking methods.
- The proposed FPGA approach enhances the efficiency of tissue elasticity analysis, particularly for large deformations.
- This work paves the way for real-time, high-performance ultrasound elastography.
Related Concept Videos
Reconstruction of Signal using Interpolation
795
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...
795
Linear Approximation in Frequency Domain
408
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....
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....
408
Linear Approximation in Time Domain
386
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,...
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length,...
386
Fast Fourier Transform
1.0K
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)log2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
The computational efficiency of the FFT becomes...
1.0K
Aliasing
717
Accurate signal sampling and reconstruction are crucial in various signal-processing applications. A time-domain signal's spectrum can be revealed using its Fourier transform. When this signal is sampled at a specific frequency, it results in multiple scaled replicas of the original spectrum in the frequency domain. The spacing of these replicas is determined by the sampling frequency.
If the sampling frequency is below the Nyquist rate, these replicas overlap, preventing the original...
If the sampling frequency is below the Nyquist rate, these replicas overlap, preventing the original...
717
Discrete-time Fourier transform
1.2K
The Discrete-Time Fourier Transform (DTFT) is an essential mathematical tool for analyzing discrete-time signals, converting them from the time domain to the frequency domain. This transformation allows for examining the frequency components of discrete signals, providing insights into their spectral characteristics. In the DTFT, the continuous integral used in the continuous-time Fourier transform is replaced by a summation to accommodate the discrete nature of the signal.
One of the notable...
One of the notable...
1.2K


