Related Experiment Video
Updated: Jul 7, 2026

06:25
Time Multiplexing Super Resolving Technique for Imaging from a Moving Platform
Published on: February 12, 2014
The fast discrete Radon transform. I. Theory
1Sch. of Electr. Eng., Georgia Inst. of Technol., Atlanta, GA.
Summary
This study introduces a new image reconstruction method using a generalized discrete Radon transform (DRT). The novel approach overcomes limitations of previous algorithms, enabling faster and more accurate image reconstruction from projections.
Area of Science:
- Image processing
- Computational mathematics
- Medical imaging
Background:
- The discrete Radon transform (DRT) is crucial for image reconstruction from projections.
- Existing inversion algorithms, like Beylkin's (1987), struggle with steep slopes and nonlinear variations.
- These limitations hinder accurate image reconstruction in various scientific fields.
Purpose of the Study:
- To present a novel inversion scheme for image reconstruction using the slope-intercept form of the DRT.
- To overcome the dispersion and inversion limitations of prior DRT algorithms.
- To develop fast, generalized algorithms for both forward and inverse Radon transforms.
Main Methods:
- Formulating a discrete computation of the continuous Radon transform.
- Deriving generalized inversion methods that address shortcomings of previous algorithms.
- Developing generalized forward (FRT) and inverse (IFRT) algorithms.
Main Results:
- The proposed generalized inversion methods effectively overcome limitations of earlier DRT algorithms.
- The new algorithms eliminate the need for interpolation calculations.
- Direct conversion between raster scan grids and rectangular/polar grids is achieved in a single step.
Conclusions:
- The developed generalized FRT and IFRT algorithms offer a significant advancement in image reconstruction.
- These methods provide faster, more accurate, and versatile image reconstruction capabilities.
- The approach is applicable to various fields requiring image reconstruction from projections.
Related Concept Videos
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)log2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
The computational efficiency of the FFT becomes...
Discrete-time Fourier transform
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...
Properties of DTFT I
In signal processing, Discrete-Time Fourier Transforms (DTFTs) play a critical role in analyzing discrete-time signals in the frequency domain. Various properties of the DTFTs such as linearity, time-shifting, frequency-shifting, time reversal, conjugation, and time scaling help understand and manipulate these signals for different applications.
The linearity property of DTFTs is fundamental. If two discrete-time signals are multiplied by constants a and b respectively, and then combined to...
The linearity property of DTFTs is fundamental. If two discrete-time signals are multiplied by constants a and b respectively, and then combined to...
Properties of DTFT II
In the study of discrete-time signal processing, understanding the properties of the Discrete-Time Fourier Transform (DTFT) is crucial for analyzing and manipulating signals in the frequency domain. Several properties, including frequency differentiation, convolution, accumulation, and Parseval's relation, offer powerful tools for signal analysis.
The frequency differentiation property is illustrated by considering a DTFT pair and differentiating both sides with respect to ω. Multiplying by j...
The frequency differentiation property is illustrated by considering a DTFT pair and differentiating both sides with respect to ω. Multiplying by j...
Discrete Fourier Transform
The Discrete Fourier Transform (DFT) is a fundamental tool in signal processing, extending the discrete-time Fourier transform by evaluating discrete signals at uniformly spaced frequency intervals. This transformation converts a finite sequence of time-domain samples into frequency components, each representing complex sinusoids ordered by frequency. The DFT translates these sequences into the frequency domain, effectively indicating the magnitude and phase of each frequency component present...
Region of Convergence
The z-transform is a powerful mathematical tool used in the analysis of discrete-time signals and systems. It is a crucial tool in the analysis of discrete-time systems, but its convergence is limited to specific values of the complex variable z. This range of values, known as the Region of Convergence (ROC), is fundamental in determining the behavior and stability of a system or signal. The ROC defines the region in the complex plane where the z-transform converges, which can take various...

