• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.8
• /
• pp.1484-1490
• /
• 2007

The Cross Reference Point(CRP) is a robust method for finding salient points in watermarking systems because it is based on the geometrical structure of a normalized image in order to avoid pointing error caused by digital attacks. After normalization of an image, the 100 CRPs are calculated. Next, the 100 blocks centered by CRPS are formed. These 100 blocks are arranged using a secrete key. Each boundary of 50 out of 100 blocks is surrounded by 8 blocks which are selected by the ordered number of a preceding block. This number is a seed of random number generator for selecting 8 out of 50 blocks. The search area of a center block is formed by a secrete key. The pixels of a center block are quantized to 10 levels by predefined thresholds. The watermarks are generated by the 50 quantized center blocks. These watermarks are embedded directly in the remaining 50 blocks. In other words, 50 out of 100 blocks are utilized to generate watermarks and the remaining 50 blocks are used to watermark embedding. Because the watermarks are generated in the given images, we can successfully detect watermarks after several digital attacks. The reason is that the blocks for the generation and detection of watermarks are equally affected by digital attacks except for the case of local distortion such as cropping.

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

• The KIPS Transactions:PartD
• /
• v.9D no.5
• /
• pp.925-930
• /
• 2002

This paper discusses techniques for embedding data into 3D polygonal models of geometry. Much researches of Watermarking had been gone as element technology of DRM (digital rights management). But, few research had gone to 3D polygonal model. Most research is limited at text document, 2D image, animation, music etc. RP system is suitable a few production in various goods species, and it is used much in industry to possible reason that produce prototype and find error or incongruent factor at early stage on design in product development childhood. This paper is research about method that insert watermark in STL ( stereolithography) file that have 3D shape model. Proposed algorithm inserts watermark in normal vector region and facet's interior region of 3D shape data. For this reason, 3D shape does not produce some flexure and fulfill invisibility of watermark. Experiment results that insert and extract watermark in normal netter region and facet's Interior region of 3D shape data by proposed algorithm do not influence entirely in 3D shape and show that insertion and extraction of watermark are possible.

• Journal of the Institute of Electronics Engineers of Korea TE
• /
• v.39 no.3
• /
• pp.28-34
• /
• 2002

This paper describes embedding non-linearly watermark data in the components of pixel intensities in the spatial domain of an image. The principle of the proposed method is that when an image is segmented regularly to the blocks, the pixels of the block have the non-linear properties without any similarity. That is, for the block with strong non-linear property human can't feel the visual different to the modified pixel values, on the other hand for the block with weak non-linear property human can feel the visual different to the a little modified pixel values. Thus we could embed the watermark data according to the non-linear property of the blocks. As the result of the simulation, against some general image processing attacks our algorithm could keep robust and be responsible for the copyright certainly. 

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.1
• /
• pp.16-26
• /
• 2000

The proposed method inserts a watermark information not mto a whole Image region but only into regions of interest(ROIs) To extract the ROIs, we divide an original Image into sub-blocks and use modified Shi-Kuo Chang's PIM(picture information measure) as the criteria to select the ROIs Considering the directional information and frequency bands, we insert the watermark information into sub-blocks m the DCT domain. The proposed method can reduce the distortion in comparison With the other methods which utilize the whole Image as an nor The proposed method makes much less damaged Images m comparison to the other methods And those Images processed by the proposed algorithm are more robust to the changes caused by signal processing operations such as resampling, clipping. noise, and so on Also due to the block-based watermark insertion, the proposed method has the robustness to the Image compression processes such as JPEG and MPEG.

• Journal of Korea Multimedia Society
• /
• v.18 no.4
• /
• pp.483-491
• /
• 2015

Data hiding is one of protective methods that can authenticate the completeness of digital information and protect intelligent property rights and copyright through secret communications. In this paper, we propose a data hiding method using pixel-value modular operation that has a high capacity while maintaining a good visual quality. The proposed method can embed secret data on the every pixel of a cover image by modular operation. The experiment results demonstrate that the proposed method has a high capacity and good visual quality where the embedding capacity is 91,138 bytes, the PSNR is 47.94dB, and the Q index is 0.968.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2006.05a
• /
• pp.685-688
• /
• 2006

본 논문에서는 기존의 DCT(Discrete Cosine Transform)를 이용한 디지털 워터마킹 방법을 개선하여 비가시성을 향상시키는 DCT 기반의 디지털 워터마킹 방법을 제안하고자 한다. 이에 원 영상을 DCT 변환한 영역에 워터마크로 사용할 이미지를 이진화하여 얻은 픽셀 값을 기준으로 워터마크를 삽입하고자 한다. 삽입 할 워터마크는 식별하기 어려운 의사난수를 사용하지 않고 가시적으로 인지할 수 있는 문자(서명) 혹은 도장으로 구성된 이진 영상을 사용한다. 이 방법의 강인성 평가를 위해 워터마크가 삽입된 영상을 대상으로 영상처리를 수행하지 않은 경우, JPEG 영상압축, cropping, 필터링, 밝기 조절 및 대비 확장 등 기본적인 영상처리 알고리즘을 적용한 후 워터마크를 검출하였다. 실험 결과 제안된 방법의 워터마킹 영상은 기존 방법에 비하여 워터마크가 삽입된 영상의 화질이 비교적 우수하였으며 검출된 워터마크의 시각적인 인지도가 높아 가시적 효율성이 뛰어남을 검증하였다. 최종적으로, 실험에 의해 제안한 방법의 유용성을 입증하고자 한다.

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

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

• Proceedings of the IEEK Conference
• /
• 2000.09a
• /
• pp.511-514
• /
• 2000

디지털 워터마킹이란 디지털 컨텐츠의 저작권을 보호하기 위해 보이지 않는 임의의 데이터를 미디어에 삽입하는 방법이다. 본 논문에서는 주파수 영역으로 변환된 원 데이터를 임의의 방향으로 정의된 데이터와 내적(Inner Product)하여 이를 워터마크 정보에 따라 변화시키는 방법을 제안한다. 이 방법은 비밀키가 워터마크 데이터와 연관된 것이 아니기 때문에 어떠한 종류의 데이터도 삽입할 수 있다는 장점이 있다. 사용되는 비밀키는 주파수 영역으로 변환된 원 데이터와 내적되는 임의의 데이터를 만드는데 사용된다. 또한 워터마크의 견고성을 높이기 위해, 주파수 영역으로 변환된 원 데이터와 내적된 임의의 데이터는 잡음처럼 되므로 이를 인간 시각 특성을 사용하여 모델링 하였다. 제안된 방법은 원 영상 없이 워터마크를 검출할 수 있으며. 워터마크의 견고성 실험을 위해 JPEG, Cropping, Resizing. Gaussian 잡음 등을 적응하였다.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.407-410
• /
• 2003

We propose a new logo watermark scheme for digital images which embed a watermark by modifying middle-frequency sub-bands of wavelet transform. Independent component analysis (ICA) is introduced to authenticate and copyright protect multimedia products by extracting the watermark. To exploit the Human visual system (HVS) and the robustness, a perceptual model is applied with a stochastic approach based on noise visibility function (NVF) for adaptive watermarking algorithm. Experimental results demonstrated that the watermark is perfectly extracted by ICA technique with excellent invisibility, robust against various image and digital processing operators, and almost all compression algorithms such as Jpeg, jpeg 2000, SPIHT, EZW, and principal components analysis (PCA) based compression.