• Title/Summary/Keyword: Watermarking of information

Search Result 841, Processing Time 0.033 seconds

Enhancing Robustness of Information Hiding Through Low-Density Parity-Check Codes

  • Yi, Yu;Lee, Moon-Ho;Kim, Ji-Hyun;Hwang, Gi-Yean
    • Journal of Broadcast Engineering
    • /
    • v.8 no.4
    • /
    • pp.437-451
    • /
    • 2003
  • With the rapid growth of internet technologies and wide availability of multimedia computing facilities, the enforcement of multimedia copyright protection becomes an important issue. Digital watermarking is viewed as an effective way to deter content users from illegal distributions. In recent years, digital watermarking has been intensively studied to achieve this goal. However, when the watermarked media is transmitted over the channels modeled as the additive white Gaussian noise (AWGN) channel, the watermark information is often interfered by the channel noise and produces a large number of errors. So many error-correcting codes have been applied in the digital watermarking system to protect the embedded message from the disturbance of the noise, such as BCH codes, Reef-Solomon (RS) codes and Turbo codes. Recently, low-density parity-check (LDPC) codes were demonstrated as good error correcting codes achieving near Shannon limit performance and outperforming turbo codes nth low decoding complexity. In this paper, in order to mitigate the channel conditions and improve the quality of watermark, we proposed the application of LDPC codes on implementing a fairly robust digital image watermarking system. The implemented watermarking system operates in the spectrum domain where a subset of the discrete wavelet transform (DWT) coefficients is modified by the watermark without using original image during watermark extraction. The quality of watermark is evaluated by taking Into account the trade-off between the chip-rate and the rate of LDPC codes. Many simulation results are presented in this paper, these results indicate that the quality of the watermark is improved greatly and the proposed system based on LDPC codes is very robust to attacks.

Digital Watermarking using Color Space Conversion

  • Kim, Hee-Soo;Jin-woo park;Eui-Yoon chung;Ha, Yeong-Ho
    • 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.

  • PDF

CRT-Based Color Image Zero-Watermarking on the DCT Domain

  • Kim, HyoungDo
    • 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.

Robust Digital Video Watermarking Algorithm Using Dual Watermarks in Block DCT Domain

  • Kim, Byung-Ju;Lee, Suk-Hwan;Kwon, Ki-Ryong;Ahn, Sang-Ho;Kim, Tai-Suk;Lee, Kuhn-Il
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.6
    • /
    • pp.791-797
    • /
    • 2004
  • We proposed a novel digital video watermarking that embeds dual watermarks in the block DCT domain to solve the deadlock problem. Daul watermarks are composed of private watermarks and robust blind watermarks. Firstly, private watermarks are embedded into the lowest AC coefficients of the P or B-frames in accordance with the motion direction gained from a previous frame. Secondly, blind watermarks that have the robustness are inserted into the DC coefficients of the I-frames using a private key made from temporal I-frame motion information. Thus, when a deadlock situation occurs, the proposed algorithm can efficiently solve the problem. Experimental results confirmed that the proposed algorithm can produce good subjective and objective results for MPEG coding with a variety of bit rates. Furthermore, the proposed watermarking algorithm can potentially be applied to broadcasting monitoring systems due to its simplicity and high robustness.

  • PDF

The Problems in Digital Watermarking into Intra-Frames of H.264/AVC (H.264-기반 인트라 프레임의 디지털 워터마킹 문제)

  • Choi, Hyun-Jun;Seo, Young-Ho;Kim, Dong-Wook
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.2
    • /
    • pp.233-242
    • /
    • 2009
  • This paper intend to show the affect of the intra-prediction on the typical digital watermarking method and the fact that the watermarking method has very low effectiveness when it is performed for the intra-frames of H.264. The target watermarking method was the one for imperceptibility and robustness and was assumed to be performed during the intra-compression process by the H.264 technique. Also this method was assumed to insert watermark data and to extract it for certification if needed. The problem is that the resulting data from the re-engineering of the watermark insertion process to extract the watermark data is different from the one before. We experimentally showed that it stems from the intra-prediction itself. That is, we showed that the resulting image data from only compression without watermarking changes if it is re-compressed by the same conditions as the first compression and it is because the intra-prediction modes as well as the coefficient values change. Also, we applied one blind and one semi-blind watermarking methods to show that the typical attacks after watermarking makes this problem much more serious and lowers the effectiveness of the watermarking method dramatically. Therefore we concluded by considering the experimental data that a typical watermarking method which has been researched so far cannot guarantee the effectiveness of intra-frame watermarking and it is highly required to developed a new kind of methodologies.

A Novel Audio Watermarking Algorithm for Copyright Protection of Digital Audio

  • Seok, Jong-Won;Hong, Jin-Woo;Kim, Jin-Woong
    • 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.

  • PDF

Research on Robustness of 2D DWT-Based Watermarking in Intermediate Viewpoint by 3D Warping

  • Park, Scott;Choi, Hyun-Jun;Yang, Won-Jae;Kim, Dong-Wook;Seo, Young-Ho
    • Journal of information and communication convergence engineering
    • /
    • v.12 no.3
    • /
    • pp.173-180
    • /
    • 2014
  • This paper investigates the robustness of watermarking techniques for stereo or multi-view images generated from texture and depth images. A three-dimensional (3D) warping technique is applied to texture and depth images to generate stereo or multi-view images for a 3D display. By using the 3D warping technique, in this paper, we developed watermarking techniques and evaluated the robustness of these techniques that can extract watermarks from texture images even when the viewpoints are moved. A depth image is used to generate a stereo image with the largest viewpoint difference to the left and right. The overlapping region in the stereo image that does not disappear after warping is then obtained, and DWT is applied to this region to embed a watermark in the LL sub-band. The proposed watermarking techniques were found to yield bit error rates of about 3%-16% when they were applied to stereo images generated from texture and depth images. Furthermore, the results showed that the copyright could be seen when the extracted watermark was visually confirmed.

Robust video watermarking algorithm for H.264/AVC based on JND model

  • Zhang, Weiwei;Li, Xin;Zhang, Yuzhao;Zhang, Ru;Zheng, Lixin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.5
    • /
    • pp.2741-2761
    • /
    • 2017
  • With the purpose of copyright protection for digital video, a novel H.264/AVC watermarking algorithm based on JND model is proposed. Firstly, according to the characteristics of human visual system, a new and more accurate JND model is proposed to determine watermark embedding strength by considering the luminance masking, contrast masking and spatial frequency sensitivity function. Secondly, a new embedding strategy for H.264/AVC watermarking is proposed based on an analysis on the drift error of energy distribution. We argue that more robustness can be achieved if watermarks are embedded in middle and high components of $4{\times}4$ integer DCT since these components are more stable than dc and low components when drift error occurs. Finally, according to different characteristics of middle and high components, the watermarks are embedded using different algorithms, respectively. Experimental results demonstrate that the proposed watermarking algorithm not only meets the imperceptibility and robustness requirements, but also has a high embedding capacity.

Watermarking of Compressed Video in the Bitstream Domain: An Efficient Algorithm and its Implementation

  • Drobouchevitvh Inna G.;Lim Sung-Jun;Han Byung-Wan;Chang Hang-Bae;Kim Kyung-Kyu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.4C
    • /
    • pp.458-471
    • /
    • 2006
  • Digital watermarking of multimedia data is a very active research area that has enjoyed a considerable amount of attention in recent years. In this paper, we propose an algorithm for embedding/detecting a fragile watermark in MPEG-4 compressed video domain (Simple and Advance Simple Profiles). The watermark bits are put directly into Huffman VLC-codespace of quantized DCT domain. The advantage of watermark embedding into the compressed domain is the significant savings for a real-time implementation as it does not require a full decoding operation. The watermark embedding does not change the video file size. The algorithm demonstrates high watermarking capacity, thereby providing reliable foolproof authentication. The results of experimental testing demonstrate that watermark embedding preserves the video quality. Watermark detection is performed without using the original video.

Image Watermarking Scheme Based on Scale-Invariant Feature Transform

  • Lyu, Wan-Li;Chang, Chin-Chen;Nguyen, Thai-Son;Lin, Chia-Chen
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.10
    • /
    • pp.3591-3606
    • /
    • 2014
  • In this paper, a robust watermarking scheme is proposed that uses the scale-invariant feature transform (SIFT) algorithm in the discrete wavelet transform (DWT) domain. First, the SIFT feature areas are extracted from the original image. Then, one level DWT is applied on the selected SIFT feature areas. The watermark is embedded by modifying the fractional portion of the horizontal or vertical, high-frequency DWT coefficients. In the watermark extracting phase, the embedded watermark can be directly extracted from the watermarked image without requiring the original cover image. The experimental results showed that the proposed scheme obtains the robustness to both signal processing and geometric attacks. Also, the proposed scheme is superior to some previous schemes in terms of watermark robustness and the visual quality of the watermarked image.