Results 21 to 30 of about 316,193 (316)
, 2018 As shown in Chap. 3, any application of Fourier methods leads to the evaluation of a discrete Fourier transform of length N (DFT(N)). Thus the efficient computation of DFT(N) is very important. Therefore this chapter treats fast Fourier transforms. A fast Fourier transform (FFT) is an algorithm for computing the DFT(N) which needs only a relatively low
Plonka, Gerlind +7 more
openaire +3 more sources
Arbitrary Sampling Fourier Transform and Its Applications in Magnetic Field Forward Modeling
Applied Sciences, 2022 Numerical simulation and inversion imaging are essential in geophysics exploration. Fourier transform plays a vital role in geophysical numerical simulation and inversion imaging, especially in solving partial differential equations.
Shikun Dai +4 more
doaj +1 more source
Separation of Variables and the Computation of Fourier Transforms on Finite Groups, II [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 We present a general diagrammatic approach to the construction of efficient algorithms for computingthe Fourier transform of a function on a finite group.
David Maslan +2 more
doaj +1 more source
Are there approximate fast fourier transforms on graphs? [PDF]
2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2016 Signal processing on graphs is a recent research domain that seeks to extend classical signal processing tools such as the Fourier transform to irregular domains given by a graph. In such a graph setting, a way to rapidly apply the Fourier transform, i.e. a Fast Fourier Transform (FFT), is lacking.
Le Magoarou, Luc, Gribonval, Rémi
openaire +5 more sources
A Multi-Resolution Texture Image Retrieval Using Fast Fourier Transform
The Journal of Engineering Research, 2010 Texture is an important visual property that characterizes a wide range of natural and artificial images which makes it a useful feature for retrieving images. Several approaches have been proposed to describe the texture contents of an image.
A. Abdesselam
doaj +1 more source
Fast computation of magnetostatic fields by Non-uniform Fast Fourier Transforms [PDF]
Applied Physics Letters 93, 13 (2008) 132508, 2008 The bottleneck of micromagnetic simulations is the computation of the long-ranged magnetostatic fields. This can be tackled on regular N-node grids with Fast Fourier Transforms in time N logN, whereas the geometrically more versatile finite element methods (FEM) are bounded to N^4/3 in the best case.
arxiv +1 more source
Multi‐institutional study on image quality for a novel CBCT solution on O‐ring linac
Journal of Applied Clinical Medical Physics, EarlyView.Abstract Introduction This work presents a multi‐institutional study on image quality provided by a novel cone beam computed tomography (CBCT). The main goal is to investigate the consistency of imaging performance across multiple institutions.
Luis Agulles‐Pedrós +11 more
wiley +1 more source
Fast algorithms for nonuniform Chirp-Fourier transform
AIMS MathematicsThe Chirp-Fourier transform is one of the most important tools of the modern signal processing. It has been widely used in the fields of ultrasound imaging, parameter estimation, and so on.
Yannan Sun , Wenchao Qian
doaj +1 more source
Journal of Applied Clinical Medical Physics, EarlyView.Abstract Purpose To compare image quality and clinical utility of a T2‐weighted (T2W) 3‐dimensional (3D) fast spin echo (FSE) sequence using deep learning reconstruction (DLR) versus conventional reconstruction for rectal magnetic resonance imaging (MRI).
Dan Nguyen +11 more
wiley +1 more source
PhotonicsThe previously proposed cascaded inverse fast Fourier transform/fast Fourier transform (IFFT/FFT)-based point-to-multipoint (P2MP) flexible optical transceivers have the potential to equip future intensity modulation and direct detection (IMDD) optical ...
Lin Chen +7 more
doaj +1 more source