• Title/Summary/Keyword: Watermark Embedding

Search Result 255, Processing Time 0.031 seconds

Performance Analysis for Digital watermarking using Quad-Tree Algorithm based on Wavelet Packet (웨이블렛 패킷 기반 쿼드트리 알고리즘을 이용한 디지털 워터마킹의 성능 분석)

  • Chu, Hyung-Suk;Kim, Han-Kil;An, Chong-Koo
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.11 no.4
    • /
    • pp.310-319
    • /
    • 2010
  • In this paper, digital watermarking method using wavelet transform and quad-tree algorithm is proposed. The proposed algorithm transforms the input image by DWT(Discrete Wavelet Transform) and AWPT(Adaptive Wavelet Packet Transform), inserts the watermark by quad-tree algorithm and the Cox's algorithm. The simulation for performance analysis of the proposed algorithm is implemented about the effect of embedding watermark in each subband coefficient (HH, LH, HL) of DWT, each DWT level, and each AWPT level. The simulation result by using DWT is compared with that using AWPT in the proposed algorithm. In addition, the effect of embedding watermark in the lowest frequency band (LL) is simulated. As a simulation result using DWT, the watermarking performance of simultaneously embedding in HH, LH, and HL band of DWT(6 level) is better than that of different cases. The result of AWPT(3 level) improves the correlation value compared to that of DWT(3 level). In addition, insertion the watermark to the LL band about 30~60% of all watermarks improves the correlation value while PSNR performance decreases 1~2dB.

A New Robust Watermark Embedding into Wavelet DC Components

  • Joo, Sang-Hyun;Suh, Young-Ho;Shin, Jae-Ho;Kikuchi, Hisakazu
    • ETRI Journal
    • /
    • v.24 no.5
    • /
    • pp.401-404
    • /
    • 2002
  • In this paper, we propose a non-blind watermarking method that embeds a pseudo-random sequence (watermarks) into wavelet DC components. The DC area is not suitable for embedding because of severe visual degradation. We overcome the degradation problem by embedding watermarks into visually insensitive locations. We compare our experimental results with respect to JPEG compression with Cox’s popular correlation-based method. We also compare the robustness of our technique with other methods registered in CheckMark. This study reveals that the proposed method simultaneously provides good fidelity in quality as well as robustness against external attacks.

  • PDF

A New Wavelet Watermarking Based on Linear Bit Expansion (선형계수확장 기반의 새로운 웨이블릿 워터마킹)

  • Piao Yong-Ri;Kim Seok-Tae
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2006.05a
    • /
    • pp.167-170
    • /
    • 2006
  • This study proposes a new wavelet watermark technique based on the Linear Bit Expansion. To ensure the security of the watermark, it is Amold Transformed before embedding. Then the wavelet transformation of watermark and original images is processed. Since the size of the watermark image is a quarter of the original site, it uses linear bit-expansion to enlarge the watermark image. Lastly, watermark is inserted in a given intensity to the corresponding low frequency subbands of the wavelet-transformed images proposed in this paper. When detecting the presence of watermark, the similarity between extracted watermark and the original watermark is compared applying the F norm function.

  • PDF

Hybrid Watermarking Technique using DWT Subband Structure and Spatial Edge Information (DWT 부대역구조와 공간 윤곽선정보를 이용한 하이브리드 워터마킹 기술)

  • 서영호;김동욱
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.5C
    • /
    • pp.706-715
    • /
    • 2004
  • In this paper, to decide the watermark embedding positions and embed the watermark we use the subband tee structure which is presented in the wavelet domain and the edge information in the spatial domain. The significant frequency region is estimated by the subband searching from the higher frequency subband to the lower frequency subband. LH1 subband which has the higher frequency in tree structure of the wavelet domain is divided into 4${\times}$4 submatrices, and the threshold which is used in the watermark embedding is obtained by the blockmatrix which is consists by the average of 4${\times}$4 submatrices. Also the watermark embedding position, Keymap is generated by the blockmatrix for the energy distribution in the frequency domain and the edge information in the spatial domain. The watermark is embedded into the wavelet coefficients using the Keymap and the random sequence generated by LFSR(Linear feedback shift register). Finally after the inverse wavelet transform the watermark embedded image is obtained. the proposed watermarking algorithm showed PSNR over 2㏈ and had the higher results from 2% to 8% in the comparison with the previous research for the attack such as the JPEG compression and the general image processing just like blurring, sharpening and gaussian noise.

Image Watermark Method Using Multiple Decoding Keys (다중 복호화 키들을 이용한 영상 워터마크 방법)

  • Lee, Hyung-Seok;Seo, Dong-Hoan;Cho, Kyu-Bo
    • Korean Journal of Optics and Photonics
    • /
    • v.19 no.4
    • /
    • pp.262-269
    • /
    • 2008
  • In this paper, we propose an image watermark method using multiple decoding keys. The advantages of this method are that the multiple original images are reconstructed by using multiple decoding keys in the same watermark image, and that the quality of reconstructed images is clearly enhanced based on the idea of Walsh code without any side lobe components in the decoding process. The zero-padded original images, multiplied with random-phase pattern to each other, are Fourier transformed. Encoded images are then obtained by taking the real-valued data from these Fourier transformed images. The embedding images are obtained by the product of independent Walsh codes, and these spreaded phase-encoded images which are multiplied with new random-phase images. Also we obtain the decoding keys by multiplying these random-phase images with the same Walsh code images used in the embedding images. A watermark image is then made from the linear superposition of the weighted embedding images and a cover image, which is multiplied with a new independent Walsh code. The original image is simply reconstructed by the inverse-Fourier transform of the despreaded image of the multiplication between the watermark image and the decoding key. Computer simulations demonstrate the efficiency of the proposed watermark method with multiple decoding keys and a good robustness to the external attacks such as cropping and compression.

WAVELET-BASED DIGITAL WATERMARKING USING HUMAN VISUAL SYSTEM FOR COPYRIGHT PROTECTION

  • Sombun, Anuwat;Pinngern, Quen;Kimpan, Chom
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.800-803
    • /
    • 2004
  • This paper presents a wavelet-based digital watermarking technique for still images. The digital watermarking considering human visual system (HVS) to increase the robustness and perceptual invisibility of digital watermark. The watermarking embedding is modified discrete wavelet transform (DWT) coefficients of the subbands of the images. The human visual system is number of factors that effect the noise sensitivity of human eyes that is considered to increase the robustness and perceptual invisibility of digital watermark. The watermark detection is blind watermark ( original image is not required ). Experimental results successful against attacks by image processing such as add noise, cropping, filtering, JPEG and JPEG2000 compression.

  • PDF

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

Development of Digital Watermark Embedding Algorithm using Fourier Series Expansion (푸리에 급수전개를 이용한 워터마크 삽입 알고리즘의 개발)

  • Min, Jun-Yeong;Choe, Jong-Uk
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.26 no.6
    • /
    • pp.662-669
    • /
    • 1999
  • Digital watermarking이란 영상이나 비디오, 오디오, 텍스트 등의 저작물에 잘 식별되지 않는 표시를 삽입하여 저작권을 보호하는 방법으로 소유권자의 동의없이 저작물을 배포, 복사되는 것을 방지하는 법이다. 본 논문은 watermark를 삽입하기 위해서 sin과 cos 함수를 이용한 Fourier 급수전개를 이용하였다. 우선 , 원 이미지를 주파수 영역으로 변환한 다음 watermark를 삽입할 위치를 M $\times$Nro의 Random Sequence를 발생하여 결정하였으며, M개의 파형을 가장 직교성이 좋다고 하는 sin 함수와 cos 함수를 이용하여 Fourier 급수전개를 하였다. 이 때, sin과 cos의 n의 고조파 역시 Random Sequence를 발생하여 결정하였다. 제안한 알고리즘은 이와 같이 Fourier 급수전개를 했을 때 각 항의 Fourier 계수를 산출하여 이 Fourier 계수에 watermark를 삽입하였다. 실험 결과 JPEG 압축, Blurring, 노이즈삽입 등의 이미지 왜곡에 대하여 watermark 상관관계가 최소 0.1979에서 최대 0.9732까지의 견고성(robustness)을 보였다.

A Blind Video Watermarking Technique Using Luminance Masking and DC Modulus Algorithm (휘도 마스킹과 DC Modulus 알고리즘을 이용한 비디오 워터마킹)

  • Jang Yong-Won;Kim, In-Taek;Han, Seung-Soo
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.51 no.7
    • /
    • pp.302-307
    • /
    • 2002
  • Digital watermarking is the technique, which embeds an invisible signal including signal including owner identification and copy control information into multimedia data such as audio, video, and images for copyright protection. A new MPEG watermark embedding algorithm using complex block effect based on the Human Visual System(HVS) is introduced in this paper. In this algorithm, $8{\times}8$ dark blocks are selected, and the watermark is embedded in the DC component of the discrete cosine transform(DCT) by using quantization and modulus calculation. This algorithm uses a blind watermark retrieval technique, which detects the embedded watermark without using the original image. The experimental results show that the proposed watermark technique is robust against MPEG coding, bitrate changes, and various GOP(Group of Picture) changes.

Similar Patterns for Semi-blind Watermarking

  • Cho, Jae-Hyun
    • Journal of information and communication convergence engineering
    • /
    • v.2 no.4
    • /
    • pp.251-255
    • /
    • 2004
  • In this paper, we present a watermarking scheme based on the DWT (Discrete Wavelet Transform) and the ANN (Artificial Neural Network) to ensure the copyright protection of the digital images. The problem to embed watermark is not clear to select important coefficient in the watermarking. We used the RBF (Radial-Basis Function) to solve the problem. We didn't apply the whole wavelet coefficients, but applied to only the wavelet coefficients in the selected node. Using the ANN, although even the watermark casting process and watermark verification process are in public, nobody knows the location of embedding watermark except of authorized user. As the result, the watermark is good at the strength test-filtering, geometric transform and etc.