Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Backprojection with fourier series expansion and FFT

View through CrossRef
AbstractThe filtered backprojection (FBP) method has recently been used for almost all the practical CT scanners because of its simple principle and high accuracy in reconstruction of images. However, it is difficult to use this method for some applications such as a real time display in which images are adjusted during displaying images, since a backprojection of the FBP method requires a very large amount of computation.This paper introduces a method of backprojection in which the projection data compensated by a filter are expanded using Fourier series, and the sum of the series is evaluated by a high‐speed synthesis algorithm of complex exponential using Gaussian functions and the fast Fourier transform (FFT) method. The theory is explained based on a conventional FBP method; then the usefulness of the proposed method is demonstrated. The results show that the proposed method can realize interpolations with various frequency characteristics requiring about one‐sixth the amount of computation compared with a conventional backprojection using a linear interpolation.
Title: Backprojection with fourier series expansion and FFT
Description:
AbstractThe filtered backprojection (FBP) method has recently been used for almost all the practical CT scanners because of its simple principle and high accuracy in reconstruction of images.
However, it is difficult to use this method for some applications such as a real time display in which images are adjusted during displaying images, since a backprojection of the FBP method requires a very large amount of computation.
This paper introduces a method of backprojection in which the projection data compensated by a filter are expanded using Fourier series, and the sum of the series is evaluated by a high‐speed synthesis algorithm of complex exponential using Gaussian functions and the fast Fourier transform (FFT) method.
The theory is explained based on a conventional FBP method; then the usefulness of the proposed method is demonstrated.
The results show that the proposed method can realize interpolations with various frequency characteristics requiring about one‐sixth the amount of computation compared with a conventional backprojection using a linear interpolation.

Related Results

Development of image pattern for textile based on FFT
Development of image pattern for textile based on FFT
PurposeThe purpose of this paper is to research an auto generation method of developing FFT image and image pattern for textile based on FFT theory.Design/methodology/approachIn th...
Fast Fourier Transforms in Electromagnetics
Fast Fourier Transforms in Electromagnetics
This Chapter review the fast Fourier transform (FFT) technique and its application to computational electromagnetics, especially to the fast solver algorithms including the Conjuga...
Introduction
Introduction
Jean Baptiste Joseph Fourier’s powerful idea of decomposition of a signal into sinusoidal components has found application in almost every engineering and science field. An incompl...
Design and Implementation of AGU based FFT Pipeline Architecture
Design and Implementation of AGU based FFT Pipeline Architecture
Abstract Present it is most needful task to get various applications with parallel computations by using a Fast Fourier Transform (FFT) and the derived outputs shoul...
GPU-accelerated 3D backprojection of ALOS SAR data from Greenland
GPU-accelerated 3D backprojection of ALOS SAR data from Greenland
The backprojection algorithm for synthetic aperture radar (SAR) has the ability of focusing raw data and forming an image without requiring simplifying assumptions for the azimuth-...
A fructan: fructan fructosyltransferase activity from Lolium rigidum
A fructan: fructan fructosyltransferase activity from Lolium rigidum
SUMMARYFructan: fructan fructosyltransferase (FFT) activity was purified about 300‐fold from leaves of Lolium rigidum Gaudin by a combination of affinity chromatography, gel filtra...
Query expansion by relying on the structure of knowledge bases
Query expansion by relying on the structure of knowledge bases
Query expansion techniques aim at improving the results achieved by a user's query by means of introducing new expansion terms, called expansion features. Expansion features introd...
Improveing F-beta Score in Classifying Shark Data into Shark Behaviors
Improveing F-beta Score in Classifying Shark Data into Shark Behaviors
One metric used to measure classification performance in machine learning is F-beta score. The objective in this thesis is to improve the average F-b score computed in classifying ...

Back to Top