• Journal of Electrical Engineering and Technology
• /
• v.4 no.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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.9C
• /
• pp.1289-1297
• /
• 2004

Digital watermarking is a technique which blends intellectual property right with security Blind watermarking 1S one of the difficult watermark technique because original data or inserted watermark is not needed. In this paper, we propose a new blind watermarking method using energy quantization in wavelet domain to insert watermark. The proposed method is robust for various attacks and attack strength because watermark strength is adaptively changed for energy variation of attacks. Simulation results show the proposed method is robust to various attacks such as noise addition, cropping, blurring, sharpening, maintaining imprescriptibility.

• Proceedings of the Acoustical Society of Korea Conference
• /
• spring
• /
• pp.323-326
• /
• 2002

In this paper, we propose a watermarking technique that it is possible to winnow illegal contents from scattered contents on the internet. The identification is performed using an embedded unique content ID by the watermarking technique. The proposed watermarking technique accepts A/D-D/A conversion and a lot of lossy compression such as MP3, AAC, WMA and Real Audio. Watermark robustness is enabled using group quantization, selecting watermark inserting point, and error correction code. Test results show that the correct extraction is about $90\%$ and SNR is above $50\~60dB$. The above figures means that the proposed technique is able to extract encoded information at least one more times per audio and that it is very difficult to discriminate between a watermarked audio and a original audio.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.16 no.1
• /
• pp.45-53
• /
• 2006

In this paper, we propose a method for enlarging quantization steps of a QIM watermarking scheme which determines the perceptual quality and robustness of the watermarked images. In general, increasing the quantization steps leads to good robustness but poor perceptual quality of watermarked images and vice versa. However, if we choose the quantization steps considering the expected quantization results as well as the original images, we can increase both robustness and perceptual quality of the watermarked images.

• Journal of the Institute of Convergence Signal Processing
• /
• v.16 no.2
• /
• pp.63-68
• /
• 2015

This paper proposes a robust multiple audio watermarking algorithm using improved QIM(quantization index modulation) with adaptive stepsize for different signal power and SVM(support vector machine) decoding model. The proposed algorithm embeds watermarks into both frequency magnitude response and frequency phase response using QIM. This multiple embedding method can achieve a complementary robustness. The SVM decoding model can improve detection rate when it is not sure whether the extracted data are the watermarks or not. To evaluate robustness, 11 attacks are employed. Consequently, the proposed algorithm outperforms previous multiple watermarking algorithm, which is identical to the proposed one but without SVM decoding model, in PSNR and BER. It is noticeable that the proposed algorithm achieves improvements of maximum PSNR 7dB and BER 10%.

• The Journal of the Acoustical Society of Korea
• /
• v.30 no.6
• /
• pp.303-307
• /
• 2011

This paper describes an audio watermarking using Quantization Index Modulation (QIM) on significant peaks in frequency domain. The audio signal is broken up into L samples length frames with non-overlapping and rectangular window. The zero-crossing rate of each frame is calculated for decision whether it is proper to be watermarked or not. If the frame is legitimate, frequency magnitude response is computed by discrete Fourier transform. For the QIM, we set the quantization step size based on maximum value of frequency magnitude response and select n significant peaks with w samples around them in frequency domain, totally $n{\times}(w+1)$ samples. Finally, watermark embedding is performed. Decoder extract watermarks based on Euclidean distance, that is a blind detection. The proposed method is robust against many attacks of watermark benchmark.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2008.10b
• /
• pp.87-90
• /
• 2008

디지털 워터마킹은 디지털 콘텐츠에 워터마크를 삽입함으로써 불법적인 복제를 방지하고, 지적재산권 및 저작권을 보호하며, 소유권을 주장할 수 있는 근거를 제시하는 기술이다. 기존의 워터마킹 기법에서는 워터마크를 삽입함으로써 데이터 왜곡과 품질 저하가 불가피하다는 단점이 있다. 이를 극복하기 위하여 원래 데이터를 변경하지 않는 제로-워터마킹 기법들이 제시되고 있다. 이 논문에서는 VQ(Vector Quantization) 방식의 블록 효과를 줄이고, 압축 비율과 품질을 향상시킨 SMVQ(Side Match Vector quantization) 방식에 대한 제로-워터마킹 체계인 CSMVQ(Chaotic SMVQ)를 제안한다. SMVQ 이미지 압축에서는 동일하게 두 이웃 블록의 접면 정보를 이용하기 위하여 좌측 상단에서 우측 하단으로 진행되므로, 임의의 순서로 블록을 선택하여 워터마크를 삽입하기 어렵다. CSMVQ에서는 이전에 부호화된 이웃 블록들의 접면 정보의 일치성을 동적으로 고려하여 부호화를 진행한다. 그러므로 무질서한 방식으로 워터마크가 삽입되도록 지원할 수 있다.

• 전자공학회논문지 IE
• /
• v.43 no.4
• /
• pp.37-42
• /
• 2006

This paper proposes a adaptive video watermarking algorithm according to bitrate and motion vector size in MPEG2 system. The watermark strength in the I-frames is adapted for quantization step size and the strength in the P-B-frames is adapted for quantization step size and motion vector of macroblock to make the watermark more robust against the accompanying degradation due to aggressively compression. A realtime watermark extraction is done directly in the DCT domain during MPEG decoding without full decoding of MPEG video. The experimental simulations show that the video quality results almost invisible difference between the watermarked frames and the original frames and the watermark is resistant to frame dropping, MPEG compression, GoP conversion and low pass filter attacks.

• Journal of Electrical Engineering and Technology
• /
• v.13 no.1
• /
• pp.476-484
• /
• 2018

The high capacity audio watermarking algorithms are facing a main challenge in satisfying the robustness against attacks especially on de-synchronization attacks. In this paper, a robust and a high capacity algorithm is proposed using segment selection, Stationary Wavelet Transform (SWT) and the Quantization Index Modulation (QIM) techniques along with new synchronization mechanism. The proposed algorithm provides enhanced trade-off between robustness, imperceptibility, and capacity. The achieved watermarking improves the reliability of the available watermarking methods and shows high robustness towards signal processing (manipulating) attacks especially the de-synchronization attacks such as cropping, jittering, and zero inserting attacks. For imperceptibility evaluation, high signal to noise ratio values of above 22 dB has been achieved. Also subjective test with volunteer listeners shows that the proposed method has high imperceptibility with Subjective Difference Grade (SDG) of 4.76. Meanwhile, high rational capacity up to 176.4 bps is also achieved.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.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.