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

• ETRI Journal
• /
• v.24 no.3
• /
• pp.181-189
• /
• 2002

Digital watermark technology is now drawing attention as a new method of protecting digital content from unauthorized copying. This paper presents a novel audio watermarking algorithm to protect against unauthorized copying of digital audio. The proposed watermarking scheme includes a psychoacoustic model of MPEG audio coding to ensure that the watermarking does not affect the quality of the original sound. After embedding the watermark, our scheme extracts copyright information without access to the original signal by using a whitening procedure for linear prediction filtering before correlation. Experimental results show that our watermarking scheme is robust against common signal processing attacks and it introduces no audible distortion after watermark insertion.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.470-473
• /
• 2000

Digital watermarking is a technical solution to the copyright problem and is a necessary technique to protect copyright of multimedia content. Recently, there are many digital watermarking methods that deal in grey scale still images. However, only a few researchers are interested in digital watermarking fro video and color images. In this paper, we focus on digital watermarking for color images. At first, in order to embed the watermark signal in color image, we converted RGB color space to YCbCr color space which is a world-wide digital component video standard. In addition, we adopted the acceptable degree of color difference in order to keep the invisibility.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.11
• /
• pp.2027-2032
• /
• 2007

In this paper, digital watermarking method using quad-tree algorithm and the lowest frequency band is proposed. The proposed algorithm searches the coefficient of the watermark by using quad-tree algorithm and inserts the watermark by the Cox's algorithm. The simulation of the proposed algorithm is implemented about the effect of various weight factors in Cox's algorithm, that of embedding watermark in each subband coefficient (HH, LH, HL), and that of embedding in the lowest frequency band (LL). As a simulation result, the bigger weight factors in Cox's algorithm show strong to noise. The watermarking performance of simultaneously embedding in HH, LH, and HL band is better than that of different cases. In addition, insertion the watermark to the LL band about $30{\sim}60%$ of all watermarks improves the watermarking performance in comparison with the case of not using the LL band.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.6
• /
• pp.1019-1024
• /
• 2006

A system design and realization for real time DVR system with robust video watermarking algorithm for contents security is presented in this paper. The robust video watermarking is used the intraframe space region and interframe insertion simultaneously, and to be processed at real time on image data and algorithm is used the 64bits special purpose quad DSP processor with assembly and soft pipeline codes. The experimental result shows that the processing time takes about 2.5ms in the D1 image per frame for 60% moving image.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.10a
• /
• pp.393-396
• /
• 2010

A secure and novel watermarking system based on complemented Maximum Length Cellular Automata (MLCA) and Two-Dimension Cellular Automata Transform (2D CAT) is proposed. In this watermarking scheme, the original watermark which is first encrypted by complemented MLCA with the private keys, and the encrypted watermark is embedded into the CAT domain of the cover image. Experiment results show that this new method is more secure and provides robust performance against watermarking attacks.

• Journal of Information Processing Systems
• /
• v.15 no.2
• /
• pp.271-287
• /
• 2019

The synchronization scheme based on moving average is robust and suitable for the same rule to be adopted in embedding watermark and synchronization code, but the imperceptibility and search efficiency is seldom reported. The study aims to improve the original scheme for robust audio watermarking. Firstly, the survival of the algorithm from desynchronization attacks is improved. Secondly, the scheme is improved in inaudibility. Objective difference grade (ODG) of the marked audio is significantly changed. Thirdly, the imperceptibility of the scheme is analyzed and the derived result is close to experimental result. Fourthly, the selection of parameters is optimized based on experimental data. Fifthly, the search efficiency of the scheme is compared with those of other synchronization code schemes. The experimental results show that the proposed watermarking scheme allows the high audio quality and is robust to common attacks such as additive white Gaussian noise, requantization, resampling, low-pass filtering, random cropping, MP3 compression, jitter attack, and time scale modification. Moreover, the algorithm has the high search efficiency and low false alarm rate.

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

• Journal of Advanced Navigation Technology
• /
• v.11 no.3
• /
• pp.329-336
• /
• 2007

The use of digital imaging technique and digital contents based on internet has grown rapidly for last several years, and the needs of digital image protection become more important. For the purpose of copyright protection on digital image, the verification of authentication techniques like content authentication, ownership authentication, illegal copy and etc are needed. Digital watermarking, the invisible encryption technique to insert digital watermark into image, the sophisticated perceptual information should be used for providing transparency and robustness of images on watermarking process. In this paper, we implement the digital watermarking algorithm for preventing forged attack, ownership protection and authentication by transforming the wavelet algorithms in frequency domain in terms of human visual system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.4
• /
• pp.856-873
• /
• 2011

Reversible watermarking is an open problem in information hiding field, with embedding the encoded bit '1' or '0' into some sensitive images, such as the law enforcement, medical records and military images. The technique can retrieve the original image without distortion, after the embedded message has been extracted. Histogram-based scheme is a remarkable breakthrough in reversible watermarking schemes, in terms of high embedding capacity and low distortion. This scheme is lack of capacity control due to the requirement for embedding large-scale data, because the largest hidden capacity is decided by the amount of pixels with the peak point. In this paper, we propose a reversible watermarking scheme to enlarge the number of pixels with the peak point as large as possible. This algorithm is based on an adaptive edge-guided interpolation, furthermore, hides messages by interpolation-error, i.e. the difference between the original and interpolated image value. Simulation results compared with other state-of-the-art reversible watermarking schemes in this paper demonstrate the validity of the proposed algorithm.