| In this paper we propose two feature extraction techniques, termed DCT-mod and DCT-delta, for use in an illumination invariant face based identity veri cation system. We compare the performance of the proposed techniques against two standard methods: Principal Component Analysis (PCA) and the 2-D Discrete Cosine Transform (DCT). Experiments on the VidTIMIT database support the use of the prop...

INTRODUCTION DCT image compression. The discrete cosine transform (DCT) is a standard method by which images may be compressed. Initially, the image is divided into 8x8-pixel blocks, each of which is then transformed into its DCT, which is an 8x8 matrix of coefficients. Each coefficient cij , specifies the magnitude of a DCT frequency (or basis function), indexed by i, j . For brevity, we adopt...

This paper presents a new superscalar architecture for fast discrete cosine transform (DCT). Comparing with the general SIMD architecture, it speeds up the DCT computation by a factor of two at the cost of small additional hardware overheads.

Digital image watermarking is the insertion of watermarks into digital media. Several types methods used are Discrete Cosine Transform (DCT) and Fourier (DFT). Both these work in frequency domain (transform). using carried out on coefficient. This study 30 data as material for watermaking analysis with 10 each binary, grayscale color images jpg, png bmp formats. binary domains conversions from ...

In this paper, we propose a new one-dimensional (1D) integer discrete cosine transform (Int-DCT) for unified lossless/lossy image compression. The proposed 1D Int-DCT is newly designed to reduce rounding effects by minimizing number of rounding operations. The proposed Int-DCT can be operated not only lossless coding for a high quality decoded image but also lossy coding for a compatibility wit...

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

Two dimensional (2D) discrete cosine transform (DCT) are widely used as the transform method in most of video and image coding area. In general, 2D separable DCT is effective for smoothed regions of which components are highly correlated. When the block to be transformed has directional edges or a few values, however, 2D transform can yield worse performance than 1D transform. This drawback is ...

In this paper, a generalized output pruning algorithm for matrixvector multiplication is proposed first. Then the application of the proposed pruning algorithm to compute pruning Discrete Cosine Transform (DCT) is addressed. It is shown that, for a given decomposition of the matrix of the transform kernel and the pruning pattern, the unnecessary operations for computing an output pruning DCT ca...

In this paper we present a reconfigurable 16 Approximation of discrete cosine transform (DCT) using 8 point additions with less number of calculations. Most of the existing algorithms for approximation of the DCT target only the DCT of small transform lengths, and some of them are non-orthogonal. This paper presents a generalized recursive algorithm to obtain orthogonal approximation of DCT whe...