• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.3
• /
• pp.10-19
• /
• 2009

In this paper, an efficient optical watermark method using multiple phase wrapping and real-valued decoding key is proposed. In the embedding process, two zero-padded original images placed in two quadrants on input plane are multiplied with two statistically independent random phase patterns and are Fourier transformed, respectively. Two encoded images are obtained by taking the real-valued data from these Fourier transformed images. And then two phase-encoded patterns, used as a hidden image and a decoding key, are generated by the use of multiple phase wrapping from each of the encoded images. A transmitted image is made from the linear superposition of the weighted hidden images and a cover image. In reconstruction process, the mirror reconstructed images can be obtained at all quadrants by the inverse-Fourier transform of the product of the transmitted image and the decoding key. Computer simulation and optical experiment are demonstrated in order to confirm the proposed method.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2003.11a
• /
• pp.144-149
• /
• 2003

본 논문은 그레이 스케일 인쇄 영상의 저작권을 보호할 수 있는 워터마킹 기법에 관한 연구이다. 기존의 인쇄영상 워터마크 기법은 순서 디더링(ordered dithering)을 이용하는 까닭에 인쇄 영상의 화질 감소가 발생한다. 본 연구에서는 영상 하프토닝 기법중 오류 확산(error diffusion) 알고리즘을 이용하여 화질을 개선한 영상내에 워터마크를 삽입한다. 제안된 알고리즘은 Hagit이 제안한 순서 디더링 셀 집합을 사용한 워터마크를 오류확산 하프토닝 이미지에 삽입함으로 영상의 시각적인 화질 감소가 없을 뿐만 아니라, 프린터와 스캐너에 의한 영상의 변형에도 워터마크의 삽입과 추출이 가능하다. 제안된 알고리즘으로 워터마킹하는 경우 스캐너와 프린터의 기기적인 특성에서 나타나는 잡음과 회전에도 강한 워터마크를 삽입하고 추출할 수 있다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10a
• /
• pp.157-160
• /
• 2000

다중 워터마킹은 하나의 컨텐츠에 2개 이상의 다른 워터마크를 삽입하는 것으로 각 워터마크는 유일한 키로 정확하게 추출할 수 있어야 한다. 대역확산법(spread spectrum)을 이용한 다중 워터마킹은 삽입되는 워터마크간의 직교성(orthogonality)이 제공되어야 삽입된 워터마크들의 정확한 추출이 가능하다. 랜덤계열과 Hadamard 계열을 이용한 기존의 방법은 직교성이 보장되지 않기 때문에 워터마크가 정확히 추출되지 않은 문제가 발생한다. 따라서, 본 논문에서는 랜덤계열들을 Gram-schmidt 직교화 과정을 이용하여 직교화시킨 후, 직교화 된 랜덤계열로 워터마크를 삽입하여 정확한 추출이 가능한 방법을 제안하였다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2018.06a
• /
• pp.227-228
• /
• 2018

고가의 콘텐츠인 홀로그램의 저작권보호를 위한 수단으로 홀로그램의 워터마킹 방법을 제안한다. 제안하는 워터마킹 기법은 프레넬 변환의 퍼짐특성을 이용하기 위해 1차 프레넬 변환 결과에서 실수부와 허수부에 절대 값을 적용하여 저주파성분이 많은 데이터로 변형하고 2차 프레넬 변환을 적용한다. 2차 프레넬 변환으로 홀로그램 정보는 집중되고, 바깥 영역에 워터마크를 삽입한다. 제안한 워터마킹 기법은 기존의 프레넬 변환 특성을 이용한 방법에서 크기성분만 사용함으로써 생기는 소실을 제거하여 화질 좋은 워터마크를 추출할 수 있고, 다양한 공격에도 강인함을 확인 하였다.

• 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.

• Proceedings of the Acoustical Society of Korea Conference
• /
• spring
• /
• pp.355-358
• /
• 2004

최근 웨이블릿 변환을 이용하여 저주파수 부대역 신호를 반복적으로 분해하고 삽입된 워터마크 비트에 따라 특정 부대역 신호에 두개의 다른 반향 중 하나를 삽입하는 반향 삽입 기법을 제안하였다. 이 기법은 오디오 신호의 주파수 특성을 고려했기 때문에 시간 영역에서의 기존의 반향 삽입 기법에 비해 비가청성(inaudibility), 워터마크의 강인성(robustness) 및 용적성(capacity)을 모두 증가시킬 수 있다. 기존의 부대역 신호 기반 반향 삽입 기법이 단일 반향 커널만을 이용하였으나, 본 논문에서는 부대역 신호에 다중 반향 커널을 이용한 반향 삽입 기법을 제안한다. 이 기법은 주관적 왜곡(perceptibility)과 SNR(signal to Noise Ratio)과 같은 객관적인 왜곡 면에서, 원본 오디오 신호의 왜곡을 줄일 수 있다. 실험 결과를 통하여 기존의 방법에 비해 제안된 방법이 SNR과 DR(Detection Rate) 모두 좋은 성능을 보여 제안된 방법의 유효성을 입증하였다.

• Journal of Electrical Engineering and Technology
• /
• v.11 no.4
• /
• pp.974-986
• /
• 2016

Reversible image watermarking, a type of digital data hiding, is capable of recovering the original image and extracting the hidden message with precision. A number of reversible algorithms have been proposed to achieve a high embedding capacity and a low distortion. While numerous algorithms for the achievement of a favorable performance regarding a small embedding capacity exist, the main goal of this paper is the achievement of a more favorable performance regarding a larger embedding capacity and a lower distortion. This paper therefore proposes a reversible data hiding algorithm for which a novel piecewise 2D auto-regression (P2AR) predictor that is based on a rhombus-embedding scheme is used. In addition, a minimum description length (MDL) approach is applied to remove the outlier pixels from a training set so that the effect of a multiple linear regression can be maximized. The experiment results demonstrate that the performance of the proposed method is superior to those of previous methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.5
• /
• pp.2698-2717
• /
• 2019

This paper proposes a multi-stage encryption technique to enhance the level of secrecy of image to facilitate its secured transmission through the public network. A great number of researches have been done on image secrecy. The existing image encryption techniques like visual cryptography (VC), steganography, watermarking etc. while are applied individually, usually they cannot provide unbreakable secrecy. In this paper, through combining several separate techniques, a hybrid multi-stage encryption technique is proposed which provides nearly unbreakable image secrecy, while the encryption/decryption time remains almost the same of the exiting techniques. The technique consecutively exploits VC, steganography and one time pad (OTP). At first it encrypts the input image using VC, i.e., splits the pixels of the input image into multiple shares to make it unpredictable. Then after the pixel to binary conversion within each share, the exploitation of steganography detects the least significant bits (LSBs) from each chunk within each share. At last, OTP encryption technique is applied on LSBs along with randomly generated OTP secret key to generate the ultimate cipher image. Besides, prior to sending the OTP key to the receiver, first it is converted from binary to integer and then an asymmetric cryptosystem is applied to encrypt it and thereby the key is delivered securely. Finally, the outcome, the time requirement of encryption and decryption, the security and statistical analyses of the proposed technique are evaluated and compared with existing techniques.

• The KIPS Transactions:PartD
• /
• v.15D no.5
• /
• pp.713-720
• /
• 2008

Fingerprinting scheme uses digital watermarks to trace originator of unauthorized or pirated copies, however, multiple users may collude and escape identification by creating an average or median of their individually watermarked copies. Previous research works are based on ACC (anti-collusion code) for identifying each user, however, ACC are shown to be resilient to average and median attacks, but not to LCCA and cannot support large number of users. In this paper, we propose a practical SACC (scalable anti-collusion code) scheme and its angular decoding strategy to support a large number of users from basic ACC (anti-collusion code) with LCCA (linear combination collusion attack) robustness. To make a scalable ACC, we designed a scalable extension of ACC codebook using a Gaussian distributed random variable, and embedded the resulting fingerprint using human visual system based watermarking scheme. We experimented with standard test images for colluder identification performance, and our scheme shows good performance over average and median attacks. Our angular decoding strategy shows performance gain over previous decoding scheme on LCCA colluder set identification among large population.