We present algorithms for the discrete cosine transform (DCT) and discrete sine transform (DST), of types II and III, that achieve a lower count of real multiplications and additions than previously published algorithms, without sacrificing numerical accuracy. Asymptotically, the operation count is reduced from ∼ 2N log2 N to ∼ 17 9 N log2 N for a power-of-two transform size N . Furthermore, we...

This paper presents a new method in blind digital watermarking based on Discrete Cosine Transform (DCT). The image is quantized in 8×8 blocks, a DCT transform is applied to each block and a collection containing the first two AC coefficients from the DCT transform of the 8×8 image block (coefficient (2,1) and (1,2)) and the bias member, which is zero, is set. The watermark is coded in spread sp...

The discrete Fourier-cosine transform (cos-DFT), the discrete Fourier-sine transform (sin-DFT) and the discrete cosine transform (DCT) are closely related to the discrete Fourier transform (DFT) of real-valued sequences. This paper describes a general method for constructing fast algorithms for the cos-DFT, the sin-DFT and the DCT, which is based on polynomial arithmetic with Chebyshev polynomi...

The prime-factor decomposition is a fast computational technique for many important digital signal processing operations, such as the convolution, the discrete Fourier transform, the discrete Hartley transform, and the discrete cosine transform (DCT). In this paper, we present a new prime-factor algorithm for the DCT. We also design a prime-factor algorithm for the discrete sine transform which...

This paper describes a unified VLSI architecture which can be applied to various types of transforms used in MPEG-2/4, H.264, VC-1, AVS and the emerging new video coding standard named HEVC (High Efficiency Video Coding). A novel design named configurable butterfly array (CBA) is also proposed to support both the forward transform and the inverse transform in this unified architecture. Hadamard...

The main goal of this paper is to embed a watermark in the speech signal, using the three techniques such as Discrete Cosine Transform (DCT) along with Singular Value Decomposition (SVD) and Discrete Wavelet Transform (DWT).In this paper, various combinations were tried for embedding the watermark image into the audio signal such as DWT and SVD, DCT with SVD and DCT, DWT with SVD. Their perform...

A system is presented for transform coding of imagery. Specifically, the system uses the 2-D discrete cosine transform (DCT) in conjunction with adaptive classification, entropy-constrained trelliscoded quantization, optimal rate allocation, and adaptive arithmetic encoding. Adaptive classification, side rate reduction, and rate allocation strategies are discussed. Entropy-constrained codebooks...

In this paper, we present a discuccion on DCT a l g o r i h based on convolutions. It is shown that these approaches can provide effective solutionr to realize DCTS Besides, thqt provide a theoretical lower bound on the number of multiplications required for the realization of DCTs Some fa* shon length DCT alprithms have ah0 been dm'ved f i m thcw approaches.

We propose a new method of “space coding” to transmit the 3-D space as it is. A multi-dimensional DCT is applied to the 4-D data space in which the ray data is filled densely. Experimental results show the relation between the resolution of 4-D data space and the coding performance. 1 はじめに 最近、3次元画像通信や VRに関する研究が注目され つつある。筆者らは、様々な 3次元画像入出力方式を統 一的に取り扱うために、3次元統合画像通信の構想を提 案し [1]、3次元空間の記述方式として、空間を伝搬す...

This paper provides comparison between two image compression technique such as DCT and DWT. Discrete Cosine Transform (DCT) and Discrete Wavelet Transform (DWT) are the most commonly used transformation. DCT has high energy compaction property and requires less computational resources. On the other hand, DWT is multi-resolution transformation. PSNR and Compression ratio are one of the parameter...