• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.12
• /
• pp.1236-1248
• /
• 1991

A new fast algorithm for computing the discrete cosine transform(DCT) Is developed decomposing N-point DCT into an N /2-point DCT and two N /4 point transforms(transpose of an N /4-point DCT. TN/t'and)It has an important characteristic that in this method, the roundoff noise power for a fixed point arithmetic can be reduced significantly with respect to the wellknown fast algorithms of Lee and Chen. since most coefficients for multiplication are distributed at the nodes close to the output and far from the input in the signal flow graph In addition, it also shows three other versions of factorization of DCT matrix with the same number of operations but with the different distributions of multiplication coefficients.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.157-160
• /
• 2003

In this paper. we propose a simple and effective video scene change detection algorithm using a 3-D DCT. The 3-D DCT that we employ is a 2$\times$2$\times$2 DCT has simple computations composed only of adding and shifting operations. The simple average values of multiresolution represented video using the 2$\times$2$\times$2 DCT are used as a detection feature vector.

• Journal of Korea Multimedia Society
• /
• v.1 no.2
• /
• pp.194-203
• /
• 1998

In this paper, a new DCT-VQ method is proposed which can solve the problems of VQ such as the degradation of edge and enormous calculations. VQ is carried in DCT domain but spatial domain in order to protect the degradation of edge. DCT makes high correlated image data decorrelated and the energy concentrated on a few coefficients. In DCT domain, the DC coefficient is quantized with 8 bits uniform scalar quantizer and the AC coefficients are divided to three regions and coded with vector qiantizer for considering edge components. For the decrease of the calculation and memory, the vectors for three region have small dimension of $1{\times}7$ and use the same codebook. Thus, the proposed method can fully express the edge components by considering AC coefficients in DCT domain and decrease the calculation and memory be reducing the dimension of vectors.

• Journal of Korea Society of Industrial Information Systems
• /
• v.20 no.5
• /
• pp.53-60
• /
• 2015

In this paper, the DCT based lossless image compression system which selects a limited number of DCT coefficients is proposed for the Lenna, Camerman, and Baboon image. The number of DCT coefficients to obtain a suitable image quality for the reconstructed image is computed by simulation. The image size of $256{\times}256$ are used in the experiment. The PSNR values for the reconstructed image by selecting limited number of DCT coefficients are found. It is shown that the minimun number of the coefficients for Lenna, Cameramen Baby and Babbo image to obtain PSNR=30 are N=16, 32, 37, 55, respectively. The result can provide the guideline of the importance of the DCT coefficient toward the compression for the tested image of the Lena, Cameraman, and Baboon.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.2
• /
• pp.97-102
• /
• 2008

In this paper, we address the OFDM based on DFT or DCT in Cognitive Radio system. An adaptive OFDM based on DFT or DCT in Cognitive Radio system has the capacity to nullify individual carriers to avoid interference to the licensed users. Therefore, there could be a considerably large number of zero-valued inputs/outputs for the IDFT/DFT or IDCT/DCT on the OFDM transceiver. Hence, the standard methods of DFT and DCT are no longer efficient due to the wasted operations on zero. Based on this observation, we present a transform decomposition on two dimensional(2-D) systolic array for IDFT/DFT and IDCT/DCT, this algorithm can achieve an efficient computation for OFDM in Cognitive Radio system

• The Journal of the Korea Contents Association
• /
• v.11 no.1
• /
• pp.9-15
• /
• 2011

Zero-watermarking is a digital watermarking technique that can escape from data distortion and quality degradation by no watermark insertion into digital images to be watermarked. This paper proposes DCT0CRT, a CRT-based zero-watermarking technique in the domain of DCT. One of the DC and low-frequency AC coefficients of each DCT block chosen in chaotic way from an image is selected by testing whether it satisfies the CRT-based condition matching with the watermark bit to be embedded. Such selection information forms a key to extract the watermark from the watermarked image. Experimental results show that the image quality watermarked by DCT0CRT is better than that watermarked by any other CRT-based watermarking techniques and the inserted watermark is robust against some common attacks such as sharpening, blurring, and JPEG lossy compression.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2072-2075
• /
• 2003

This paper is studied the high speed processing moving picture encodec to compress and encode a moving picture by real time. This is used the new motion vector search algorithm with smallest search point in H.263 encodec, and is applied the integer DCT for the encodec by converting a moving picture. The integer DCT behaves DCT by the addition operation of the integer using WHT and a integer lifting than conventional DCT that needs the multiplication operation of a floating point number. Therefore, the integer DCT can reduce the operation amount than basis DCT with having an equal PSNR because the multiplication operation of a floating point number does not need.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.34C no.9
• /
• pp.22-32
• /
• 1997

This paper proposes an imprecise compuitation model for DCT considering QOS of images and a two dimensional DCT architecture for imprecise computations. In case that many processes are scheduling in a hard real time system, the system resources are shared among them. Thus all processes can not be allocated enough system resources (such as processing power and communication bandwidth). The imprecise computtion model can be used to provide scheduling flexibility and various QOS(quality of service)levels, to enhance fault tolerance, and to ensure service continuity in rela time systems. The DCT(discrete cosine transform) is known as one of popular image data compression techniques and adopted in JPEG and MPEG algorithms since the DCT can remove the spatial redundancy of 2-D image data efficiently. Even though many commercial data compression VLSI chips include the DCST hardware, the DCT computation is still a very time-consuming process and a lot of hardware resources are required for the DCT implementation. In this paper the DCT procedure is re-analyzed to fit to imprecise computation model. The test image is simulated on teh base of this model, and the computation time and the quality of restored image are studied. The row-column algorithm is used ot fit the proposed imprecise computation DCT which supports pipeline operatiions by pixel unit, various QOS levels and low speed stroage devices. The architecture has reduced I/O bandwidth which could make its implementation feasible in VLSI. The architecture is proved using a VHDL simulator in architecture level.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2019.11a
• /
• pp.249-251
• /
• 2019

In the ongoing standardization of Versatile Video Coding (VVC), DCT-2, DST-7 and DCT-8 are designated as the vital primary transform kernels. Due to the effectiveness of DST-4 and DCT-4 in smaller resolution sequences, DST-4 and DCT-4 transform kernel can also be used as the replacement of the DST-7 and DCT-8 transform kernel respectively. While storing all of those transform kernels, ROM memory storage is considered as the major issue. So, to deal with this scenario, a unified DST-3 based transform kernel derivation method is proposed in this paper. The transform kernels used in this paper is DCT-2, DST-4 and DCT-4 transform kernels. The proposed ROM memory required to store the matrix elements is 1368 bytes each of 8-bit precision.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.2
• /
• pp.17-22
• /
• 2014

Watermarking is one of the methods that insist on a copyright as it append digital signals in digital informations like still mobile image, video, other informations. This paper proposed an improved DCT-based watermarking scheme using quantized coefficients of image. This process makes quantized coefficients through a Discrete Cosine Transform and Quantization. The watermark is embedded into the quantization coefficients in accordance with location(key). The quantized watermarked coefficients are converted to watermarked image through the inverse quantization and inverse DCT. Watermark extract process only use watermarked image and location(key). In watermark extract process, quantized coefficients is obtained from watermarked image through a DCT and quantization process. The quantized coefficients select coefficients using location(key). We perform it using inverse DCT and get the watermark'. Simulation results are satisfied with high quality of image (PSNR) and Normalized Correlation(NC) from the watermarked image and the extracted watermark.