• Journal of Electrical Engineering and Technology
• /
• 제4권4호
• /
• pp.552-558
• /
• 2009

We proposed a semi-blind digital image watermarking technique for copyright protection. The proposed algorithm embedded a binary sequence watermark into significant wavelet coefficients by using a quantization method. The main idea of the quantization method was to quantize a middle coefficient of the triplet of a significant wavelet coefficient according to the watermark's value. Unlike an existing algorithm, which used a random location table to find a coefficient in which the watermark bit will be embedded: the proposed algorithm used quad-tree decomposition to find a significant wavelet coefficient for embedding. For watermark detection, an original host image was not required. Thanks to the usage of significant wavelet coefficients, the proposed algorithm improved the correlation value, up to 0.43, in comparison with the existing algorithm.

• Journal of information and communication convergence engineering
• /
• 제2권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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권4호
• /
• pp.1499-1513
• /
• 2014

This paper proposes a novel blind image watermarking scheme exploiting Block Truncation Coding (BTC). Most of existing BTC-based watermarking or data hiding methods embed information in BTC compressed images by modifying the BTC encoding stage or BTC-compressed data, resulting in watermarked images with bad quality. Other than existing BTC-based watermarking schemes, our scheme does not really perform the BTC compression on images during the embedding process but uses the parity of BTC quantization data to guide the watermark embedding and extraction processes. In our scheme, we use a binary image as the original watermark. During the embedding process, the original cover image is first partitioned into non-overlapping $4{\times}4$ blocks. Then, BTC is performed on each block to obtain its BTC quantized high mean and low mean. According to the parity of high mean and the parity of low mean, two watermark bits are embedded in each block by modifying the pixel values in the block to make sure that the parity of high mean and the parity of low mean in the modified block are equal to the two watermark bits. During the extraction process, BTC is first performed on each block to obtain its high mean and low mean. By checking the parity of high mean and the parity of low mean, we can extract the two watermark bits in each block. The experimental results show that the proposed watermarking method is fragile to most image processing operations and various kinds of attacks while preserving the invisibility very well, thus the proposed scheme can be used for image authentication.

• 한국정보통신학회논문지
• /
• 제13권2호
• /
• pp.233-242
• /
• 2009

본 논문은 H.264의 인트라 프레임을 대상으로 일반적인 디지털 워터마킹 방법을 목표로 하여 인트라 예측이 워터마킹에 미치는 영향과 일반적인 워터마킹 방법이 H.264의 인트라 프레임에서는 그 효용성이 매우 낮다는 것을 보이고자 한다. 대상 워터마킹 방법으로는 비 가시성과 강인성 워터마킹으로써 H.264 압축과정 중에 수행하는 것으로 가정한다. 문제는 워터마크 데이터 추출을 위한 재 압축 과정 (re-engineering) 중 영상데이터의 계수값이 변화하는 것이며, 이것은 H.264의 인트라 예측 자체의 문제임을 실험적으로 보였다. 즉, 워터마크 데이터를 삽입하지 않은 압축된 데이터를 동일조건으로 재 압축하였을 때 그 결과 데이터가 첫 번째 압축결과와 다르며, 이것은 계수값 자체뿐만 아니라 예측모드가 변화한다는 것을 보였다. 또한 인트라 프레임에 대한 몇 가지 워터마킹 실험을 통해 전형적인 공격이 이 문제를 더욱 두드러지게 만들어 워터마킹 방법의 효용성을 크게 훼손함을 보였다. 실험적 데이터를 고려하면 결론적으로 기존 형태의 워터마킹 방법은 H.264의 인트라 프레임에 대해 그 효용성을 보장할 수 없으며, 따라서 새로운 방법의 연구 개발이 절실하다고 판단된다.

• Journal of Information Processing Systems
• /
• 제14권3호
• /
• pp.666-679
• /
• 2018

The discrete wavelet transform (DWT) has good multi-resolution decomposition characteristic and its low frequency component contains the basic information of an image. Based on this, a fragile watermarking using the local binary pattern (LBP) and DWT is proposed for image authentication. In this method, the LBP pattern of low frequency wavelet coefficients is adopted as a feature watermark, and it is inserted into the least significant bit (LSB) of the maximum pixel value in each block of host image. To guarantee the safety of the proposed algorithm, the logistic map is applied to encrypt the watermark. In addition, the locations of the maximum pixel values are stored in advance, which will be used to extract watermark on the receiving side. Due to the use of DWT, the watermarked image generated by the proposed scheme has high visual quality. Compared with other state-of-the-art watermarking methods, experimental results manifest that the proposed algorithm not only has lower watermark payloads, but also achieves good performance in tamper identification and localization for various attacks.

• 융합신호처리학회논문지
• /
• 제11권2호
• /
• pp.97-103
• /
• 2010

본 논문에서는 새로운 디지털 워터마킹 기법을 제안하였다. 제안한 알고리즘은 임의의 실수가 2의 지수형식의 합으로 될 수 있고, 몇 개의 수로써 표현될 수 있음을 이용하였다. 여기서, 임의의 실수가 일부분 변하더라도 2의 지수형식으로 표현하였을 경우에 큰 자리 수는 변하지 않음을 알 수 있다. 제안한 알고리즘은 입력 영상을 웨이블렛 변환하였고, 2의 지수형식으로 표현된 웨이블렛의 중요계수에 다중 바코드 워터마크를 삽입하였다. 제안한 알고리즘은 세미 블라인드이고, 객관적이면서 주관적인 워터마크 검출을 할 수 있다. 또한 병함기법을 이용함으로써 좀 더 정확한 워터마크를 추출할 수 있었다. 실험결과에서 제안한 알고리즘은 잡음 및 영상압축 공격에 대하여 향상된 결과를 보였다.