• Title/Summary/Keyword: watermarking robustness

Search Result 303, Processing Time 0.023 seconds

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

Optimization-based Image Watermarking Algorithm Using a Maximum-Likelihood Decoding Scheme in the Complex Wavelet Domain

  • Liu, Jinhua;Rao, Yunbo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.1
    • /
    • pp.452-472
    • /
    • 2019
  • Most existing wavelet-based multiplicative watermarking methods are affected by geometric attacks to a certain extent. A serious limitation of wavelet-based multiplicative watermarking is its sensitivity to rotation, scaling, and translation. In this study, we propose an image watermarking method by using dual-tree complex wavelet transform with a multi-objective optimization approach. We embed the watermark information into an image region with a high entropy value via a multiplicative strategy. The major contribution of this work is that the trade-off between imperceptibility and robustness is simply solved by using the multi-objective optimization approach, which applies the watermark error probability and an image quality metric to establish a multi-objective optimization function. In this manner, the optimal embedding factor obtained by solving the multi-objective function effectively controls watermark strength. For watermark decoding, we adopt a maximum likelihood decision criterion. Finally, we evaluate the performance of the proposed method by conducting simulations on benchmark test images. Experiment results demonstrate the imperceptibility of the proposed method and its robustness against various attacks, including additive white Gaussian noise, JPEG compression, scaling, rotation, and combined attacks.

Highly Reliable Digital Image Watermarking Based on HVS and DWT (HVS 및 DWT 기반의 고신뢰 디지털 영상 워터마킹)

  • 권성근;권기구;하인성;권기룡;이건일
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.26 no.12A
    • /
    • pp.2100-2108
    • /
    • 2001
  • A digital image watermarking algorithm is proposed that uses human visual system (HVS) and discrete wavelet transform (DWT). In this algorithm, an image is decomposed into four-level by DWT which reveals the characteristics of the human eyes and watermark is embedded into DWT coefficients using HVS. For robustness, the lowest level subbands which represent the highest frequency component are excluded in watermark embedding step and watermark is embedded into the perceptually significant coefficients (PSCs) of the rest subbands. PSCs of the baseband are selected according to the amplitude of the coefficients and PSCs of the high frequency subbands are selected by successive subband quantization (SSQ). Watermark is embedded into the PSCs of the baseband and high frequency subbands by Weber\`s law and spatial masking effect, respectively, for the invisibility and robustness. We tested the performance of the proposed algorithm compared with the conventional watermarking algorithm by computer simulation. Experimental results show that the proposed watermarking algorithm produces a better invisibility and robustness than the conventional algorithm.

  • PDF

3D Mesh Watermarking Using Projection onto Convex Sets (볼록 집합 투영 기법을 이용한 3D 메쉬 워터마킹)

  • Lee Suk-Hwan;Kwon Seong-Geun;Kwon Ki-Ryong
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.43 no.2 s.308
    • /
    • pp.81-92
    • /
    • 2006
  • This paper proposes a robustness watermarking for 3D mesh model based on projection onto convex sets (POCS). After designing the convex sets for robustness and invisibility among some requirements for watermarking system, a 3D-mesh model is projected alternatively onto two constraints convex sets until the convergence condition is satisfied. The robustness convex set are designed for embedding the watermark into the distance distribution of the vertices to robust against the attacks, such as mesh simplification, cropping, rotation, translation, scaling, and vertex randomization. The invisibility convex set are designed for the embedded watermark to be invisible. The decision values and index that the watermark was embedded with are used to extract the watermark without the original model. Experimental results verify that the watermarked mesh model has invisibility and robustness against the attacks, such as translation, scaling, mesh simplification, cropping, and vertex randomization.

Digital Watermarking using Of-axis Hologram (비축 홀로그램을 이용한 디지털 워터마킹)

  • 김규태;김종원;김수길;최종욱
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.41 no.3
    • /
    • pp.183-194
    • /
    • 2004
  • We propose a now watermarking scheme that can be used to embed multiple bits and also resilient to geometrical transforms such as scaling, rotation, and cropping, based on off - axis holographic watermark that allows multiple watermark recovery without original content(cover image). The holographic watermark is that Fourier transformed digital hologram is embedded into cover image in the spatial domain. The proposed method has not only increased robustness with a stronger embedding but also imprescriptibility of the watermark in the evaluation process. To compare with the convention기 scheme, the spread spectrum, we embedded and recovered maximum 1,024 bits that consist of binary number over PSNR(peak signal-to-noise ratio) 39dB. And also, we computed robustness with BER(bit error rate) corresponding the above attack

Robust Blind Image Watermarking Using an Adaptive Trimmed Mean Operator

  • Hyun Lim;Lee, Myung-Eun;Park, Soon-Young;Cho, Wan-Hyun
    • Proceedings of the IEEK Conference
    • /
    • 2001.09a
    • /
    • pp.231-234
    • /
    • 2001
  • In this paper, we present a robust watermarking technique based on a DCT-domain watermarking approach and an order statistic(OS) filter. The proposed technique inserts one watermark into each of four coefficients within a 2 ${\times}$ 2 block which is scanned on DCT coefficients in the zig-zag ordering from the medium frequency range. The detection algorithm uses an adaptive trimmed mean operator as a local estimator of the embedded watermark to obtain the desired robustness in the presence of additive Gaussian noise and JPEG compression attacks. The performance is analyzed through statistical analysis and numerical experiments. It is shown that the robustness properties against additive noise and JPEG compression attacks are more enhanced than the previous techniques.

  • PDF

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.

Video Watermarking Scheme for Scalable Video Coding using ROI

  • Yoon, Ji-Sun;Kwon, Seong-Geun;Lee, Suk-Hwan;Song, Yoon-Chul;Kim, Min-Hwan;Kwon, Ki-Ryong
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.6
    • /
    • pp.796-806
    • /
    • 2008
  • This paper presents a blind video watermarking algorithm that has the robustness against spatial, temporal, and SNR scalability and transcoding for the copyright protection of video contents in heterogeneous multimedia service. The proposed process of watermark embedding and detecting is accomplished on base layer for considering spatial scalability. The watermark consists of the string and the ordering number of string for considering temporal scalability. Thus, each of frames has the bitstream of one character and a ordering number of its character. To robust against FGS, the proposed algorithm quantizes low and middle frequency coefficients in ROI region of each of frames and embeds its watermark bitstream into the specific bits of the quantized coefficients. Experimental results verified that the proposed algorithm satisfies the invisibility of watermark and also has the robustness against spatial scalability, temporal scalability and FGS.

  • PDF

A Novel Watermarking using Cellular Automata Transform (셀룰러 오토마타 변환을 이용한 새로운 워터마킹)

  • Piao, Yong-Ri;Kim, Seok-Tae
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2008.05a
    • /
    • pp.155-158
    • /
    • 2008
  • In this paper, we propose a novel blind watermarking Method using 2D CAT (Two dimensional cellular automata transform). In our scheme, firstly, we obtain the gateway values to generate a dual-state, dual-coefficients basis function. Secondly, the basis function transforms images into cellular automata space. Lastly, we use the cellular automata transform coefficients to embed random noise watermark in the cover images. The proposed scheme allows only one 2D CAT basis function per gateway value. Since there are $2^{96}$ possible gateway values, better security is guaranteed. Moreover, the new method not only verifies higher fidelity than the existing method but also stronger stability on JPEG lossy compression, filtering, sharpening and noise through tests for robustness.

  • PDF

Digital Watermarking for Multi-Level Data Hiding to Color Images (컬러 영상에서 다중-레벨 데이터 은닉을 위한 디지털 워터마킹)

  • Seo, Jung-Hee;Park, Hung-Bog
    • The KIPS Transactions:PartB
    • /
    • v.14B no.5
    • /
    • pp.337-342
    • /
    • 2007
  • Multi-level has advantage to express image in all levels with different images. This paper proposes digital watermarking built-in technique to transform color image to YCbCr color space to guarantee robustness and imperceptibility of the watermark in the various expression of color images, and to hide multi-level data which shows spread spectrum from low resolution to whole resolution for the Y-signal of multi-level. In color signal, Y-signal and low resolution built-in watermark has risk to be visible, but it can guarantee the robustness of watermark in various colors and transformed images. As a result of the experiment, wavelet compression image with built-in watermark showed robustness and imperceptibility of watermark.