• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.11C
• /
• pp.1118-1122
• /
• 2003

In this paper, we propose a new invisible digital watermarking scheme based on wavelet transform using singular value decomposition. Embedding process is started by decomposing the lowest frequency band image with 3${\times}$3 block among which we define the watermark block chosen by a key set; entropy and condition number of the block. A watermark is embedded in the singular values of each watermark blocks. This provides a robust watermarking in lowest possible time-frequency domain. To detect the watermark, we are locally modeling an attack as 3${\times}$3 matrices on the watermark blocks. Combining with the SVD and the attack matrices, we estimate watermark set corresponding to the watermark blocks. In each watermark block, we determine an optimal watermark which is justified by the T-testing. A numerical experiment shows that the proposed watermarking scheme efficiently detects the watermarks from several JPEG attacks.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.55 no.4
• /
• pp.165-172
• /
• 2006

In this paper we present a technique for detecting cross-reference points that allows improving watermark detect-ability. In general, Harris detector is commonly used for finding salient points. Harris detector is a kind of combined corner and edge detector which is based on neighboring image data distribution, therefore it has some limitation to find accurate salient points after watermark embedding or any kinds of digital attacks. The new method proposed in this paper used not data distribution but geometrical structure of a normalized image in order to avoid pointing error caused by the distortion of image data. After normalization, we constructed pre-specified number of virtual lines from top to bottom and left to right, and several of cross points were selected by a random key. These selected points specify almost same positions with the accuracy more than that of Harris detector after digital attacks. These points were arranged by a random key, and blocks centered in these points were formed. A reference watermark is formed by a block and embedded in the next block. Because same alteration is applied to the watermark generated and embedded blocks. the detect-ability of watermark is improved even after digital attacks.

• The KIPS Transactions:PartB
• /
• v.9B no.1
• /
• pp.91-98
• /
• 2002

In this paper, an implementation method of the efficient image transmission stage using watermarking and channel ceding is proposed. Usually, image communication system consists of both a transmitter part and a receiver part. The transmitter part takes charge of copyright protection of the generated image data, and image coding and compression that can deal with channel noises when transmitting. In the transmitter part, we propose a channel coding method which protects both the watermark signal and the original signal for protecting the copyright of image data and solving channel noises when transmitting. Firstly, copyright protection of image data is conducted. For this, image structure analysis is performed, and both the improvement of image quality and the generation of the watermark signal are made. Then, the histogram is constructed and the watermark signals are selected from this. At this stage, by embedding of the coefficients of curve fittness into the lower 4 bits of the image data pixels, image quality degradation due to the embedding of watermark signals are prevented. Finally, turbo coding, which has the most efficient error correction capability in error correction codes, has been conducted to protect signals of watermark and preserved original image quality against noises on the transmission channel. Particularly, a new interleaving method named "semi random inter]easer" has been proposed.

• Journal of Internet Computing and Services
• /
• v.11 no.2
• /
• pp.99-107
• /
• 2010

In this paper a blind watermarking algorithm for digital image is presented. The proposed method operates in wavelet domain. The watermark is decomposed into 2D-IMFs using BEMD which is the 2-dimensional extension of 1 dimensional empirical mode decomposition. The CDMA based on SS technique is applied to watermark embedding and detection process. In the watermark embedding process, each IMF of watermark is embedded into middle frequency subimages in wavelet domain, so subimages just include partial information about embedded watermark. By characteristics of BEMD, when the partial information of watermark is synthesized, the original watermark is reconstructed. The experimental results show that the proposed watermarking algorithm is imperceptible and moreover is robust against JPEG compression, common image processing distortions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.7
• /
• pp.3475-3496
• /
• 2018

Most of current watermarking algorithms for GIS vector data embed copyright information by means of modifying the coordinate values, which will do harm to its quality and accuracy. To preserve the fidelity of vector line data and protect its copyright at the same time, a lossless watermarking algorithm is proposed based on storage feature in this paper. Firstly, the superiority of embedding watermark based on storage feature is demonstrated theoretically and technically. Then, the basic concepts and operations on storage feature have been defined including length and angle of the polyline feature. In the process of embedding watermark, the watermark information is embedded into directions of polyline feature by the quantitative mechanism, while the positions of embedding watermark are determined by the feature length. Hence, the watermark can be extracted by the same geometric features without original data or watermark. Finally, experiments have been conducted to show that coordinate values remain unchanged after embedding watermark. Moreover, experimental results are presented to illustrate the effectiveness of the method.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1511-1514
• /
• 2002

This paper presents content adaptive image watermark embedding using stochastic visual model based on multiwavelet transform. To embedding watermark, the original image is decomposed into 4 levels using a discrete multiwavelet transform, then a watermark is embedded into the JND(just noticeable differences) of the image each subband. The perceptual model is applied with a stochastic approach fer watermark embedding. This is based on the computation of a NVF(noise visibility function) that have local image properties. The perceptual model with content adaptive watermarking algorithm embed at the texture and edge region for more strongly embedded watermark by the JND. This method uses stationary Generalized Gaussian model characteristic because watermark has noise properties. The experiment results of simulation of the proposed watermark embedding method using stochastic visual model based on multiwavelet transform techniques was found to be excellent invisibility and robustness.

• The Journal of the Convergence on Culture Technology
• /
• v.6 no.1
• /
• pp.485-488
• /
• 2020

In this paper, a technique for securely concealing the watermark, which is intellectual property information, in the image pixel LSB using spatial encryption is proposed. The proposed watermarking technique can be effectively used to protect intellectual property of images. The proposed technique can be used to extract watermark without loss from the stego-image, which is a hidden image of spatially encrypted watermark. The experimental results confirmed the superiority of the proposed technique. As a result of performing watermarking using the proposed technique, the image quality of the stego-image is higher than 51 dB, so humans cannot visually recognize the presence of a watermark. Due to the watermark is spatially encrypted, the security of the watermark is excellent.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.213-216
• /
• 2001

본 논문은 DCT, FFT 및 Wavelet 등과 같은 주파수 영역에 의한 Watermarking 기법에서 정확한 Watermark를 검출하기 위하여 제안한 알고리즘이다. 본 논문에서 사용한 알고리즘은 기존의 왜곡된 영상에서 원 영상의 주파수 변환 값을 제거하여 왜곡된 상태의 영상 값에서 삽입된 Watermark를 검출하는 알고리즘에서 벗어나 왜곡된 값을 완전히 제거한 상태에서 영상의 Watermark를 검출함으로써 보다 완벽한 Watermark를 검출 할 수 있는 향상된 알고리즘을 제안하였다.

• Proceedings of the IEEK Conference
• /
• 2002.06d
• /
• pp.219-222
• /
• 2002

In this paper, we propose a new blind image watermarking method in wavelet domain. It is necessary to find out watermark insertion location in blind watermark. We use horizontal and vertical difference of LL components to select watermark insertion location, because increment or decrement of successive components is rarely changed in LL band. A pseudo-random sequence is used as a watermark. Experimental results show that the proposed method is robust to various kinds of attacks such as JPEG lossy compression, averaging, median filtering, resizing, histogram equalization, and additive Gaussian noise.

• Proceedings of the IEEK Conference
• /
• 2002.06d
• /
• pp.85-88
• /
• 2002

In this paper, the proposed watermark algorithm is based on energy distribution of the subband coefficients in the frequency domain and edge of the original image in the spacial domain. Out of these information, the KeyMap which decides the embedded position of watermark is produced. And then the binary watermark is embedded into the wavelet coefficient of LL3 subband using KeyMap and LFSR(Linear Feedback Shift Register).