• Journal of Broadcast Engineering
• /
• v.13 no.4
• /
• pp.489-500
• /
• 2008

We propose a novel high-definition content watermarking algorithm that is highly feasible in UCC (User Created Contents) environment. We begin by addressing an association between broadcasting content and UCC in a view of copyrights, then present watermark requirements by analyzing various UCC editing-effect. Also, we provide a brief review of previous watermarking techniques that are supposed to satisfy the requirements. Our proposed scheme inserts a invisible watermark into both DC and AC components on $8{\times}8$ block DCT domain and extracts them after synchronization using DC image. Experimental results show that our technique satisfies the requirements of invisibility and robustness to a variety of attacks such as rotation, scaling, cropping, and JPEG compression, etc. Note that the proposed scheme is highly resilient to UCC edit attacks that are combined by many different types of watermark attacks.

• The KIPS Transactions:PartB
• /
• v.11B no.2
• /
• pp.125-132
• /
• 2004

In this paper, a watermark inserting method according to the sensitivity of human visual system and minimizing distortion of original DCT coefficients in DCT transform domain is proposed. The proposed method inserts a more robust watermark in the insensitive block of human vision by reordering the blocks according to the human visual system which is appropriate to the JPEG image compression. It also enhances the invisibility and robustness in high compression rate in terms of the watermark inserting method within the block which minimizes distortions of original DCT coefficients. The computer simulation results show that the proposed method maintains high image quality and good robustness in high compression rate compared with conventional watermarking method.

• Journal of Korea Multimedia Society
• /
• v.9 no.10
• /
• pp.1276-1281
• /
• 2006

In this paper, We proposed a robust blind digital watermarking algorithm using variance and DCT domain. The proposed method embedded watermark signals into DC components of $8{\times}8$ block DCT using valiance, texture regions and smooth regions. In the digital watermarking algorithms using DCT domain, more robustness can be achieved if watermarks are embedded in DC components since DC components have much larger perceptual capacity than AC components. Experiment showed that robustness of the proposed method better than that of the conventional methods in JPEG quality and scaling attack.

• Journal of Internet Computing and Services
• /
• v.8 no.3
• /
• pp.33-43
• /
• 2007

In this proper, we proposes a robust watermarking against the lossy compression in the Hadamard domain. The Hadamard matrix consists of only 1 or -1 and can be computed veru fast. The Hadamrd transform has the inverse transform therefore it is able to be applied into the watermarking technology. In embedding process, we select 10 coefficients from intermediate frequency domain and create two watermark patterns. In extraction process, we use the watermark patterns and compare them to detect the watermark information. When we use the standard image ($512{\times}512$) and binary watermark image ($64{\times}64$), the results of these examines are PSNR for $38{\sim}42dB$ and BER for $3.9{\sim}12.5%$. The JPEG QF between 30 and100, naked human eyes can detect to watermark image easily. The experimental results show that performance of Hadamard domain is better than those of DCT, FFT, and DWT.

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

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.1
• /
• pp.81-86
• /
• 2011

Watermarking is one of the methods that insist on a copyright as it append digital signals in digital informations.(image, video, ets) In this paper, we proposed a digital watermarking algorithm which improved Gradient of DCT Coefficient. This method targets MPEG-2 TM5 system and watermarking process is to be performed during Quantization DCT. Watermark was inserted on Y components of each frames. The PSNR difference between the compressed images with and without watermarking was only 0..23dB. In each case that the resulting image was reusable the normalized correlation between the extracted watermark and the original one was above 0.99.

• Proceedings of the IEEK Conference
• /
• 2000.09a
• /
• pp.519-522
• /
• 2000

Digital watermarking has been proposed as a solution to the problem of copyright protection of the multimedia documents. In this paper a new watermarking method for digital images operating in the frequency domain is proposed. In our approach, DCT coefficients of the watermark are added to the low frequency region of the host image, and extract it using the Wiener Filter. Due to the characteristic of the wiener filtering, the watermark is robust to various image processing techniques. Experimental results show that it is possible to reliably extract the watermark without degrading image quality.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.12
• /
• pp.97-106
• /
• 1999

We propose a new watermarking method to embed a label in a video which is robust against the change of the group of picture. The proposed method embeds labels in the pixel domain, but detects the label in the DCT frequency domain. For embedding a label, the size of watermark based on the human visual system is calculated to keep a quality of videos. A lookup table haying the pixel patterns and the sequences of a sign of DCT coefficients is used for detecting a label in the DCT frequency domain. In this paper, we analyze bit error rates for labels of videos compressed by MPEG2 using the central limit theorem and compare the simulation results with previous methods.

• Convergence Security Journal
• /
• v.1 no.1
• /
• pp.47-55
• /
• 2001

This paper proposes a method which inserts watermark created by secret sharing method and then extracts it from watermarked image for the protection of copyrights of digital images. To do this, after image's DCT transform, once some values created by Key sharing method which used Lagrange interpolation are inserted into a frequency domain, one can recreate original watermark even if only k seeds are extracted among n of inserted seeds ($n{\geq}k$).

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.51 no.3
• /
• pp.108-111
• /
• 2002

This paper proposes an new water mark embedding and extraction technique which extends the direct sequence spread spectrum technique. The proposed technique approximates the complexity of image and block in spatial domain using Laplacian filtering and watermark is adaptively embedded in the mid-frequency DCT components. Local parity bits are attached to higher-frequency DCT components and they are used to detect extraction errors and correct those errors. In extraction process the proposed method boosts the higher frequency components of image and extracts the watermark by demodulation and this information is verified and adjusted by parity bits. Experimental results show it is invisible and robust to several external attacks.