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

• Proceedings of the KIEE Conference
• /
• 2000.07d
• /
• pp.2915-2917
• /
• 2000

종합 영상정보 매체인 멀티미디어의 효율적인 활용을 위해 다양한 정보들을 영상과 음향 등을 결합하여 전송하거나 저장하고 있다 본 논문에서는 양자화 파라미터를 사용하여 DCT 계수 값을 변화시켜 움직임 영상의 화질을 향상시키는 방법을 제안하였다. DCT 중 DC 계수를 제외한 고주파 성분의 계수에서 원영상의 8*8 블록 내 각 화소들의 평균값을 구하고 그 블록의 평균값과 그 블록 내의 각 화소간의 차를 구하여 이를 절대값으로 변환하고 그 합을 구하였다. DABP 값과 DCT 계수와의 상관관계를 구명하여 블록계수로 하였으며 이 블록계수를 사용하여 DCT 고주파 성분을 조정하므로 영상의 화질을 향상시켰다.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.4
• /
• pp.61-71
• /
• 2011

In this paper, we proposed the method for detecting text region on image using DCT-coefficient and transition-map analysis. The detecting rate of traditional method for detecting text region using DCT-coefficient analysis is high, but false positive detecting rate also is high and the method using transition-map often reject true text region in step of verification because of sticky threshold. To overcome these problems, we generated PTRmap(Promising Text Region map) through DCT-coefficient analysis and applied PTRmap to method for detecting text region using transition map. As the result, the false positive detecting rate decreased as compared with the method using DCT-coefficient analysis, and the detecting rate increased as compared with the method using transition map.

• Journal of Korea Multimedia Society
• /
• v.6 no.6
• /
• pp.962-967
• /
• 2003

In this paper, we proposed DC term embedding digital watermarking in the DCT domain. We computed a 8${\times}$8 block DCT The watermark signal is composed of a random number sequence of length 1000, which obeys normal distribution with zero mean and unit variance N(0,1). We embedded watermark signal in DC term for small watermark signal, the other watermark signal embedded in the largest AC coefficients. Experiment show that the invisibility and robust of the proposed method better than those of the conventional methods.

• 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 the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.6
• /
• pp.585-590
• /
• 2002

In the typical data partitioning for error-resilient video coding, motion and macroblock header information is separated from the texture information. It can be an effective tool for the transmission of video over the error prone environment. For Intra-coded frames, however, the loss of DCT (discrete cosine transform) coefficients is fatal because there is no ther information to reconstruct the corrupted macroblocks by errors. For Inter-coded frames, when error occurs in DCT coefficients, the picture quality is degraded because all DCT coefficients are discarded in those packets. In this paper, we propose an efficient data partitioning and coding method for DCT-based error-resilient video. The quantized DCT coefficients are partitioned into the even-value approximation and the remainder parts. It is shown that the proposed algorithm provides a better quality of the high priority part than the conventional methods.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.7
• /
• pp.116-123
• /
• 1999

of a block if the method uses the quantization parameter depending on the bitrate control, and consequently it influence the image quality of video. In this paper, we propose a new method using the following three steps : calculating an averaging (Average of Sum, AS) value in each pixel's block of images, earning an average value of differences between each pixels and As (Differential Averaging Block Pixels, DABP), and finally achieving an improved coefficient values by the DABP and DCT coefficients. Simulation results show that the quality of moving picture could be improved by the proposed 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 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 Korea Academia-Industrial cooperation Society
• /
• v.8 no.2
• /
• pp.267-272
• /
• 2007

This paper proposes a new approach fur the detection of facial feature regions using the characteristic of DCT(discrete cosine transformation) thatconcentrates the energy of an image into lower frequency coefficients. Since the facial features are pertained to relatively high frequency in a face image, the inverse DCT after removing the DCT's coefficients corresponding to the lower frequencies generates the image where the facial feature regions are emphasized. Thus the facial regions can be easily segmented from the inversed image using any differential operator. In the segmented region, facial features can be found using face template. The proposed algorithm has been tested with the image MIT's CBCL DB and the Yale facedatabase B. The experimental results have shown superior performance under the variations of image size and lighting condition.