We propose a computationally-efficient variant of the shapeadaptive discrete cosine transform (SA-DCT) currently considered for MPEG-4. Although the SA-DCT complexity is acceptable for 8 8 blocks, it is very high when complete regions are processed at once. To reduce the SA-DCT complexity, we replace its 1-D DCT with a quasi-DCT algorithm and we assure that the quasi-DCT basis functions are ver...

PURPOSE Dynamic contour tonometry (DCT) is a new technique to measure intraocular pressure (IOP). In several studies no correlation between IOP values and corneal thickness was shown with DCT. This is in contrast to the gold standard, Goldmann applanation tonometry (GAT). The authors evaluated the reproducibility (RP) of DCT compared to GAT, a prerequisite for its introduction into clinical rou...

In this research work, a literature review was conducted to assess the progress made in the field of image compression effects on the face recognition. The DCT algorithms were considered for the review and their application was limited only to JPEG compression. In this review, progress was made in the DCT algorithms of a single image, and a series images from a video, namely 2D DCT and 3D DCT r...

DCT transform is widely used in audio and image compression and is the basis for compression JPEG and MPEG standards. In this report, we present implementations of 8x8 2-D DCT algorithm used in JPEG standard. In section II a fast algorithm using only eleven multipliers for 1-D DCT is discussed. Then the algorithm of 2-D DCT based on 1-D DCT is derived. Section IV will demonstrate different arch...

Abstract Image resizing is widely demanding in various applications such as image transmissions in the computer network and image display for the different resolution of display devices. The subband DCT (discrete cosine transforms) is a multiple-resolution structure in which the signal is decomposed into low-frequency and high-frequency subband signals to improve the computational complexity an...

Graph filtering is a fundamental tool in graph signal processing. Polynomial filters (PGFs), defined as polynomials of operator, can be implemented the vertex domain, and usually have lower complexity than frequency domain filter implementations. In this paper, we focus on design for graphs with Fourier transform (GFT) corresponding to discrete trigonometric (DTT), i.e., one 8 types cosine tran...

In the standardization of versatile video coding (VVC), discrete cosine transform (DCT)-2, sine (DST)-7, and DCT-8 are regarded as primary kernels. However, DST-4 DCT-4 can also be considered kernels instead using DST-7 owing to their effectiveness in smaller resolution test sequences. To implement these different block size kernels, a considerable amount memory has allocated. Moreover, consump...

This paper illustrates the simulation of Vedic multiplier in 2D DCT. The input data is first divided into NxN blocks, each block s of 8x8 size and 2-D DCT is applied on each of these 8x8 block and 2-D DCT is applied to reconstruct the image. The proposed 2-D DCT design uses Urdhva Tiryagbhyam a Vedic multiplication sutra and the Simulations with MATLAB prove that the proposed design is compared...

Discrete Cosine Transform (DCT) is widely used in image and video compression standards. This paper presents low-power co-ordinate rotation digital computer (CORDIC) based reconfigurable discrete cosine transform (DCT) architecture. All the computations in DCT are not equally important in generating the frequency domain output. Considering the important difference in the DCT co-efficient the nu...

The goal of image compression is to remove the redundancies for minimizing the number of bits required to represent an image while any type of compression like DWT,DCT,DFT, steganography works by embedding the secret data in redundancies of the image in invisibility manner. In this paper we increase image compression is done by hybrid (DCT+DWT) transform. MATLAB programs were written for DCT,DW...