Convolution and correlation are very basic image processing operations with numerous applications ranging from image restoration to target detection to image resampling and geometrical transformation. In real time applications, the crucial issue is the processing speed, which implies mandatory use of algorithms with the lowest possible computational complexity. Fast image convolution and correl...

Methidathion, a non-systemic organophosphorous insecticide and acaricide is studied at the hanging mercury drop electrode under cathodic stripping mode by means of cyclic and square-wave voltammetry (SWV). Its electrode reaction is analyzed in the light of recent theory of cathodic stripping processes of insoluble salts of SWV. Its complex electrode mechanism is described by an electrode reacti...

It is shown that number theoretic transforms (NTT) can be used to compute discrete Fourier transform (DFT) very efficiently. By noting some simple properties of number theory and the DFT, the total number of real multiplications for a length-P DFT is reduced to (P — 1). This requires less than one real multiplication per point. For a proper choice of transform length and NTT, the number of shif...

Cyclic voltammetry was used to explore the adsorption behavior of secnidazole on a hanging mercury drop electrode (HMDE). The effects of various operational parameters on the accumulation behavior of the adsorbed species were tested. Thus, a sensitive stripping voltammetry procedure for the determination of secnidazole with an adsorptive accumulation on the surface of HMDE has been developed. M...

Elimination voltammetry with linear scan (EVLS) represents the fast and simple improvement of linear-sweep or cyclic voltammetric results. Through the various elimination functions, EVLS offers a new tool not also for better understanding of complex electrochemical processes on the surface of working electrodes, but also for improving the sensitivity of electrochemical measurements. The paper i...

A mathematical theory on the computational complexity of the Discrete Fourier Transform (DFT) is required, independently of any kind of known Fast Fourier Transform (FFT) algorithm.

This paper is part 4 in a series of papers about the Discrete Fourier Transform (DFT) and the Inverse Discrete Fourier Transform (IDFT). The focus of this paper is on spectral leakage. Spectral leakage applies to all forms of DFT, including the FFT (Fast Fourier Transform) and the IFFT (Inverse Fast Fourier Transform). We demonstrate an approach to mitigating spectral leakage based on windowing...

Realization of focus Speakers produced words differently in the two focus conditions Acoustic features indicate high word prominence Classification Experiments Discrimination of two focus classes with ~65% correct for individual features (acoustic or visual) Exception f0: 65-83% (depending on speaker) Exception nose features: at chance level Significant AV gain when combining energy and FFT or ...

Uncertainty principles for functions defined on finite Abelian groups generally relate the cardinality of a function to the cardinality of its Fourier transform. We examine how the cardinality of a function is related to the cardinality of its short–time Fourier transform. We illustrate that for some cyclic groups of small order, both, the Fourier and the short–time Fourier case, show a remarka...

In this paper we discuss one dimensional scattering and inverse scattering for the Helmholtz equation on the half line from the point of view of the layer stripping. By full or nonlinear scattering, we mean the transformation between the index of refraction (actually half of its logarithmic derivative) and the reflection coefficient. We refer to this mapping as nonlinear scattering, because the...