• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.04a
• /
• pp.250-253
• /
• 2011

Chip manufacture nowadays turned their attention from accelerating uniprocessors to integrating multiple cores on a chip. Moreover desktop graphic hardware is now starting to support general purpose computation. Desktop users are able to use multi-core CPU and GPU as a high performance computing resources these days. However exploiting parallel computing resources are still challenging because of lack of higher programming abstraction for parallel programming. The 2-dimensional discrete cosine transform (2D-DCT) algorithms are most computational intensive part of JPEG encoding. There are many fast 2D-DCT algorithms already studied. We implemented several algorithms and estimated its runtime on multi-core CPU and GPU environments. Experiments show that data parallelism can be fully exploited on CPU and GPU architecture. We expect parallelized DCT bring performance benefit towards its applications such as JPEG and MPEG.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.213-216
• /
• 2003

In this paper, we propose a digital watermarking method using the spread spectrum techniques in DCT domain. Watermark is embedded in the middle band frequencies of 8$\times$8 DCT block. Therefore, we improve image quality and robustness. Experiment results show that the proposed watermark is robust against various attack.

• Journal of Broadcast Engineering
• /
• v.20 no.6
• /
• pp.862-870
• /
• 2015

The RDO (Rate Distortion Optimization) process of HEVC results in good coding efficiency, but relatively requires much encoding time. In order to reduce the encoding time of RDO process, this paper proposes a method of fast intra prediction mode decision using DCT coefficients distributions and the existence of DCT coefficients. The proposed fast Intra coding sets the number of intra prediction mode candidates to three(3) from the RMD (Rough Mode Decision) process in HM16.0 reference SW and reduces the number of candidates one more time by investigating DCT coefficients distribution. After that, if there exists a quantized DCT block having all zero coefficient values for a specific candidate before the RDO process, the candidate is chosen without the RDO process. The proposed method reduces the encoder complexity on average 46%, while the coding efficiency is 2.1% decreased compared with the HEVC encoder.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.15 no.3
• /
• pp.221-231
• /
• 1990

In this paper, A new 2-D DCT algorithm is proposed to reduce the computational amount of transform operation using the distribution of the motion compensated error signal and the bit allocation table. In the this algorithm, 2-D Walsh-Hadamard transform is directly computed and then multiplied by a constant matrix. Multiplications are concentrated on the final stage in thie algorithm, thus the computational amount is reduced in proportion to the number of transform coefficients that are excluded from quatization. The computational amount in computing only the DCT coefficients allocated to the bit allocation table is calculated. As the result, the number of multiplications is less thn the algorithm known to have the fewest number of computations when less than 0.6 bits per pixel are allocated to tranform coding for the motion compensated error image in the case of the proposed algorithm. Thus, it shows that the proposed algorithm is valid in reducing the computational loads of transform coding.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.3C
• /
• pp.250-257
• /
• 2006

In this paper, we propose an efficient algorithm for the RDO mode decision in H.264/AVC encoder. Based on the properties of DCT coefficients and the RDO mode decision processing, we derive a new condition for detecting an error block having all-zero DCT coefficient (AZCB). (I)DCT, (I)Q, and entropy coding are skipped for AZCBs in the proposed algorithm. It makes the reduction of the computational complexity for the RDO mode decision. Simulation results show that the proposed algorithm achieves computational saving over 40% compared to the conventional method.

• Journal of Broadcast Engineering
• /
• v.22 no.3
• /
• pp.321-326
• /
• 2017

High Efficiency Video Coding (HEVC) adopted the Discrete Cosine Transform-II (DCT-II) based interpolation filter to improve coding efficiency in motion compensation and estimation. In HEVC, the interpolation filters based on the DCT-II are composed of 8-point for half-pixel and 7-point for 1/4-pixel and 3/4-pixel. In this paper, a DST-VII based interpolation filter is used improve motion compensation and estimation. The experimental results which applied the DST-VII interpolation filter are presented. They show the 0.45% of average bitrate reduction in Random Access configuration and 0.5% of average bitrate reduction in Low Delay B configuration, respectively.

• 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
• /
• 2001.10a
• /
• pp.571-574
• /
• 2001

In our paper, We propose an efficient adaptive coding method using kohonen neural network. An efficient adaptive encoding method using Kohonen net work is discribed through the analysis of those compression methods with the application of the neural network. In order to increase the compression ratio, a image is first divided into 8*8 subimages, then all subimages are transformed by DCT. These DCT sub-blocks are divided into N(4) classes by Kohonen network. Hits are distributed according to the variance of the DCT sub-block. Thus we get N(4)bit allocation matrices. Excellent performance is shown by the computer simulation. so we found that our proposed method is better then classifing subimages by AC energy.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.43 no.3 s.345
• /
• pp.48-58
• /
• 2006

This paper presents 8x8 two dimensional DCT/IDCT processor of adder-based distributed arithmetic architecture without applying ROM units in conventional memories. To reduce hardware cost in the coefficient matrix of DCT and IDCT, an odd part of the coefficient matrix was shared. The proposed architecture uses only 29 adders to compute coefficient operation in the 2-D DCT/IDCT processor, while 1-D DCT processor consists of 18 adders to compute coefficient operation. This architecture reduced 48.6% more than the number of adders in 8x8 1-D DCT NEDA architecture. Also, this paper proposed a form of new transpose network which is different from the conventional transpose memory block. The proposed transpose network block uses 64 registers with reduction of 18% more than the number of transistors in conventional memory architecture. Also, to improve throughput, eight input data receive eight pixels in every clock cycle and accordingly eight pixels are produced at the outputs.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.6B
• /
• pp.1002-1011
• /
• 2000

In this paper, we propose a multiresolution progressive image transmission with spatial and bit-rate scalabilities using a $2{\times}2$ DCT. The multiresolition image represented by a $2{\times}2$ DCT is used for the progressive image transmission with spatial and bit-rate scalabilities. Because the proposed progressive image transmission method supports both spatial and bit-rate scalabilities, it can be adaptively applied to the receiver's scalability requests. We compare the proposed progressive transmission with that of the higher-order convolution-based Wavelet method. Comparisons show that the proposed method needs much less computations, but insignificant loss of image quality.