نتایج جستجو برای: fast fourier transform

تعداد نتایج: 353482  

1997
Isaac Amidror

The class of second-order curvilinear gratings consists of all the curvilinear gratings that are obtained by second-order spatial transformations of periodic gratings. It includes, for example, circular, elliptic, and hyperbolic gratings as well as circular, elliptic, and hyperbolic zone plates. Such structures occur quite frequently in optics, and their Fourier transforms may arise, for instan...

2006
PAUL H. KOESTER

We give a discussion of harmonic analysis on finite abelian groups, emphasizing various ways in which the structure of the group is encoded on various spaces of functions, ways in which the Fourier transform detects and preserves these structures. We discuss the major tools, like convolutions and Fourier transforms, along with some fundamental theorems, like the Plancheral, Parseval, Fourier in...

Journal: :Annales UMCS, Informatica 2006
Piotr Kopniak

The following paper presents the results of tests conducted by the author in the field of verification of influence of JPEG lossy compression on the robustness of data hiding methods used for the colour image which has been transformed to the frequency domain. The data have been embedded to the Fourier magnitude spectrum of the image. The possibility of decoding the hidden data with two embeddi...

2017
John C. Bowman Zayd Ghoggali

An efficient algorithm for computing the one-dimensional partial fast Fourier transform fj = ∑c(j) k=0 e Fk is presented. Naive computation of the partial fast Fourier transform requires O(N) arithmetic operations for input data of length N . Unlike the standard fast Fourier transform, the partial fast Fourier transform imposes on the frequency variable k a cutoff function c(j) that depends on ...

Journal: :Pattern Recognition 2010
Hae Yong Kim

We consider brightness/contrast-invariant and rotation-discriminating template matching that searches an image to analyze A for a query image Q. We propose to use the complex coefficients of the discrete Fourier transform of the radial projections to compute new rotation-invariant local features. These coefficients can be efficiently obtained via FFT. We classify templates in “stable” and “unst...

Blinking and eye movement are one of the most important abilities that most people have, even people with spinal cord problem. By using this ability these people could handle some of their activities such as moving their wheelchair without the help of others. One of the most important fields in Human-Robot Interaction is the development of artificial limbs working with brain signals. The purpos...

2007
M. Gai

Image computation is a fundamental tool for performance assessment of astronomical instrumentation, usually implemented by Fourier transform techniques. We review the numerical implementation, evaluating a direct implementation of the discrete Fourier transform (DFT) algorithm, compared with fast Fourier transform (FFT) tools. Simulations show that the precision is quite comparable, but in the ...

This paper is concerned with a synthesis study of the fast Fourier transform (FFT), the short time Fourier transform (STFT and the Wigner distribution (WD) in analysing the phonocardiogram signal (PCG) or heart cardiac sounds.     The FFT (Fast Fourier Transform) can provide a basic understanding of the frequency contents of the heart sounds. The STFT is obtained by calculating the Fourier tran...

1997
DAVID P. BLECHER

We show that every scalar valued continuous function f(g) on a compact group G may be written as f(g) = 〈Φ(g)ξ, η〉 for all g ∈ G, where ξ, η are vectors in a separable Hilbert space H, and Φ(g) is a strongly continuous unitary valued function on G which is a product of unitary representations and antirepresentations of G on H. This product is countable, but always converges uniformly on G. More...

Journal: :IEEE Trans. Pattern Anal. Mach. Intell. 1995
Lance M. Kaplan C.-C. Jay Kuo

The 2D fractional Brownian motion (fBm) model provides a useful tool to model textured surfaces whose roughness is scale-invariant. To represent textures whose roughness is scaledependent, we generalize the fBm model to the extended selfsimilar (ESS) model in this research. We present an estimation algorithm to extract the model parameters from real texture data. Furthermore, a new incremental ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید