due to its simplicity radix-2 is a popular algorithm to implement fast fourier transform. radix - 2 p algorithms have the same order of computational complexity as higher radices algorithms, but still retain the simplicity of radix-2 . by defining a new concept, twiddle factor template , in this paper we propose a method for exact calculation of multiplicative complexity for radix-2 p algorithm...

s is a time-frequency transform based on the concept of short-time fourier transform and wavelet transform. the main property of this transform that separate it from the discrete short-time fourier transform is variable frequency resolution. but in this transform the change of resolution of high frequencies to low frequencies is very high. so another transform as a modified s transform is intro...

This paper introduces variations on the template matching theme that extend its usefulness by providing invariance to mean intensity-level variations, certain geometric transformations and partial obscura-tions of the target object in the image. First order statistics of the pixel by pixel diierences between the template and the image are used as a match measure in order to provide invariance t...

Leaf identification is a challenging research. So far, many approaches have been proposed. In this paper, an approach that combines Fourier descriptors with other shape features was investigated to identify 100 hundred kinds of leaves. The result shows that the combination of Fourier descriptors and several other shape features can be used to identify leaves with the accuracy rate of 88%. This ...

The fractional Fourier transform (FRT) is shown to be of potential use in analyzing the motion of a surface by use of holographic interferometry. The extra degree of freedom made available by the use of the FRT allows information regarding both translational and tilting motion to be obtained in an efficient manner.

We show an accurate procedure to obtain a Fourier transform (FT) with no dc term using a commercial twisted-nematic liquid-crystal display. We focus on the application to holographic storage of binary data pages, where a drastic decrease of the dc term in the FT is highly desirable. Two different codification schemes are considered: binary pi radians phase modulation and hybrid ternary modulati...

The problem of recovering signals from partial fractional Fourier transform information arises in wave propagation problems where the measured information is partial, spread over several observation planes, or not of sufficient spatial resolution or accuracy. This problem can be solved with the method of projections onto convex sets, with the convergence of the iterative algorithm being assured...

The problem of recovering signals from partial fractional Fourier transform information arises in wave propagation problems where the measured information is partial, spread over several observation planes, or not of sufficient spatial resolution or accuracy. This problem can be solved with the method of projections onto convex sets, with the convergence of the iterative algorithm being assured...

The ath-order fractional Fourier transform is a generalization of the ordinary Fourier transform such that the zeroth-order fractional Fourier transform operation is equal to the identity operation and the first-order fractional Fourier transform is equal to the ordinary Fourier transform. This paper discusses the relationship of the fractional Fourier transform to harmonic oscillation; both co...