A method is presented for the compression of biomedical images using in place of the discrete cosine transform (DCT) the discrete orthogonal Gauss-Hermite transform (DOGHT). The latter expands the signals on a basis of Gauss-Hermite functions instead of the cosine functions and leads, in many practical cases, to 2-3 times better compression for the same reconstruction error as the DCT. This is ...

Abstract: In paper two types of the discrete cosine (and sine) transforms (DCT/DST) are analyzed. These transforms are useful for many applications. It is shown that if an operator, connected with the Discrete Fourier Transform (DFT), is referred to an appropriate basis it takes block-diagonal form. These blocks coincide with DCT-2/DST-2 for even dimensions of the signals’ space and with DCT6/D...

We study factorization techniques and performance of Discrete Cosine Transforms of various sizes (including nondyadic and odd numbers). In our construction we utilize an array of known techniques (such as Heideman's mapping between odd-sized DCT and DFT, Winograd fast DFT algorithms, prime-factoring, etc), and also propose a new decimation strategy for construction of even-sized scaled transfor...

<span>When compressing a video, the architecture is provided with width and height of frame along video as input. The multiple transform selection (MTS) techniques are used to compress video. Traditional discrete cosine transforms (DCT) other trigonometric (sine cosine) transforms, such DCT-8 DST-7, included in pool transforms. For best outcomes, two additional transforms-DST-2 DCT-5-were...

The discrete cosine transform (DCT) is a Fourier-related transform similar to the discrete Fourier transform (DFT), but using only real numbers. It is equivalent to a DFT of roughly twice the length, operating on real data with even symmetry (since the Fourier transform of a real and even function is real and even), where in some variants the input and/or output data are shifted by half a sampl...

This paper presents two matrix factorizations for recursive pruned discrete cosine transforms. Both factorizations have lower computational complexity when compared to the method of El-Sharkawy and Eshmawy (1995). ( 1998 Elsevier Science B.V. All rights reserved.

Image compression is the need of modern digital image processing devices to save larger images.By using the image compression algorithms which has better performance of compression. In this, implementing the compression technique which works on discrete cosine transform (DCT) image sub-block and use of fuzzy logic. There are so many techniques for compression but in this paper only present and ...

Many discrete transforms, such as the discrete cosine transform (DCT), are derived from sets of orthonormal polynomials. These sets of polynomials all possess recursion relationships, derived from a classic identity. In this paper, this recursion is used to derive generalized systolic arrays for the forward and inverse transform operations.