• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.44 no.11
• /
• pp.101-108
• /
• 2007

In this paper, we propose and verify an adaptive block watermarking algorithm based on JPEG2000 DWT, which determines watermarking for the original image by two scaling factors in order to overcome image degradation and blocking problem at the edge. Adaptive block watermarking algorithm uses 2 scaling factors, one is calculated by the ratio of present block average to the next block average, and the other is calculated by the ratio of total LL subband average to each block average. Signals of adaptive block watermark are obtained from an original image by itself and the strength of watermark is automatically controlled by image characters. Instead of conventional methods using identical intensity of a watermark, the proposed method uses adaptive watermark with different intensity controlled by each block. Thus, an adaptive block watermark improves the visuality of images by 4$\sim$14dB and it is robust against attacks such as filtering, JPEG2000 compression, resizing and cropping. Also we implemented the algorithm in ASIC using Hynix 0.25${\mu}m$ CMOS technology to integrate it in JPEG2000 codec chip.

• Journal of Broadcast Engineering
• /
• v.16 no.3
• /
• pp.394-402
• /
• 2011

We introduce the standard content identifier Universal Content Identifier (UCI) and a watermarking system that embeds UCI for the broadcast content distribution services. Our proposed UCI embedder is designed in consideration of integrating with the previously established broadcast system and protecting the illegal distribution of broadcast contents. Our goal is that when broadcast content is transmitted, 28 byte UCI is embedded imperceptibly in the content itself in real-time and the embedded UCI is successfully extracted not only in the typical format used in the broadcast content distribution service but also in the illegally distributed broadcast contents. Usually the illegally distributed contents are modified from the original by changing resolutions, frame rates, or adjusting colors. In this paper, we present a watermarking scheme that embeds 28 byte UCI in broadcast content in real-time while keeping the visual quality high and the embedded watermark robust enough to survive through the various modification. The experimental results show that the embedded UCI remains in the various modified versions of content and that the visual degradation by embedding is not noticeable.

• Journal of Intelligence and Information Systems
• /
• v.15 no.4
• /
• pp.201-212
• /
• 2009

Even though the spread spectrum method is known as most robust algorithm to general attacks, it has a drawback to the time axis attack. In this paper, I proposed a robust audio copyright protection algorithm which is robust to the time axis attack and has advantages of the spread spectrum method. Time axis attack includes the audio length variation attack with same pitch and the audio frequency variation attack. In order to detect the embedded watermark by the spread spectrum method, the detection algorithm should know the exact rate of the time axis attack. Even if there is a method to know the rate, it needs heavy computational resource and it is not possible to implement. In this paper, solving this problem, the audio signal is transformed into time-invariant domain, and the spread spectrum watermark is embedded into the audio in the domain. Therefore the proposed algorithm has the advantages of the spread spectrum method and it is also robust to the time axis attack. The time-invariant domain process is that the audio is arranged by log scale time axis, and then, the Fourier transform is taken to the audio in the log scale time axis. As a result, the algorithm can get the time-invariant watermark signal.

• Journal of Intelligence and Information Systems
• /
• v.17 no.2
• /
• pp.97-107
• /
• 2011

Nowadays there are a lot of issues about copyright infringement in the Internet world because the digital content on the network can be copied and delivered easily. Indeed the copied version has same quality with the original one. So, copyright owners and content provider want a powerful solution to protect their content. The popular one of the solutions was DRM (digital rights management) that is based on encryption technology and rights control. However, DRM-free service was launched after Steve Jobs who is CEO of Apple proposed a new music service paradigm without DRM, and the DRM is disappeared at the online music market. Even though the online music service decided to not equip the DRM solution, copyright owners and content providers are still searching a solution to protect their content. A solution to replace the DRM technology is digital audio watermarking technology which can embed copyright information into the music. In this paper, the author proposed a new audio watermarking algorithm with two approaches. First, the watermark information is generated by two dimensional barcode which has error correction code. So, the information can be recovered by itself if the errors fall into the range of the error tolerance. The other one is to use chirp sequence of CDMA (code division multiple access). These make the algorithm robust to the several malicious attacks. There are many 2D barcodes. Especially, QR code which is one of the matrix barcodes can express the information and the expression is freer than that of the other matrix barcodes. QR code has the square patterns with double at the three corners and these indicate the boundary of the symbol. This feature of the QR code is proper to express the watermark information. That is, because the QR code is 2D barcodes, nonlinear code and matrix code, it can be modulated to the spread spectrum and can be used for the watermarking algorithm. The proposed algorithm assigns the different spread spectrum sequences to the individual users respectively. In the case that the assigned code sequences are orthogonal, we can identify the watermark information of the individual user from an audio content. The algorithm used the Walsh code as an orthogonal code. The watermark information is rearranged to the 1D sequence from 2D barcode and modulated by the Walsh code. The modulated watermark information is embedded into the DCT (discrete cosine transform) domain of the original audio content. For the performance evaluation, I used 3 audio samples, "Amazing Grace", "Oh! Carol" and "Take me home country roads", The attacks for the robustness test were MP3 compression, echo attack, and sub woofer boost. The MP3 compression was performed by a tool of Cool Edit Pro 2.0. The specification of MP3 was CBR(Constant Bit Rate) 128kbps, 44,100Hz, and stereo. The echo attack had the echo with initial volume 70%, decay 75%, and delay 100msec. The sub woofer boost attack was a modification attack of low frequency part in the Fourier coefficients. The test results showed the proposed algorithm is robust to the attacks. In the MP3 attack, the strength of the watermark information is not affected, and then the watermark can be detected from all of the sample audios. In the sub woofer boost attack, the watermark was detected when the strength is 0.3. Also, in the case of echo attack, the watermark can be identified if the strength is greater and equal than 0.5.

• Journal of Broadcast Engineering
• /
• v.21 no.6
• /
• pp.845-860
• /
• 2016

This paper proposes a digital watermarking scheme to protect the ownership of the freeview 2D or 3D image such that the viewer watches the image(s) by rendering a arbitrary viewpoint image(s) with the received texture image and its depth image. In this case a viewpoint change attack essentially occurs, even if it is not malicious. In addition some malicious attacks should be considered, which is to remove the embedded watermark information. In this paper, we generate a depth variation map (DVM) to find the locations less sensitive to the viewpoint change. For each LH subband after 3-level 2DDWT for the texture image, the watermarking locations are found by referring the DVM. The method to embed a watermark bit to a pixel uses a linear quantizer whose quantization step is determined according to the energy of the subband. To extract the watermark information, all the possible candidates are first extracted from the attacked image by considering the correlation to the original watermark information. For each bit position, the final extracted bit is determined by a statistical treatment with all the candidates corresponding that position. The proposed method is experimented with various test images for the various attacks and compared to the previous methods to show that the proposed one has excellent performance.

• Journal of Korea Multimedia Society
• /
• v.14 no.3
• /
• pp.403-413
• /
• 2011

In this paper, we proposed a digital image watermarking technique using scrambled binary phase computer generated hologram in the discrete cosine transform(DCT) domain. For the embedding process of watermark. Using simulated annealing algorithm, we would generate a binary phase computer generated hologram(BPCGH) which can reconstruct hidden image perfectly instead of hidden image and encrypt it through the scramble operation. We multiply the encrypted watermark by the weight function and embed it into the DC coefficients in the DCT domain of host image and an inverse DCT is performed. For the extracting process of watermark, we compare the DC coefficients of watermarked image and original host image in the DCT domain and dividing it by the weight function and decrypt it using descramble operation. And we recover the hidden image by inverse Fourier transforming the decrypted watermark. Finally, we compute the correlation between the original hidden image and recovered hidden image to determine if a watermark exits in the host image. The proposed watermarking technique use the hologram information of hidden image which consist of binary values and scramble encryption technique so it is very secure and robust to the various external attacks such as compression, noises and cropping. We confirmed the advantages of the proposed watermarking technique through the computer simulations.

• Journal of Korea Society of Industrial Information Systems
• /
• v.14 no.3
• /
• pp.15-21
• /
• 2009

In this paper, we proposed an iterative digital image watermarking technique using encrypted binary phase computer generated hologram in the discrete cosine transform(OCT) domain. For the embedding process of watermark, using simulated annealing algorithm, we would generate a binary phase computer generated hologram(BPCGH) which can reconstruct hidden image perfectly instead of hidden image and repeat the hologram and encrypt it through the XOR operation with key image that is ramdomly generated binary phase components. We multiply the encrypted watermark by the weight function and embed it into the DC coefficients in the DCT domain of host image and an inverse DCT is performed. For the extracting process of watermark, we compare the DC coefficients of watermarked image and original host image in the DCT domain and dividing it by the weight function and decrypt it using XOR operation with key image. And we recover the hidden image by inverse Fourier transforming the decrypted watermark. Finally, we compute the correlation between the original hidden image and recovered hidden image to determine if a watermark exits in the host image. The proposed watermarking technique use the hologram information of hidden image which consist of binary values and encryption technique so it is very secure and robust to the external attacks such as compression, noises and cropping. We confirmed the advantages of the proposed watermarking technique through the computer simulations.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.15 no.5
• /
• pp.93-103
• /
• 2005

In this paper, we propose a RST resistant robust logo embedding technique for multimedia copyright protection Geometric manipulations are challenging attacks in that they do not introduce the quality degradation very much but make the detection process very complex and difficult. Watermark embedding in the normalized image directly suffers from smoothing effect due to the interpolation during the image normalization. This can be avoided by estimating the transform parameters using an image normalization technique, instead of embedding in the normalized image. Conventional RST resistant schemes that use full frame transform suffer from the absence of effective perceptual masking methods. Thus, we adopt $8\times8$ block DCT and calculate masking using a spatio-frequency localization of the $8\times8$ block DCT coefficients. Simulation results show that the proposed algorithm is robust against various signal processing techniques, compression and geometrical manipulations.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.209-212
• /
• 2001

오늘날, 디지털 워터마크에 대하여 기하학적 변환에 대한 강인성이 요구되고 있다. 본 논문에서는 회전, 이동 및 크기변화에 강인한 워터마킹 방법을 제안한다. 영상의 푸리에 변환 계수를 이용하여 이동에 대한 강인한 속성을 가지도록 하며, 입력 마스크의 상호 관계가 회전, 크기 변화에 강인하도록 워터마크 마스크를 생성한 후 영상에 삽입한다. 삽입된 워터마크의 검출은 영상의 주파수 영역의 radial projection 에 대한 워터마크 신호의 상관도를 이용하여 검출한다. 실험을 통하여 제안된 방법이 여러 가지 기하학적 변환에 강인함을 보여준다.

• Proceedings of the IEEK Conference
• /
• 2000.09a
• /
• pp.771-774
• /
• 2000

디지털 워터마킹은 오디오, 이미지, 영상과 같은 고품질 디지털 멀티미디어 컨텐츠의 불법적인 복제와 유통을 막고 저작권을 보호하기 위한 최후의 방어 수단으로 인식되고 있는 신호처리 기술이다. 오디오 신호에 삽입되는 워터마크 신호는 들리지 않아야 하는 특성과 함께, 압축이나 필터링과 같은 신호처리 과정 후에도 추출이 가능한 강인성을 지녀야 한다 본 연구에서는 현재 제안되고 있는 여러가지 오디오 워터마킹 방법 중에서 대역확산을 기반으로 한 PN 시퀸스 오디오 워터마킹 시스템에 대해서 다루었다. 삽입된 워터마크 신호가 들리지 않도록 하기 위해 인간의 청각 시스템에 기반한 심리음향모델을 적용하였으며, 효율적인 검출과 청각상의 특성을 고려한 여러 가지 실험을 수행하였다. 워터마크 정보의 검출에 있어서는 원 신호가 필요하지 않은Blind Detection 방법을 제안하여 효율적인 워터마킹 시스템을 구현할 수 있도록 하였다.