visual servoing is generally contained of control and feature tracking. study of previous methods shows that no attempt has been made to optimize these two parts together. in kernel based visual servoing method, the main objective is to combine and optimize these two parts together and to make an entire control loop. this main target is accomplished by using lyapanov theory. a lyapanov candidat...

introduction: an efficient method of tomographic imaging in nuclear medicine is positron emission tomography (pet). compared to spect, pet has the advantages of higher levels of sensitivity, spatial resolution and more accurate quantification. however, high noise levels in the image limit its diagnostic utility. noise removal in nuclear medicine is traditionally based on fourier decomposition o...

there are two methods for identifying formation interface in oil wells: core analysis, which is a precise approach but costly and time consuming, and well logs analysis, which petrophysists perform, which is subjective and not completely reliable. in this paper, a novel coupled method was proposed to detect the formation interfaces using gr logs. second approximation level (a2) of gr log gained...

The spectrum of the convolution of two continuous functions can be determined as the continuous Fourier transform of the cross-correlation function. The same can be said about the spectrum of the convolution of two infinite discrete sequences, which can be determined as the discrete time Fourier transform of the cross-correlation function of the two sequences. In current digital signal processi...

We develop efficient fast Fourier transform algorithms for pricing and hedging discretely sampled variance products and volatility derivatives under additive processes (time-inhomogeneous Lévy processes). Our numerical algorithms are non-trivial versions of the Fourier space time stepping method to nonlinear path dependent payoff structures, like those in variance products and volatility deriva...

_.a conventional prime factor discrete Fourier transform (DFT) algorithm is used to realize a discrete Fourier-like transform on the finite fieM, GF(qg ). A pipeline structure is used to implement this prime factor DFT over GF(qn). This algorithm is developed to compute cyclic convolutions of complex numbers and to decode ReedSolomon codes. Such a pipeline fast prime factor DFT algorithm over G...

in this article, by using a partial on locally compact semi-direct product groups, we present a compatible extension of the fourier transform. as a consequence, we extend the fundamental theorems of abelian fourier transform to non-abelian case.

Spectrally Efficient FDM systems (SEFDM) promise increased spectral utilization at the cost of receiver complexity. In this paper, new reception arrangement for SEFDM system is proposed and analyzed. The signal demodulation is based on the subcarrier structure of the signal. Simple implementation based on the Discrete Fourier Transform (DFT) is introduced, thus significantly reducing the comple...