• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.349-351
• /
• 2004

비디오는 인접한 프레임들간에 유사성이 있는 연속된 프레임들로 구성된다. 만약 인접한 프레임들간에 유사성이 존재하는 영역, 즉 움직임이 없는 영역에 워터마크를 삽입한다면 워터마크는 인지되기 쉽다. 본 논문에서는 워터마크의 투영성과 강인성을 위하여 이와 같은 비디오의 특성을 고려한 3D-DCT 계수를 이용한다. 즉, 3D-DCT 압축을 위한 양자화 상수에서 민감도를 유도하고 전역적인 움직임에 비해 지역적인 움직임이 큰 영역의 민감도를 조절한 후 움직임의 크기에 비례해서 시각적으로 중요한 계수를 워터마크를 삽입한다. 실험을 통하여 비디오의 특성을 고려하지 않고 3D-DCT 계수를 이용하는 기존의 방법과 비교해서 PSNR은 유사하지만 JND를 기반으로 하였기 때문에 워터마크의 투명성을 보장하였고 MPEG 압축 및 시간적 공격에 대한 강인성은 약 5% 정도의 성능향상이 있음을 확인하였다.

• The Journal of the Acoustical Society of Korea
• /
• v.28 no.7
• /
• pp.653-660
• /
• 2009

This paper proposes a robust audio watermarking algorithm for copyright protection and improvement of sound quality after embedding a watermark into an original sound. The proposed method computes the FFT (fast Fourier transform) of the original sound signal and divides the spectrum into a subbands. Then, it is necessary to calculate the energy of each subband and sort n subbands in descending order corresponding to its power. After calculating the energy we choose k subbands in sorted order and find p peaks in each selected subbands, and then embed a length m watermark around the p peaks. When the listeners hear the watermarked sound, they do not recognize any distortions. Furthermore, the proposed method is robust as much as Cox's method to MP3 compression, cropping, FFT echo attacks. In addition to this, the experimental results show that the proposed method is generally 10 dB higher than Cox's method in SNR (signal-to-noise ratio) aspect.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.3C
• /
• pp.256-268
• /
• 2007

In this paper, we present a watermarking method for 3-D mesh sequences. The main idea is to transform vertex norm with the identical connectivity index along temporal axis using wavelet transform and modify the distribution of wavelet coefficients in temporally high (or middle) frequency frames according to watermark bit to be embedded. All vertices are divided into groups, namely bin, using the distribution of coefficients in low frequency frames. As the vertices with the identical connectivity index over whole frames belong to one bin, their wavelet coefficients are also assigned into the same bin. Then, the watermark is embedded into the wavelet coefficients of vertex norm. Due to the use of the distribution, our method can retrieve the hidden watermark without any information about original mesh sequences in the process of watermark detection. Through simulations, we show that the proposed is flirty robust against various attacks that are probably concerned in copyright protection of 3-D mesh sequences.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2002.05d
• /
• pp.901-906
• /
• 2002

This paper is a research about method, that is used in Rapid Prototyping system, that inserts and extracts watermark in STL(standard transform language) that has a 3D geometrical model. The proposed algorithm inserts watermark in the vertex domain of STL facet without the distortion of 3D model. If we make use of a established algorithm for watermarking of STL, a watermark inserted to 3D model can be removed by simple attack that change order of facet. The proposed algorithm has robustness about these attack. Experiment results verify that the proposed algorithm, to encode and decode watermark in STL 3D geometrical model, doesn't distort a 3D model at all. And it shows that the proposed algorithm is available.

• 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 the Korea Institute of Information Security & Cryptology
• /
• v.17 no.6
• /
• pp.131-142
• /
• 2007

In this paper, semi-fragile watermarking algorithm was proposed for the application to RP(Rapid Prototyping) system. In the case of the perceptual change or distortion of the original one, the prototype product will be affected from the process because the RP system requires the high precision measure. Therefore, the geometrical transformations like translation, rotation and scaling, the mesh order change and the file format change are used in the RP system because they do not change the basic shapes of the 3D models, but, the decimation and the smoothing are not used because they change the models. The proposed algorithm which is called semi-fragile watermarking is robust against to these kinds of manipulations which preserve the original shapes because it considers the limitations of the RP system, but fragile against to the other manipulations which change the original shapes. This algorithm does not change the model shapes after embedding the watermark information, that is, there is no shape difference between the original model and the watermarked model. so, it will be useful to authenticate the data integrity and hide the information in the field of mechanical engineering which requires the high precision measure.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2016.06a
• /
• pp.280-283
• /
• 2016

본 논문에서는 DIBR 3 차원 영상을 위한 블라인드 워터마크 방법을 제안한다. DIBR 을 이용한 3 차원 영상은 낮은 Bitrate 와 시점조정 가능성으로 인해 주목받고 있지만, DIBR 과정 중 워터마크 손상이 발생해 워터마크에 어려움이 있다. 이를 극복하기 위해 DIBR 의 특성을 이용한 깊이영상 기반으로 워터마크 삽입 영역을 탐색하는 방법을 사용하며, 이를 통해 시점이동에 민감하지 않은 영역에 워터마크를 삽입하는 것이 효과적임을 실험적으로 증명하였다. 또한 시점이동 후 사라질 가능성이 큰 불필요한 워터마크 삽입을 최소화하여 워터마크 삽입 후 영상의 화질저하를 줄였다. 이에 본 논문에서는 깊이영상을 이용해 변화가 적은 영역을 탐색하기 위한 연구를 진행하였다. 이는 후에 가상 시점 영상에 추가적인 공격이 가해지더라도 더 강인성을 가질 수 있는 기초가 되었다. 또한 블라인드 워터마크 방법을 적용하기 위해 기존 워터마크 데이터와 유사도를 측정하는 방식으로 워터마크 삽입 위치를 파악하였다.

• 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 the Korea Institute of Information and Communication Engineering
• /
• v.9 no.3
• /
• pp.616-621
• /
• 2005

In this paper. digital watermarking algorithm based on human visual system and transform domain is presented. Firstly, original image is separated into RGB thannels, watermark is embedded into the coefficients of DCT so as to consider a contrast sensitivity and texture degrees. In preprocessing, DCT domain based transform is involved and binary image of visually recognizable patterns is utilized as a watermark. Consequently, experimental results showed that proposed algorithm is robust and imperceptibility such destruction attack as JPEG compression.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.1
• /
• pp.43-50
• /
• 2005

We proposed a method for embedding coded binary data into EZW bitstreams and extracting embedded data from EZW bitstreams using the traditional EZW decoder. EZW coder have two passes. The first pass, the dominant pass have four symbols, P, N, IZ, ZTR. The second pass is sub-ordinary pass which specifies the value of symbol. In the proposed methods, we use ZTR symbol in the dominant pass. We embed watermark into ZTR symbol in the highest frequency band which original image is transferred by wavelet transform. The proposed digital watermarking method shows good properties for robustness in the low bit rate. Accordingly, based on the proposed digital watermarking, video and 3D image watermarking will become a new area for research in the near future.