• Journal of information and communication convergence engineering
• /
• v.2 no.4
• /
• pp.251-255
• /
• 2004

In this paper, we present a watermarking scheme based on the DWT (Discrete Wavelet Transform) and the ANN (Artificial Neural Network) to ensure the copyright protection of the digital images. The problem to embed watermark is not clear to select important coefficient in the watermarking. We used the RBF (Radial-Basis Function) to solve the problem. We didn't apply the whole wavelet coefficients, but applied to only the wavelet coefficients in the selected node. Using the ANN, although even the watermark casting process and watermark verification process are in public, nobody knows the location of embedding watermark except of authorized user. As the result, the watermark is good at the strength test-filtering, geometric transform and etc.

• Journal of Information Processing Systems
• /
• v.12 no.4
• /
• pp.681-687
• /
• 2016

Today's modern world requires a digital watermarking technique that takes the redundancy of an image into consideration for embedding a watermark. The novel algorithm used in this paper takes into consideration the redundancies of spatial domain and wavelet domain for embedding a watermark. Also, the cryptography-based secret key makes the algorithm difficult to hack and help protect ownership. Watermarking is blind, as it does not require the original image. Few coefficient matrices and secret keys are essential to retrieve the original watermark, which makes it redundant to various intentional attacks. The proposed technique resolves the challenge of optimizing transparency and robustness using a Canny-based edge detector technique. Improvements in the transparency of the cover image can be seen in the computed PSNR value, which is 44.20 dB.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.6
• /
• pp.149-158
• /
• 2005

This paper proposed a blind watermarking method for video contents which satisfies both the invisibility and the robustness to attacks to prohibit counterfeiting, modification, illegal usage and illegal re-production of video contents. This watermarking algorithm targets MPEG compression system and was designed to control the amount of watermarking to be inserted according to the adaptive quantization scale code to follow the adaptive quantization of the compression system. The inserting positions of the watermark were chosen by considering the frequency property of an image and horizontal, vertical and diagonal property of a $8{\times}8$ image block. Also the amount of watermarking for each watermark bit was decided by considering the quantization step. This algorithm was implemented by C++ and experimented for invisibility and robustness with MPEG-2 system. The experiment results showed that the method satisfied enough the invisibility of the inserted watermark and robustness against attacks. For the general attacks, the error rate of the extracted watermark was less than $10\%$, which is enough in robustness against the attacks. Therefore, this algorithm is expected to be used effectively as a part in many MPEG systems for real-time watermarking, especially in the sensitive applications to the network environments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.1C
• /
• pp.78-85
• /
• 2007

With the advancement of the digital broadcasting and popularity of the Internet, recently, many studies are making on the digital watermarking for the copyright protection of digital data. This paper proposes the minimum modification method of motion vector to minimize the degradation of video quality, hiding subtitles of many language and information of OST(original sound track), character profiles, etc. as well as the copyright protection. Our proposed algorithm extracts feature vector by comparing motion vector data with watermark data, and minimize the modification of motion vectors by deciding the inversion of bit. Thus the degradation of video quality is minimized comparing to conventional algorithms. This algorithm also can check data integrity, and retrieve embedded hidden data simply and blindly. And our proposed scheme can be useful for conventional MPEG-1, -2 standards without any increment of bit rate in the compressed video domain. The experimental result shows that the proposed scheme obtains better video quality than other previous algorithms by about $0.5{\sim}1.5dB$.

• Journal of Korea Multimedia Society
• /
• v.7 no.5
• /
• pp.744-754
• /
• 2004

In this paper, a polarity based blind watermarking method considering wavelet coefficients modification is proposed. In this proposed method, we use an asymmetric thresholds watermarking(ATW) in which detection threshold is higher than inserting threshold in order to enhance watermark detection ratio in attacked images. Also, in order to reduce errors in the detected value of watermarks according to small changes in the coefficient values when detecting watermarks, it set the range for movement variation of the coefficients and lowered the sensitivity of variation by ignoring the variations that fall into this range. For this purpose, the polarity preservation threshold $\beta$ was set and a watermark was detected based on the polarity only for the difference that was larger than $\beta$. The experimental results show that the proposed method has good quality and is robust to various attacks such as the JPEG lossy compression, noise addition, cropping, blurring, etc.

• Journal of information and communication convergence engineering
• /
• v.10 no.2
• /
• pp.175-180
• /
• 2012

This paper presents a blind watermark detection scheme for an additive watermark embedding model. The proposed estimation-correlation-based watermark detector first estimates the embedded watermark by exploiting non-Gaussian of the real-world audio signal and the mutual independence between the host-signal and the embedded watermark and then a correlation-based detector is used to determine the presence or the absence of the watermark. For watermark estimation, blind source separation (BSS) based on independent component analysis (ICA) is used. Low watermark-to-signal ratio (WSR) is one of the limitations of blind detection with the additive embedding model. The proposed detector uses two-stage processing to improve the WSR at the blind detector; the first stage removes the audio spectrum from the watermarked audio signal using linear predictive (LP) filtering and the second stage uses the resulting residue from the LP filtering stage to estimate the embedded watermark using BSS based on ICA. Simulation results show that the proposed detector performs significantly better than existing estimation-correlationbased detection schemes.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.231-234
• /
• 2001

In this paper, we present a robust watermarking technique based on a DCT-domain watermarking approach and an order statistic(OS) filter. The proposed technique inserts one watermark into each of four coefficients within a 2 ${\times}$ 2 block which is scanned on DCT coefficients in the zig-zag ordering from the medium frequency range. The detection algorithm uses an adaptive trimmed mean operator as a local estimator of the embedded watermark to obtain the desired robustness in the presence of additive Gaussian noise and JPEG compression attacks. The performance is analyzed through statistical analysis and numerical experiments. It is shown that the robustness properties against additive noise and JPEG compression attacks are more enhanced than the previous techniques.

• Journal of Korea Multimedia Society
• /
• v.11 no.6
• /
• pp.796-806
• /
• 2008

This paper presents a blind video watermarking algorithm that has the robustness against spatial, temporal, and SNR scalability and transcoding for the copyright protection of video contents in heterogeneous multimedia service. The proposed process of watermark embedding and detecting is accomplished on base layer for considering spatial scalability. The watermark consists of the string and the ordering number of string for considering temporal scalability. Thus, each of frames has the bitstream of one character and a ordering number of its character. To robust against FGS, the proposed algorithm quantizes low and middle frequency coefficients in ROI region of each of frames and embeds its watermark bitstream into the specific bits of the quantized coefficients. Experimental results verified that the proposed algorithm satisfies the invisibility of watermark and also has the robustness against spatial scalability, temporal scalability and FGS.

• Proceedings of the Korea Contents Association Conference
• /
• 2003.05a
• /
• pp.214-217
• /
• 2003

In this paper, we proposed an efficient blind watermarking algorithm using wavelet transform. The proposed algorithm inserts watermark into the high frequency subbands that were transformed by 1-level wavelet transform of original image. Watermark insertion is achieved by exchanging each the corresponding coefficients in the HL, LH, HH subbands according to be inserted watermark value. And watermark is extracted by the relation of wavelet coefficients without original image. Experimental results demonstrate that watermarked image has a good quality not to be able to be perceptible and is robust various attacks such as JEPG lossy compression, clipping and sharpening.

• Journal of Information Processing Systems
• /
• v.12 no.4
• /
• pp.765-778
• /
• 2016

In watermarking schemes, the discrete wavelet transform (DWT) is broadly used because its frequency component separation is very useful. Moreover, LU decomposition has little influence on the visual quality of the watermark. Hence, in this paper, a novel blind watermark algorithm is presented based on LU transform and DWT for the copyright protection of digital images. In this algorithm, the color host image is first performed with DWT. Then, the horizontal and vertical diagonal high frequency components are extracted from the wavelet domain, and the sub-images are divided into $4{\times}4$ non-overlapping image blocks. Next, each sub-block is performed with LU decomposition. Finally, the color image watermark is transformed by Arnold permutation, and then it is inserted into the upper triangular matrix. The experimental results imply that this algorithm has good features of invisibility and it is robust against different attacks to a certain degree, such as contrast adjustment, JPEG compression, salt and pepper noise, cropping, and Gaussian noise.