Results 221 to 230 of about 1,921,662 (293)

Bayesian Image Analysis in Fourier Space. [PDF]

J Am Stat Assoc
Kornak J, Young K, Friedman E, Bakas K.
europepmc   +1 more source

Multi-scale optical scanning holography for robust manipulation detection in satellite images. [PDF]

Sci Rep
Khairy M.
europepmc   +1 more source

Selective Pt-S Anchoring at Interfacial Defects for Atom-Economical Solar Hydrogen Production. [PDF]

Adv Mater
Zheng C, Liu T, Wang D, Zhang S, Meng L, Huang Y, Li L.   +6 more
europepmc   +1 more source

Application of solid modeling techniques for geometric simulation of surface topography in boring operations. [PDF]

Sci Rep
Mehrabinasab M, Moetakef-Imani B, Fallah M.   +2 more
europepmc   +1 more source

Research on computational propagation and identification of mine microseismic signals based on deep learning. [PDF]

PLoS One
Liu D, Zhang J, Zhao B, Gao L, Zhou H, Cheng Z, Chen L, Li M.   +7 more
europepmc   +1 more source

The discrete fractional Fourier transform based on the DFT matrix

Signal Processing, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ahmet Serbes, Lutfiye Durak-Ata
exaly   +6 more sources

Some of the next articles are maybe not open access.

Related searches:

Efficient parallel algorithms for optical computing with the discrete Fourier transform (DFT) primitive

Applied Optics, 1997
Optical-computing technology offers new challenges to algorithm designers since it can perform an n-point discrete Fourier transform (DFT) computation in only unit time. Note that the DFT is a nontrivial computation in the parallel random-access machine model, a model of computing commonly used by parallel-algorithm designers. We develop two new models,
J H, Reif, A, Tyagi
openaire   +3 more sources

Properties of the Discrete Fourier Transform (DFT)

1977
This paper will be divided into two parts. The first is intended as a companion to a tutorial session on those basic properties of the DFT which lead to Fast Fourier Transform algorithms. The second part will range more widely, in particular considering ways in which certain less well-known properties of the DFT could be turned to practical use.
B. Conolly
openaire   +2 more sources

Time-frequency scaling property of Discrete Fourier Transform (DFT)

2010 IEEE International Conference on Acoustics, Speech and Signal Processing, 2010
This paper presents the analogue of the time or frequency scaling theorem of continuous time/frequency Fourier Transform (FT) to the realm of Discrete Fourier Transform (DFT). The scaling property applies to scaling by integers which are relatively prime to the length of the DFT. The time reversal property of DFT is identified as a special case of this
Sumit A. Talwalkar, S. Lawrence Marple Jr.   +1 more
exaly   +2 more sources

Eigenvectors of the DFT and discrete fractional fourier transform based on the bilinear transform

2010 IEEE 18th Signal Processing and Communications Applications Conference, 2010
Orthonormal eigenvectors of the DFT matrix, which is closer to the samples of Hermite-Gaussian functions, are crucial to define the discrete fractional Fourier transform. In this work we determine the eigenvectors of the DFT matrix inspired by the bilinear transform.
Lutfiye Durak Ata, Ahmet Serbes
exaly   +2 more sources