In this paper we propose the discrete cosine transform (DCT) mod 2 feature set, which utilizes polynomial coe2cients derived from 2D DCT coe2cients obtained from spatially neighboring blocks. Face veri%cation results on the multi-session VidTIMIT database suggest that the DCT-mod 2 feature set is superior (in terms of robustness to illumination direction changes and discrimination ability) to f...

Compression of 2 dimensional data is important for the efficient transmission, storage and manipulation of Images. The most common technique used for lossy image compression relies on fast application of the Discrete Cosine Transform (DCT). The cosine transform has been heavily researched and many efficient methods have been determined and successfully applied in practice; this paper presents a...

In this research, Böhler K340 cold work tool steel was subjected to three different heat treatment protocols, conventional (CHT), shallow cryogenic (SCT), and deep (DCT). The study compares the effect of SCT DCT on microstructure consequently selected mechanical properties (micro- macroscale hardness impact toughness). shows no significant difference in after treatments. However, microhardness ...

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

─ The Discrete Tchebichef Transform (DTT) based on orthogonal Tchebichef polynomials can be an alternative to Discrete Cosine Transform (DCT) for JPEG image compression standard. The properties of DTT are not only very similar to DCT; it has also higher energy compactness and lower computational advantage using a set of recurrence relation. Through extensive simulation, image reconstruction acc...

2-D Discrete Cosine Transform (DCT) applies on image data compression and saves more memories. In this paper, we use fast DCT algorithm, and propose a parallel-pipelined architecture to implement a 8 8× DCT/IDCT processor. This architecture involves two 8-point DCT processors, dual-bank of SRAM (128 words) and the coefficient ROM, three multiplexers, timing controller and 7-bit counter. The ker...

DCT-based image/video coding is still popular now. In this paper, a novel embedded image coding scheme based on integer reversible DCT is proposed. It integrates lossy and lossless coding schemes perfectly. The transform is implemented by factoring the float DCT transform matrix into a series of integer reversible transform matrices. We apply the series of matrices to image samples, and encode ...

In this paper, modeling of optimized Discrete Cosine Transform (DCT) with reduced hardware and implementation of JPEG Image compression in MATLAB is presented. DCT is the heart of the JPEG image compression. The computation of DCT is hardware intensive and power consumption is also very high. In JPEG Image Compression pipeline, a quantizer follows the DCT. Such structural pipeline is advantageo...

Alternative fully DCT-based video codec architectures have been proposed in the past to address the shortcomings of the conventional hybrid motion compensated DCT video codec structures traditionally chosen as the basis of implementation of standardcompliant codecs. However, no prior effort has been made to ensure interoperability of these two drastically different architectures so that fully D...

Image up-sampling in the discrete cosine transform (DCT) domain is a challenging problem because DCT coefficients are de-correlated, such that it is nontrivial to estimate directly high-frequency DCT coefficients from observed low-frequency DCT coefficients. In the literature, DCT-based up-sampling algorithms usually pad zeros as high-frequency DCT coefficients or estimate such coefficients wit...