• International Journal of Contents
• /
• v.11 no.3
• /
• pp.39-46
• /
• 2015

When host images are watermarked with CRT (Chinese Remainder Theorem), the watermark images are still robust in spite of the damage of the host images by maintaining the remainders in an unchanged state within some range of the changes that are incurred by the attacks. This advantage can also be attained by "zero-watermarking," which does not change the host images in any way. This paper proposes an improved zero-watermarking scheme for color images on the DCT (Discrete Cosine Transform) domain that is based on the CRT. In the scheme, RGB images are converted into YCbCr images, and one channel is used for the DCT transformation. A key is then computed from the DC and three low-frequency AC values of each DCT block using the CRT. The key finally becomes the watermark key after it is combined four times with a scrambled watermark image. When watermark images are extracted, each bit is determined by majority voting. This scheme shows that watermark images are robust against a number of common attacks such as sharpening, blurring, JPEG lossy compression, and cropping.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10c
• /
• pp.481-483
• /
• 2004

다양한 동영상 압축표준에서 압축효율을 높이기 위해 1/2 화소를 이용한다. 1/2 화소는 프레임 간 참조시 압축 효율을 높이기 위한 프레임 내 화소를 연산하여 생성되는 가상의 값이며 이 연산식은 표준에 따라 다르다. MPEG-2에서 H.264로의 포맷 변환시 이 1/2 화소값의 차이로 인해 MPEG-2의 모션벡터와 움직임 보상된 값을 그대로 사용할 수 없게 된다. 본 논문에서는 MPEG-2의 모션벡터를 그대로 사용하고 DCT(Discrete Cosine Transform) 도메인에서 두 표준의 화소값의 차이를 보정하는 기법을 제안한다. 제안된 기법은 픽셀 도메인의 창조 블록을 이용하여 보정 할 위치를 찾고 두 표준의 1/2 화소 계산식의 차이를 이용하여 보정 할 값을 구하게 된다. 구해진 보정 값을 DCT하여 DCT 도메인의 현재 블록에 더하여 보정하게 된다. 이 기법은 모든 블록의 값을 완벽하게 보정할 수는 없지만 두 표준 간 차이값이 큰 1/2 화소를 보정할 수 있으며 IDCT라 DCT로 인한 화질 열화도 감소된다 또한, DCT 상태에서 보정을 수행하므로 픽셀 도메인에서 보다 약 7%의 계산복잡도도 낮출 수 있다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2013.11a
• /
• pp.8-11
• /
• 2013

We implement the foveation and frequency sensitivity feature of human visual system in discrete cosine transform (DCT) domain. Resolution of human visual perception decays as distance from the eye-focused point, known as foveation property, and the middle frequency components give most pleasant image quality to human than the low and high frequency components, which is the frequency sensitivity property of human visual system. For satisfying the foveation property, we enhanced the local contrast at the focused regions and smoothed local contrast at the non-focused regions in the DCT domain without bringing the blocking and ringing artifacts. Moreover, the energies at each DCT frequency components is modified with various degree to fulfill the frequency sensitivity property. The proposed method is verified by the subjective and objective evaluations that it can the improve the human perceptual visual quality.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.40 no.4
• /
• pp.331-341
• /
• 1991

The discrete cosine transform (DCT) is widely used in many signal processing areas, including image and speech data compression. In this paper, we investigate a fixed-point error analysis for fast DCT algorithms, namely, Lee [6], Hou [7] and Vetterli [8]. A statistical model for fixed-point error is analyzed to predict the output noise due to the fixed-point implementation. This paper deals with two's complement fixed-point data representation with truncation and rounding. For a comparison purpose, we also investigate the direct form DCT algorithm. We also propose a suitable scaling model for the fixed-point implementation to avoid an overflow occurring in the addition operation. Computer simulation results reveal that there is a close agreement between the theoretical and the experimental results. The result shows that Vetterli's algorithm is better than the other algorithms in terms of SNR.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.2
• /
• pp.41-48
• /
• 2019

Digital image watermarking techniques have been studied in various fields in order to protect the copyright of multimedia contents mostly composed by images. JPEG compression is a representative copyright attack for image watermarking. The CRT-based watermarking methods in DCT domain have been studied, because these are robust for JPEG compression attack. In this paper, we propose a new method with improved performance compared with the existing CRT based methods in DCT domain. The proposed method selects the DCT block according to the denseness at the watermark insertion phase, and iteratively adjust the CRT Conditional coefficients at the watermark extraction. This paper shows that it is more robust for the JPEG compression attacks through experimental results.

• Annual Conference of KIPS
• /
• 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.

• Journal of the Korean Society for Precision Engineering
• /
• v.22 no.9 s.174
• /
• pp.99-106
• /
• 2005

In recent years, vision sensors are widely used to mobile robot for navigation or exploration. The analog signal transmission of visual data being used in this area, however, has some disadvantages including noise weakness in view of the data storage. A large amount of data also makes it difficult to use this method for a mobile robot. In this paper, a digital data compressing technology based on MPEG4 which substitutes for analog technology is proposed to overcome the disadvantages by using DWT(Discreate Wavelet Transform) instead of DCT(Discreate Cosine Transform). The TI Company's DSP chip, TMS320C6711, is used for the image encoder, and the performance of the proposed method is evaluated by PSNR(Peake Signal to Noise Rates), QP(Quantization Parameter) and bitrate.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2004.05a
• /
• pp.179-182
• /
• 2004

무선통신분야에서 LMS5(Least Mean Square) 알고리즘은 식이 간단하고 계산량이 비교적 적기 때문에 널리 사용되고 있다. 그러나 시간영역에서 처리할 경우 입력신호의 고유치 변동폭이 넓게 분포되어 수렴속도가 저하하는 문제점이 있다. 이를 해결하기 위하여 신호를 FFT(Fast Fourier Trasnform)나 DCT(Discrete Cosine Transform)로 변환하여 신호간의 상관도를 제거함으로써 시간영역에서 LMS알고리즘을 적용할 때 보다 수렴속도를 크게 향강시킬 수 있다. 본 논문에서는 수렴속도 향상을 위해 시간영역의 적응 알고리즘을 직교변환인 고속웨이브렛(wavelet)변환을 이용하여 변환영역에서 수행하며, 짧은 필터계수를 가지는 DWT(Discrete Wavelet Transform)특성에 맞는 Fast running FIR 알고리즘을 이용하여 WTLMS(Wavelet Transform LMS)적응알고리즘을 통신시스템에 적용한다. 적응 알고리즘의 성능향상을 위하여 시간에 따라 적응상수의 크기를 가변시켜 수렴 초기에는 큰 적응상수로 따른 수렴이 가능하도록 하고 점차 적응상수의 크기를 줄여서 misadjustment도 줄이는 방법의 적응 알고리즘을 제안하였다. 제안한 알고리즘을 실제로 적응잡음제거기(adaptive noise canceler)에 적용하여 컴퓨터 시뮬레이션을 하였으며, 각 알고리즘들의 계산량, 수렴속도를 이용하여 각각 비교, 분서하여 그 성능이 우수함을 입증하였다.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.847-850
• /
• 1998

An adaptive block DCT coding scheme is implemented with the same average distortion designated for each block. In this paper, a new implementation of the Discrete Cosine Tranform(DCT) for image is described. Practical system application is attained by maintaining a balance between complexity of implementation and performance. ADCT sub-blocks are sorted into mean according to level of image activity, measured by mean within each sub-block. Excellent performance is demonstrated in terms of PSNR of original and reconstructed images.

• Journal of Broadcast Engineering
• /
• v.26 no.5
• /
• pp.553-565
• /
• 2021

Point cloud is a set of points for representing a 3D object, and consists of geometric information, which is 3D coordinate information, and attribute information, which is information representing color, reflectance, and the like. In this way of expressing, it has a vast amount of data compared to 2D images. Therefore, a process of compressing the point cloud data in order to transmit the point cloud data or use it in various fields is required. Unlike color information corresponding to all 2D geometric information constituting a 2D image, a point cloud represents a point cloud including attribute information such as color in only a part of the 3D space. Therefore, separate processing of geometric information is also required. Based on these characteristics of point clouds, MPEG under ISO/IEC standardizes V-PCC, which imitates point cloud images and compresses them into 2D DCT-based 2D image compression codecs, as a compression method for high-density point cloud data. This has limitations in accurately representing 3D spatial information to proceed with compression by converting 3D point clouds to 2D, and difficulty in processing non-existent points when utilizing 3D DCT. Therefore, in this paper, we present 3D Discrete Cosine Transform-based Point Cloud Compression (3DCT PCC), a method to compress point cloud data, which is a 3D image by utilizing 3D DCT, and confirm the efficiency of 3D DCT compared to V-PCC based on 2D DCT.