Fast Fourier transform (FFT)-based computations can be far more accurate than the slow transforms suggest. Discrete Fourier transforms computed through the FFT are far more accurate than slow transforms, and convolutions computed via FFT are far more accurate than the direct results. However, these results depend critically on the accuracy of the FFT software employed, which should generally be...

An approach for three robust and semi-blind digital video watermarking algorithms has been proposed in this paper. These algorithms are based on hybrid transforms using the combination of Discrete Cosine Transform and Singular Value Decomposition (DCTSVD), Discrete Wavelet Transform and Singular Value Decomposition (DWT-SVD) and Discrete Wavelet Transform, Discrete Cosine Transform and Singular...

Each Discrete Cosine Transform uses N real basis vectors whose components are cosines. In the DCT-4, for example, the jth component of v k is cos(j + 1 2)(k + 1 2) N. These basis vectors are orthogonal and the transform is extremely useful in image processing. If the vector x gives the intensities along a row of pixels, its cosine series P c k v k has the coeecients c k = (x; v k)=N. They are q...

This paper proposes some early results concerning the combination of Discrete Cosine Transforms (DCTs) of multiple sizes in a video encoder. The main difficulty consists in finding a way to obtain a fair competition between several transforms. For that purpose, we derive that the quantization of all transformed coefficients regardless of the DCT size with the same uniform linear quantizer allow...

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...

The correspondence addresses the intriguing question of which random models are equivalent to the discrete cosine transform (DCT) and discrete sine transform (DST). Common knowledge states that these transforms are asymptotically equivalent to first-order Gauss causal Markov random processes. We establish that the DCT and the DST are exactly equivalent to homogeneous one-dimensional (1-D) and t...

Keywords: Biorthogonal transform Image compression JPEG algorithm All phase biorthogonal transform (APBT) Dual biorthogonal basis vectors Walsh transform (WT) Discrete cosine transform (DCT) Inverse discrete cosine transform (IDCT) Peak signal to noise ratio (PSNR) a b s t r a c t This paper proposes new concepts of the all phase biorthogonal transform (APBT) and the dual biorthogonal basis vec...

We present a novel technique for efficient coding of texture to be mapped on 3D landscapes. The technique enables to stream the data across the network using a back-channel. The use of Wavelet and Discrete Cosine Transforms is investigated and compared. This technology has been proposed has a tool for the emerging MPEG-4 standard.

In the present paper polynomial interpolating scaling function and wavelets are constructed by using the interpolation properties of de la Vallée Poussin kernels with respect to the four kinds of Chebyshev weights. For the decomposition and reconstruction of a given function efficient algorithms based on fast discrete cosine and sine transforms are proposed.

A CORDIC based processor array which can be programmed by switch settings to compute the Discrete Hariley, Cosine or Sine lhnsforms or their inverses is described. Through a novel formulation of the transform computations in the CORDIC framework, N-point transforms are mapped on to a linear a m y of [XJ +1 CORDIC processors with minimal control owedead to incorporate the programmability.