• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.5
• /
• pp.464-473
• /
• 2001

Since DCT algorithm divides an image into blocks uniformly in both the spatial domain and the frequency domain, it has a weak point that it can not reflect HVS(Human Visual System) efficiently To avoid this problem, we propose a new algorithm, which combines only the merits of DCT and wavelet transform. The proposed algorithm uses the high compaction efficiency of DCT, and applies wavelet transform mode to DCT coefficients, so that the algorithm can utilize interband and intraband correlations of wavelet simultaneously After that, the proposed algorithm quantizes each coefficient based on the characteristic of each coefficient's band. In terms of coding method, the quantized coefficients of important DCT coefficients have symmetrical distribution, the bigger that value Is, the smaller occurrence probability is. Using the characteristic, we propose a new still image coding algorithm of symmetric and bidirectional tree structure with simple algorithm and fast decoding time. Comparing the proposed method with JPEG, the proposed method yields better image quality both objectively and subjectively at the same bit rate.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.1 no.3
• /
• pp.97-103
• /
• 2008

In this paper, $256{\times}256$ input image is classified into a validity block and an edge block of $8{\times}8$ block for image compression. DCT(Discrete Cosine Transform) is executed only for the DC coefficient that is validity coefficients for a validity block. Predict the position where a quantization coefficient becomes 0 for an edge block, I propose new algorithm to execute DCT in the reduced region. Not only this algorithm that I proposed reduces computational complexity of FDCT(Forward DCT) and IDCT(Inverse DCT) and decreases encoding time and decoding time. I let compressibility increase by accomplishing other stability verticality zigzag scan by the block size that was classified for each block at the time of huffman encoding each. In addition, the algorithm that I suggested reduces Run-Length by accomplishing the level verticality zigzag scan that is good for a classified block characteristic and, I offer the compressibility that improved thereby.

• The KIPS Transactions:PartA
• /
• v.12A no.4 s.94
• /
• pp.313-320
• /
• 2005

The 2-D discrete cosine transform (DCT) is an integral part of video and image processing; it is used in both the PEG and MPEG enciding standards. As streaming video is brought to mobile devices, it becomes important that it is possible to calculate the DCT in an energy-efficient manner. In this paper, we present a new algorithm the DCT with a linear array PEs. This design is optimized for energy efficiency. We analyze the energy, area, and latency tradeoffs available with this design and then compare its energy dissipation, area, and latency to those of Xilinx's optimized IP core.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.6
• /
• pp.1-9
• /
• 2010

In this paper, we propose an efficient compression method of the integral images. The integral imaging is a well-known technique to represent and record three-dimensional images. The proposed method is based on three dimensional discrete cosine transform (3D-DCT). The 3D-DCT techniques for the integral images have been reported as an efficient coding method for the integral images which reduces the redundancies between adjacent elemental images. The proposed method is a compression method efficient to integral images using adaptive block mode(ABM), based on the 3D-DCT technique. In the ABM, 3D-DCT blocks adaptive to the characteristics of integral images are constructed, which produces variable block size 3D-DCT blocks, and then 3D-DCTs for the 3D blocks are performed. Experimental results show that the proposed method gives significant improvement in coding efficiency. Especially, at the high bit-rates, the proposed method is more excellent since the overhead incurred by the proposed method take less part of the total bits.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.57 no.6
• /
• pp.1069-1074
• /
• 2008

This paper presents an efficient architecture for $2^n$-point DCT algorithm. The proposed approach makes use of the fact that, in most DCT applications, the scaling operation in the DCT unit can be eliminated and combined with the scaling operation in the quantizer unit. This important property is efficiently exploited with the CORDIC(COordinate Rotation DIgital Computer) algorithm to produce a regular architecture suitable for VLSI implementation. Although there have been several attempts to exploit CORDIC algorithm in developing DCT architectures, the proposed approach provides the most efficient way for scaled DCT applications by completely eliminating the scale factor compensation.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.175-178
• /
• 2003

This paper proposes a stereo image insertion technique on DCT coefficients using the embedded method developed in the digital watermarking in due consideration of compatibility with conventional 2D system such JPEG, and MPEG. In conventional transmission method users with conventional digital TV cannot watch the transmitted 3D image sequence as 2D image, because of affectivity of conventional 3D image compression. To give an answer, in this paper, DCT coefficients are changed according to its disparity on YCbCr channels. Our method can insert stereo images into a conventional image compression method based on DCT.

• Proceedings of the IEEK Conference
• /
• 2002.06d
• /
• pp.235-238
• /
• 2002

This paper presents a way of a novel FPGA implementation of DCT. It shows how to limit the required bits on each DCT processing step, instead of implementing high-cost 64-bit floating-point arithmetic of IEEE Std 754-1985 on FPGA. ID-DCT implementation has been done which operates at 30 frame per second with 1920${\times}$1080 resolution.

• Journal of Korea Multimedia Society
• /
• v.16 no.10
• /
• pp.1163-1170
• /
• 2013

Digital watermarking techniques have been used as one of the means for copyright protection and authentication of multimedia data. Conventional Chinese Remainder Theorem(CRT)-based spatial domain watermarking techniques do not perform well under JPEG compression. However, it is seen that the CRT-based watermarking technique in Discrete Cosine Transform(DCT) domain performs well for JPEG compression. In this paper, an improved CRT-based image watermarking method in the DCT domain is proposed. The proposed method provides better robustness which decreases changes of absolute difference of residues against rounding errors due to DCT conversion and various attacks. Experimental results show that the proposed method has a good robustness against various attacks compared with the conventional CRT-based watermarking in DCT domain.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.6
• /
• pp.773-778
• /
• 1993

A new approach is proposed for the DCT which is widely utilized in the image processing, The approach replaces mutiplications with shift and additions, In the image restored by the proposed DCT and IDCT, no visible degration is observed and PSNR(Peak to Peak Signal to Noise Ratio) is greater than 35 dB for all cases, proving the usefulness of the proposal.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.6C
• /
• pp.594-599
• /
• 2007

In this paper, we present new representation of DCT/DFT matrices via one hybrid architecture. Based on a element inverse matrix factorization algorithm, we show that the DCT and DFT have a same recursive computational pattern, and we can develop an hybrid architecture by using some diagonal matrices.