• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.2
• /
• pp.97-105
• /
• 1998

Subband/DCT coding has been introduced in order to transmit images of various resultions using one given image-codec, for nowadays there are various grades of quality in visual communication services. However, subband/DCT results in the increawse of multiplication number and memory size. In order to resolve this problem, we propose block-based subband/DCT coding in this paper. In block-based subband/DCT, the number of multiplications is not only reduced because we combine subband decomposistion with DCT, but the size of memory is also reduced because images can be parallel-processed block by block. We show that the number of multiplications is reduced, by analyzing the property ofblock-based subband/DCT matrix mathematically, and examine the performance of proposed coder, which adopts JPEG as backhand-coder after block-based subband/DCT.

• Journal of Broadcast Engineering
• /
• v.12 no.6
• /
• pp.555-564
• /
• 2007

Discrete cosine transform (DCT) coefficient dropping is well recognized as an efficient rate adaptation transcoding in motion-compensated (MC)-DCT based MPEG-compressed videos. However, in this scheme, the errors incurred by the DCT coefficient-dropping are propagated and often result in significant visual quality degradation. This paper presents two propositions describing well the statistical properties of propagated errors. That is, we propose that the DCT error of the current frame is not correlated to the propagated errors of the previous frames. We also propose that the overall distortions in a given frame can be approximated as the sum of the DCT error of the current frame and the propagated errors from the previous frames. Then, it is shown that several computer simulations with different video sequences verify the effectiveness of the proposed statistical analyses.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.3 s.309
• /
• pp.68-75
• /
• 2006

In this paper, we propose an adaptive video watermarking method using human visual system(HVS) and characteristics of three-dimensional cosine transform (3D-DCT) cubes. We classify 3D-DCT cubes into three patterns according to the distribution of coefficients in the 3D-DCT cube: cube with motion and textures, cube with high textures and little motion, and cube with little textures and line motion. Images are also classified into three types according to the ratio of these patterns: images with motion and textures, images with high textures and little motion, and images with little textures and little motion. The proposed watermarking method adaptivelyinserts the watermark on the coefficients of the mid-range in the 3D-DCT cube using the appropriately learned sensitivity table and the proportional constants depending on the patterns of 3D-DCT cubes and types of images. Experimental results show that the proposed method achieves better performance in terms of invisibility and robustness than the previous method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.6C
• /
• pp.603-613
• /
• 2006

Low-power design is one of the most important challenges encountered in maximizing battery life in portable devices as well as saving energy during system operation. In this paper we propose a low-power DCT (Discrete Cosine Transform) architecture using a modified Computation Sharing Multiplication (CSHM). The overall rate of Power consumption is reduced during DCT: the proposed architecture does not perform arithmetic operations on unnecessary bits during the Computation Sharing Multiplication calculations. Experimental results show that it is possible to reduce power dissipation up to about $7\sim8%$ without compromising the final DCT results. The proposed low-power DCT architecture can be applied to consumer electronics as well as portable multimedia systems requiring high throughput and low-power.

• The KIPS Transactions:PartB
• /
• v.9B no.5
• /
• pp.609-614
• /
• 2002

Watermarking is embedding a digital signal called as watermark into images to claim the ownership. In this paper, a new digital watermarking algorithm based on DCT (Discrete Cosine Transform) which enhances invisibility and robustness is proposed to improve contentional digital watermarking method using DCT. In the proposed method, it is possible to enhance invisibility and robustness using watermark reordering in which the relative significance of original DCT coefficients can be preserved in watermarked DCT coefficients, and the distortions of original DCT coefficients can be minimized. The experimental results show that the proposed method improves invisibility approximately 9～12[dB] and is more robust to various attacks than the conventional method.

• 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.

• Journal of Korea Society of Industrial Information Systems
• /
• v.13 no.4
• /
• pp.108-114
• /
• 2008

In this paper, we proposed robust blind watermarking algorithm using texture block coefficient based on discrete cosine transform(DCT). The proposed method embedded all of watermark signals into DC component of $8\times8$ block DCT in order to robust various external attack The texture block coefficient was composed absolute value of DCT coefficients. Experiment showed that the proposed method better than conventional methods in the invisibility and various attack such as dithering, cropping, and scaling.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.40 no.4
• /
• pp.58-64
• /
• 2003

Noise generation systems are used to generate noise signals with specified characteristics. In recent study, DCT-based noise generation system outperforms the conventional noise generation system when a noise model requires complicated PSD(Power Spectral Density) specifications. In this paper, we propose the area-efficient noise generation system based on DCT method. It is shown that the proposed system results in area reduction by 61~64% except DCT block. Furthermore, it achieves power reduction by 41~56%.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.1940-1943
• /
• 2003

본 논문은 Polynomial 변환을 이용하여 2차원 Discrete Cosine Transform (2D-DCT)의 계산을 1차원 DCT로 변환하여 계산하는 알고리즘을 개발한다. 기존의 일반적인 알고리즘인 row-column이 N×M의 2D-DCT에서 3/2NMlog₂(NM)-2NM＋N＋M의 합과 1/2NMlog₂(NM)의 곱셈이 필요한데 비하여 본 논문에서 제시한 알고리즘은 3/2NMlog₂M ＋NMlog₂N-M-N/2＋2의 합과 1/2NMlog₂M의 곱셈 수를 필요로 한다. 기존의 polynomial 변환에 의한 2D DCT는 Euler 공식을 적용하였기 때문에 복소 연산이 필요하지만 본 논문에서 제시한 polynomial 변환은 DCT의 modular 규칙을 이용하여 2D DCT를 ID DCT의 합으로 직접 변환하므로 복소 연산이 필요하지 않다. 또한 본 논문에서 제시한 알고리즘은 각 차원에서 데이터 크기가 다른 임의 크기의 2차원 데이터 변환에도 적용할 수 있다.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.6
• /
• pp.55-62
• /
• 2005

This paper proposes a method to recognize a face using DCT/LDA where LDA is applied to DCT coefficients of an input face image. In the proposed method, SSS problem of LDA due to less number of training data than the size of feature space can be avoided by expressing an input image in low dimensional space using DCT coefficients. In terms of the recognition rate, both the proposed method and the PCA/LDA method have shown almost equal performance while the training time of the proposed method is much shorter than the other. This is because DCT has the fixed number of basis vectors while the property of energy compaction rate is similar to that of PCA. Although depending on the number of coefficients employed for the recognition, the experimental results show that the performance of the proposed method in terms of recognition rate is very comparable to PCA/LDA method and other DCT/LDA methods, and it can be trained 13,000 times faster than PCA/LDA method.