• JSTS:Journal of Semiconductor Technology and Science
• /
• v.16 no.4
• /
• pp.497-505
• /
• 2016

The two-dimensional (2D) Discrete Cosine Transform (DCT) is used widely in image and video processing systems. The perception of human visualization permits us to design approximate rather than exact DCT. In this paper, we propose a digital implementation of 16-point approximate 2D DCT architecture based on one-dimensional (1D) DCT and Modified Gate Diffusion Input (MGDI) technique. The 8-point 1D Approximate DCT architecture requires only 12 additions for realization in digital VLSI. Additions can be performed using the proposed 8 transistor (8T) MGDI Full Adder which reduces 2 transistors than the existing 10 transistor (10T) MGDI Full Adder. The Approximate MGDI 2D DCT using 8T MGDI Full adders is simulated in Tanner SPICE for $0.18{\mu}m$ CMOS process technology at 100MHZ.The simulation result shows that 13.9% of area and 15.08 % of power is reduced in the 8-point approximate 2D DCT, 10.63 % of area and 15.48% of power is reduced in case of 16-point approximate 2D DCT using 8 Transistor MGDI Full Adder than 10 Transistor MGDI Full Adder. The proposed architecture enhances results in terms of hardware complexity, regularity and modularity with a little compromise in accuracy.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.10
• /
• pp.2403-2408
• /
• 2015

For image data the discrete cosine transform (DCT) has comparable energy compaction capability to Karhunen-Loeve transform (KLT) which is optimal. Hence DCT has been widely accepted in various image and video compression standard such as JPEG, MPEG-2, and MPEG-4. Recently some approximate DCT's have been reported, which can be computed much faster than the original DCT because their coefficients are either zero or the power of 2. Although the level of energy compaction is slightly degraded, the approximate DCT's can be utilized in real time implementation of image or visual compression applications. In this paper, an approximate 8-point DCT which contains 17 non-zero power-of-2 coefficients and high energy compaction capability comparable to DCT is proposed. Transform coding experiments with several images show that the proposed transform outperforms the published works.

• Journal of Information Processing Systems
• /
• v.6 no.1
• /
• pp.67-78
• /
• 2010

In this study, a clustering algorithm that uses DCT transformed data is presented. The algorithm is a grid density-based clustering algorithm that can identify clusters of arbitrary shape. Streaming data are transformed and reconstructed as needed for clustering. Experimental results show that DCT is able to approximate a data distribution efficiently using only a small number of coefficients and preserve the clusters well. The grid based clustering algorithm works well with DCT transformed data, demonstrating the viability of DCT for data stream clustering applications.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.5
• /
• pp.1329-1336
• /
• 1996

In many image compression applications, the discrete cosine transform (DCY) is well known for is highly efficient coding performance. However, it produces undesirable block artifacts in low-bit rate coding. In addition, in many practical applications, faster computation and easier VLST implementation of DCT coefficients are also important issues. The removal of the block artifacts and faster DCT computation are therefor of practical interest. In this paper, a modified DCTcomputation scheme was investigated, which provides a simple efficient solution to the reduction of the block artifacts while achieving faster computation. We have applied the new ap-proach to the low-bit rate coding and decoding of images. Simulation results on real images have verified the improved performance of the proposed method over the standar d method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.7
• /
• pp.1860-1868
• /
• 1998

A simple postprocessing algorithm is proposed to reduce the blocky artifacts of Block Discrete Cosine Transform (BDCT) coded images. Since the block noise is mostly antisymmetric relative to the block boundaries, we model the blocky noise as one-dimensional antisymmertric functions made by superposing DCT basis functions. observing the frequency characteristics of the noies model, we approximate its high frequency components as those of step functions. Then the proposed postprocessing algorithm eliminates the carefully selected high frequency components of step functions in the one-dimensional sN-point DCT domain, when the encoding block size is $N\;{\times}\;N$. It is shown that the proposed algorithm can also be performed in the spatial domain without computational burden of transforms. The experimental results show that the proposed algorithm well reduces the blocky artifacts in both subjective and objectie viewpoints.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2000.05a
• /
• pp.392-397
• /
• 2000

An Interlaced 2D field images compression technique by Discrete Wavelet Transform is proposed. The result has a good image resolution and compression rate, PSNR, and reduces processing time of compression. PSNR depends on the exponential function corresponding to 2 power N has higher 30% than DCT. And It is easier to process the inter-frame and fast to work a second with each parallel field processing, and more be able to approximate a frame on the field.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.22 no.6
• /
• pp.41-45
• /
• 1985

A suboptimum block quantization method is investigated for efficent transform coding. In our study the following method has appeared as suboptimum. At first, optimum bit allocation is done assuming the varances of the transform coefficients are known. Secndly, a varance estimation algorithm which results from the approximate equations governing the optimum vit alllocation is applied. The better performance of the proposed block quantization method has been confirmed by simulations based on varous pdf assumptions. the results indicate that the proposed method yields overall improvements of about 25% in NMSE for both the symmetric nonuniform and uniform quantizer at the coding rate of 1 bit/pel.

• The KIPS Transactions:PartB
• /
• v.11B no.1
• /
• pp.27-34
• /
• 2004

This paper proposes a method to trace and interpret a moving object based on the information which can be directly obtained from MPEG-2 compressed video stream without decoding process. In the proposed method, the motion flow is constructed from the motion vectors included in compressed video. We calculate the amount of pan, tilt, and zoom associated with camera operations using generalized Hough transform. The local object motion can be extracted from the motion flow after the compensation with the parameters related to the global camera motion. Initially, a moving object to be traced is designated by user via bounding box. After then automatic tracking Is performed based on the accumulated motion flows according to the area contributions. Also, in order to reduce the cumulative tracking error, the object area is reshaped in the first I-frame of a GOP by matching the DCT coefficients. The proposed method can improve the computation speed because the information can be directly obtained from the MPEG-2 compressed video, but the object boundary is limited by macro-blocks rather than pixels. Also, the proposed method is proper for approximate object tracking rather than accurate tracing of an object because of limited information available in the compressed video data.