• Journal of Broadcast Engineering
• /
• v.4 no.1
• /
• pp.68-75
• /
• 1999

In this paper. we propose a digital watermarking method for still images in the discrete cosine transform (DCT) domain. The adaptive watermark insertion method in the high frequency region within a given image is employed to increase the invisibility of the inserted watermark in images, in which variable block-size method is used for selection of the high frequency region. Experimental results show that the proposed watermarking method is robust to several common image processing techniques. including joint photographic experts group (JPEG) compression, lowpass filtering, multiple watermarking, and croppIng.

• Journal of IKEEE
• /
• v.2 no.1 s.2
• /
• pp.96-100
• /
• 1998

Due to expected wide spread use of DCT based image/video coding standard, it is advantageous to process data directly in the DCT domain rather than decoding the source back to the spatial domain. The block processing algorithm provides a parallel processing method since multiple input data are processed in the block filter structure. Hence a fast implementation of the algorithm is well suited. In this paper, we propose the JPEG browse by Block Transform Domain Filtering(BTDF) using subband filter banks. Instead of decompressing the entire image to retrieve at full resolution from compressed format, a user can select the level of expansion required$(2^N{\times}2^N)$. Also this approach reduces the computer cpu time by reducing the number of multiplication through BTDF in the filter banks.

• Proceedings of the KIEE Conference
• /
• 2006.04a
• /
• pp.21-23
• /
• 2006

Due to development of Internet network environments and data compression techniques, the size and amount of multimedia data has greatly increased. They are compressed before transmission or storage. Dealing with these compressed data such as video retrieval or indexing requires the decoding procedure most of the time. In video retrieval and indexing a color histogram is one of the most frequently used tools. We propose a novel scheme for extracting color histograms from images transformed into the compressed domain using $8{times}8$ DCT(Discrete Cosine Transform). In this scheme an averaged version of original image is obtained by filtering DCT coefficients with a filter we destined.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.4 s.310
• /
• pp.19-26
• /
• 2006

In these days, multimedia data is transmitted and processed in compressed format. Due to the decoding procedure and filtering for edge detection, the feature extraction process of MPEG-7 Edge Histogram Descriptor (EHD) is time consuming as well as computationally expensive. To improve efficiency of compressed image retrieval, we propose a new edge histogram generation algorithm in DCT domain in this paper. Using the edge information provided by the only two AC coefficients of DCT coefficients, we can get edge directions and strengths directly in DCT domain. The experimental results demonstrate that our system has good performance in terms of retrieval efficiency and effectiveness.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.5
• /
• pp.9-20
• /
• 2000

In this paper we compare two frequency domain digital watermarking methods for digital Images, namely DCT(Discrete Cosine Transform) based and DFT(Discrete Fourier Transform) based methods. Unlike DCT coefficients, which always have real values, DFT coefficients normally have complex values Therefore, the DFT coefficients have amplitude and phase components Among them, the phase components are known to carry more Important information for the Images. So, we insert the watermark to the phase of the DFT coefficients only This DFT watermarking method is compared with the conventional DCT based watermarking method for the object-based watermarking problem. Experimental results show that the DFT-phase based method IS more robust to general Image processing attacks including resize, lossy compression(JPEG), blurring and median filtering. On the other hand, the DCT based method is more robust to the malicious attack which inserts different watermarks.

• Journal of the Institute of Convergence Signal Processing
• /
• v.15 no.1
• /
• pp.1-8
• /
• 2014

Digital watermarking techniques are attracting attention as a proper solution to protect copyright for multimedia data. This paper proposes a new audio watermarking method based on Discrete Cosine Transformation (DCT) and Discrete Wavelet Transformation (DWT) for copyright protection. In our proposed watermarking method, the original audio is transformed into DCT domain and divided into two parts. Synchronization code is applied on the signal in first part and 2 levels DWT domain is applied on the signal in second part. The absolute value of DWT coefficient is divided into arbitrary number of segments and calculates the energy of each segment and middle peak. Watermarks are then embedded into each middle peak. Watermarks are extracted by performing the inverse operation of watermark embedding process. Experimental results show that the hidden watermark data is robust to re-sampling, low-pass filtering, re-quantization, MP3 compression, cropping, echo addition, delay, and pitch shifting, amplitude change. Performance analysis of the proposed scheme shows low error probability rates.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2004.05b
• /
• pp.136-139
• /
• 2004

This thesis is realization of embedded system that of MPEG-2 down conversion using IDCT. A method for down conversion of MPEG compressed video is to perform low-pass filtering and sub-sampling after full decompression. However, this method is need large memory and high computational complexity. Recent research has been focussed on the down conversion in the DCT domain. But DCT method is reduced image qualify. The embedded system is require low complexity, and high speed algorithm. When applied to embedded system that down conversion method, DCT method is played average 29 frame per second, and better 25% than spatial-domain down conversion.

• The Journal of the Acoustical Society of Korea
• /
• v.19 no.8
• /
• pp.54-62
• /
• 2000

Adaptive filtering method is one of signal processing area which is frequently used in the case of statistical characteristic change in time-varing situation. The performance of adaptive filter is usually evaluated with complexity of its structure, convergence speed and misadjustment. The structure of adaptive filter must be simple and its speed of adaptation must be fast for real-time implementation. In this paper, we propose chirp discrete cosine transform (CDCT), which has the characteristics of CZT (chrip z-transform) and DCT (discrete cosine transform), and then CDCTLMS (chirp discrete cosine transform LMS) using the above mentioned algorithm for the improvement of its speed of adaptation. Using loaming curve, we prove that the proposed method is superior to the conventional US (normalized LMS) algorithm and DCTLMS (discrete cosine transform LMS) algorithm. Also, we show the real application for the ultrasonic signal processing.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.9C
• /
• pp.869-875
• /
• 2006

Nowadays JPEG encoder uses block based DCT and quantization to compress the size of still image. JPEG encoding method performs better compression efficiency than the other still image encoding method. However, when encoding a still image at low bit-rate, high frequency coefficients could be lost because of the coarse quantization so the blocking artifacts occur. In this paper, we propose the method of eliminating the blocking artifacts which occur when the still image is encoded by JPEG at a high compression rate. The principle of proposed algorithm is that the eliminating the blocking artifacts, which occur in the boundary of blocks, in DCT domain with $4{\times}4$ block-based method. First of all, observe the blocking artifacts with $4{\times}4$ block in DCT domain. Then eliminate the blocking effects using effective filtering method that is $4{\times}4$ block-based. Experimental results have clearly shown that our algorithm presents substantially higher quality in subjective and objective point of view than the other algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.12A
• /
• pp.2074-2084
• /
• 2001

la this paper, a new digital watermarking algorithm using wavelet transform in frequency domain is suggested. The wavelet coefficients of low frequency subband are utilized to embed the watermark, After the original image is transformed using discrete wavelet transform, their coefficients are transformed into efficient1y in Sequency domain. DCT and FFT transforms are utilized in this processing. Watermark image of general image format is transformed using DCT and the hiding watermark into wavelet coefficients is equally distributed in frequency domain. Next, these wavelet coefficients are performed with inverse transform. The detection process of watermark is performed with reverse direction to insertion process. In this paper, we developed core watermark technologies which are a data hiding technology to hide unique logo mark which symbolizes the copyright and a robust protection technology to protect logo data from external attack like as compression, filtering, resampling, cropping. The experimental results show that two suggested watermarking technologies are invisible and robust.