Metal oxides play a very important role in many areas of chemistry, physics and materials science.The metal elements are able to form a large diversity of oxide compounds. In this investigation, wesynthesis SnO2 and C,N,S-tridoped SnO2 nanoparticles by precipitation method. The synthesizedSnO2 and C,N,S-tridoped SnO2 nanoparticles were characterized by instrumental analysis methods,such as X-ra...

2D convolution and 2D transforms, such as wavelet transform and discrete cosine transform (DCT), are widely used in image and video processing. To reduce the computation complexity, these algorithms are often implemented in two separable passes of 1D processing (e.g., row-wise processing followed by column-wise processing). For example, the number of multiplications of a direct N x N 2D DCT is ...

In this paper radix-2 algorithms for computation of type-II discrete cosine transform (DCT) and discrete sine transform (DST) of length N = 2 (n ≥ 2) are presented. The DCT/DST can be computed from two DCT/DST sequences, each of length N/2. The odd-indexed output components of DCT/DST can be realized using simple recursive relations. The proposed algorithms require a reduced number of arithmeti...

We present a new way of obtaining the Bargmann transform between L 2 (R n) and the Fock space F = F(C n) via a simple restriction principle applied to holo-morphic functions. This same principle also recovers the transform between functions on a compact Lie group and holomorphic functions on its complexii-cation studied by Gross, Hall, Hijab et al., see 1] and 2], and it gives in a similar way ...

where a(u, v) denotes the standard deviation of a coefficient. The inverse transform is given by The maximum coefficient value for the cosine transform can be derived from (1) as (3) (2) for w = <P for w = 1, 2, "', N-1. [ (2j + 1)U1T] [(2k + 1)V1T] • cos cos 2N 2N 1 !v' 2 I X I! p(x; u , v) = exp-Vi a(u, v) a(u, v) 1 C(w) = Vi N-1N-1 fO, k) = ~ ~ C(u)C(v)F(u, v) u=O v=O for i, k = 0, 1, "', N-...

We present an O(N log2 N) algorithm for the computation of the first N coefficients in the expansion of an analytic function in ultraspherical polynomials. We first represent expansion coefficients as an infinite linear combination of derivatives and then as an integral transform with a hypergeometric kernel along the boundary of a Bernstein ellipse. Following a transformation of the kernel, we...

This paper proposes a new memory system called shuffle memory. The shuffle memory is a generalization of transposition memory that has been widely used in 2-D Discrete Cosine Transform and Discrete Fourier Transform. The shuffle memory is the first memory system that receives M N inputs in row major while providing M N outputs in column major order using only M N memory space. Shuffle memory ca...

A fast Fourier transform (FFT) is an efficient algorithm to compute the discrete Fourier transform (DFT) of an input vector. Efficient means that the FFT computes the DFT of an n-element vector in O(n logn) operations in contrast to the O(n2) operations required for computing the DFT by definition. FFTs exist for any vector length n and for real and higher-dimensional data. Parallel FFTs have b...

This document describes the implementation of several features previously developed[2], extending the 2D scale invariant feature transform (SIFT)[4, 5] for images of arbitrary dimensionality, such as 3D medical image volumes and time series, using ITK1. Specifically, we provide a scale invariant implementation of a weighted histogram of gradient feature, a rotationally invariant version of the ...

In this paper‎, ‎using the discrete Fourier transform in the finite-dimensional Hilbert space C^n‎, ‎a class of nonRieszable equal norm tight frames is introduced ‎and‎ using this class, a bound for Fiechtinger Conjecture is presented. By the Fiechtinger Conjecture that has been proved recently, for given A,C>0 there exists a universal constant delta>0 independent of $n$ such that every C-equal...