• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.05c
• /
• pp.2189-2192
• /
• 2003

전자정부, 전자상거래의 활성화로 디지털 문서가 빠른 속도로 유통되고 있기에 이에 대한 효과적인 보호대책이 필요한 실정이다. 본 논문에서는 Window Pattern을 이용하여 Binary Image에 저작권 정보를 삽입하는 방안을 제안한다. 삽입대상 Window Pattern을 결정하고 이러한 Pattern으로 원본 영상을 Scan하면서 픽셀 값에 변화를 주게 된다. 이렇게 되어 하나의 Pattern에 1bit의 정보의 삽입이 가능하게 되고 추출 시 원본을 필요로 하지 않으며 실용성이 높고 적용분야도 넓다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11c
• /
• pp.1851-1854
• /
• 2003

본 논문에서는 영상의 인증과 무결성을 위한 새로운 블록 연성 워터마킹을 제안한다. 원 영상의 인증과 무결성을 확인하기 위하여 이진로고 영상을 워터마크로 사용한다. 원 영상의 각 픽셀의 정보뿐만 아니라 해당 블록의 정보로 binary look-up table을 선택하여 워터마크 비츠를 삽입한다. 기존 방식의 문제점으로 제시된 공격[6,7]을 효율적으로 막으면서도 시각적으로 변조유무 및 픽셀단위 또는 블록단위로 변조위치를 감지할 수 있음을 보인다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04a
• /
• pp.464-466
• /
• 2003

전자정부, 전자상거래의 활성화로 디지털 문서가 빠른 속도로 유통되고 있기에 이에 대한 효과적인 보호대척이 필요한 실정이다. 본 논문에서는 Window Pattern을 이용하여 문서 이미지에 저작권 정보를 삽입하는 방안을 제안한다. 삽입대상 Window Patte을 결정하고 이러한 Pattern으로 원본 영상을 Scan하면서 픽셀 값에 변화를 주게 된다. 이렇게 되어 하나의 Pattern에 1 bit의 정보의 삽입이 가능하게 되고 추출 시 원본은 필요로 하지 않으며 실용성이 높고 적용분야도 넓다.

• Proceedings of the KIEE Conference
• /
• 2003.07d
• /
• pp.2537-2539
• /
• 2003

본 논문에서는 의료 영상에 대한 저작권보호를 위한 새로운 워터마킹 알고리즘을 제안한다. 본 알고리즘에서는 이산 웨이블릿 변환 대신에 계산량이 적은 정수 웨이블릿 변환을 이용하였다. 본 논문에서는 정수 웨이블릿 공간에서 유사-잡음 수열을 워터마크로 삽입 하였다. 워터마크를 추출할 때 확산스펙트럼 기법을 이용하고 유사도는 공분산 수열에서 결정한다. 실험을 통하여 제안한 알고리즘이 노이즈, 압축 등 공격에 강인함을 보임을 확인하였다.

• Journal of KIISE:Software and Applications
• /
• v.30 no.10
• /
• pp.938-943
• /
• 2003

In this paper, we Propose a method using the Tikhonov-Miller process to improve the robustness of watermarking under various attacks. A visually recognizable pattern watermark is embedded in the LH2, HL2 and HH2 subband of wavelet transformed domain using threshold and besides watermark is embeded by utilizing HVS(Human Visual System) feature. The pattern watermark was interlaced after random Permutation for a security and an extraction rate. To demonstrate the improvement of robustness and similarity of the proposed method, we applied some basic algorithm of image processing such as scaling, filtering, cropping, histogram equalizing and lossy compression(JPEG, gif). As a result of experiment, the proposed method was able to embed robust watermark invisibility and extract with an excellent normalized correlation of watermark under various attacks.

• Journal of Korea Multimedia Society
• /
• v.13 no.4
• /
• pp.582-593
• /
• 2010

Recently the commercial value of GIS(geographic information system) has been increased with growing application demands of spatial information in life space. Also, GIS has been expanded to the integrated information system that provides the ease access to map information by public users and also the combined service of GIS map data and various multimedia contents. But several security problems of GIS map data have brought up at GIS industries, such as the illegal copy and distribution of GIS map data. Furthermore, the copyright protection of GIS map data has not been researched yet compared with image and video contents. This paper presents a polyline based watermarking scheme for the copyright protection of GIS vector map. The proposed scheme analyzes the structure of vector map and embeds adaptively the watermark by using the distance distribution of polyline components. From experimental results, we verified that the proposed scheme satisfies the invisibility and the robustness of geometrical attacks.

• Journal of Broadcast Engineering
• /
• v.6 no.1
• /
• pp.50-57
• /
• 2001

A digital watermarking is a newly developed scheme to embed invisible or inaudible information Into the host data in order to insist the copyright of the owner or the creator. This paper describes a robust data embedding scheme that employs inner product and adaptive quantization. Compared to the previous works for digital watermarking, our proposed scheme can embed relatively large amount of Information, since a secrete key Is not directly relaxed to the watermark data. A secret key is used for the design of random direction vectors. which are taken Inner product with the DCT transformed feature set data. In odder to achieve robustness against malicious attacks. we exploit the Properties of human visual system In designing the random direction vectors which behave as embedded noises. Experimental results show that we can recover the embedded information without utilizing the original host data. We also demonstrate that the ownership assertion is possible even though The watermarked data may undergo common signal processing operations, such as JPEG compression. clopping. and filtering.

• Journal of Broadcast Engineering
• /
• v.8 no.3
• /
• pp.268-277
• /
• 2003

In this paper, we propose a new video watermarking method exploiting the human visual system (HVS) to find effective locations. in the video frames which make the watermark robust and imperceptible simultaneously. In particular, we propose a new HVS-optimized weighting map for hiding the watermark by considering HVS in three different aspects : frequency, spatial, and motion masking effects. The global masking map is modeled by combining the frequency masking, the spatial masking, and the motion masking. In this paper, we use a watermark which is generated by the bitwise exclusive-OR operation between a logo image and a random sequence. The amount of watermarks is weighted by a control parameter. Furthermore, we embed the watermark in the uncompressed video sequence for the general watermarking method available to various coding schemes. Simulation results show that the watermark is imperceptible and the proposed method is good for watermark capacity. It is also demonstrated that the proposed method is robust against various attacks, such as MPEG coding, MPEG re-encoding, and frame attacks.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.42 no.1
• /
• pp.67-78
• /
• 2005

We proposed a blind watermarking for 3D mesh model using the patch CEGIs. The CEGI is the 3D orientation histogram with complex weight whose magnitude is the mesh area and phase is the normal distance of the mesh from the designated origin. In the proposed algorithm we divide the 3D mesh model into the number of patch that determined adaptively to the shape of model and calculate the patch CEGIs. Some cells for embedding the watermark are selected according to the rank of their magnitudes in each of patches after calculating the respective magnitude distributions of CEGI for each patches of a mesh model. Each of the watermark bit is embedded into cells with the same rank in these patch CEGI. Based on the patch center point and the rank table as watermark key, watermark extraction and realignment process are performed without the original mesh. In the rotated model, we perform the realignment process using Euler angle before the watermark extracting. The results of experiment verify that the proposed algorithm is imperceptible and robust against geometrical attacks of cropping, affine transformation and vertex randomization as well as topological attacks of remeshing and mesh simplification.

• Journal of IKEEE
• /
• v.15 no.3
• /
• pp.241-247
• /
• 2011

In this paper, it was implemented an algorithm of multimedia fingerprinting in DCT block. For the improvement of the limits of DRM’s ability, the proposed algorithm could be decided a responsibility boundary to judge a traitor who falsified the content according to perform separately a watermarking of content provider and a fingerprinting of content user. At the test image size($128{\times}128$) and block size($8{\times}8$) of the content provider, the measured PSNR is Inf~46.6dB with watermarking strength ${\Theta}=0.5{\sim}1.2$, and at a number of users and user's code length are n=7,15,31,63 and l=7,15,31,64 each, the measured PSNR is Inf~46.1 with fingerprinting code length l=7,15,31,63. Finally, a traitor tracing of the falsified content is approached to a trace ratio 1 which is extended to n-1.