• Proceedings of the IEEK Conference
• /
• 2000.06d
• /
• pp.118-122
• /
• 2000

Nowadays, it is popular to use the spread spectrum watermarking algorithm for still image. But there is high error probability of the retrieved watermark in the spread spectrum owing to the correlation between image and spreaded watermark sequence. In this paper, two methods are proposed. One is Ordering Map Method and the other is Alteration of Image. Based on pixel value, the order by which the spreaded watermark bits is embedded is created in Ordering Map Method. By the covariance function between image and the spreaded sequence, image is altered in Alteration of Image. Hence, bit error of retrieved watermark is clearly reduced to zero by this two method.

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

• Journal of Korea Multimedia Society
• /
• v.8 no.12
• /
• pp.1572-1580
• /
• 2005

The common requirements for watermarking are usually invisibility, robustness, and capacity. We proposed the watermarking for 3D mesh model based on projection onto convex sets for invisibility and robustness among requirements. As such, a 3D mesh model is projected alternatively onto two convex sets until it converge a point. The robustness convex set is designed to be able to embed watermark into the distance distribution of vertices. The invisibility convex set is designed for the watermark to be invisible based on the limit range of vertex movement. The watermark can be extracted using the decision values and index that the watermark was embedded with. Experimental results verify that the watermarked mesh model has both robustness against mesh simplification, cropping, affine transformations, and vertex randomization and invisibility.

• Journal of Electrical Engineering and Technology
• /
• v.4 no.4
• /
• pp.552-558
• /
• 2009

We proposed a semi-blind digital image watermarking technique for copyright protection. The proposed algorithm embedded a binary sequence watermark into significant wavelet coefficients by using a quantization method. The main idea of the quantization method was to quantize a middle coefficient of the triplet of a significant wavelet coefficient according to the watermark's value. Unlike an existing algorithm, which used a random location table to find a coefficient in which the watermark bit will be embedded: the proposed algorithm used quad-tree decomposition to find a significant wavelet coefficient for embedding. For watermark detection, an original host image was not required. Thanks to the usage of significant wavelet coefficients, the proposed algorithm improved the correlation value, up to 0.43, in comparison with the existing algorithm.

• Journal of Electrical Engineering and Technology
• /
• v.10 no.5
• /
• pp.2149-2154
• /
• 2015

This paper proposes a novel watermarking method to discover the tampers and localize it in digital image. The image which is to be used to generate a watermark is first wavelet decomposed and the edge feature from the sub bands of high frequency coefficients are retrieved to generate a watermark (Edge Feature Image) and which is to be embed on the cover image. Before embedding the watermark, the pixels of cover image are disordered through the Arnold Transform and this helps to upgrade the security of the watermark. The embedding of generated edge feature image is done only on the Least Significant Bit (LSB) of the cover image. The invisibleness and robustness of the proposed method is computed using Peak-Signal to Noise Ratio (PSNR) and Normalized Correlation (NC) and it proves that the proposed method delivers good results and the proposed method also detects and localizes the tampers efficiently. The invisibleness of proposed method is compared with the existing method and it proves that the proposed method is better.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.10
• /
• pp.3591-3606
• /
• 2014

In this paper, a robust watermarking scheme is proposed that uses the scale-invariant feature transform (SIFT) algorithm in the discrete wavelet transform (DWT) domain. First, the SIFT feature areas are extracted from the original image. Then, one level DWT is applied on the selected SIFT feature areas. The watermark is embedded by modifying the fractional portion of the horizontal or vertical, high-frequency DWT coefficients. In the watermark extracting phase, the embedded watermark can be directly extracted from the watermarked image without requiring the original cover image. The experimental results showed that the proposed scheme obtains the robustness to both signal processing and geometric attacks. Also, the proposed scheme is superior to some previous schemes in terms of watermark robustness and the visual quality of the watermarked image.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.225-228
• /
• 2005

According to a popularization of the Internet and digital lifestyle, digital watermarks have been proposed for protection of copyrighted multimedia content. In blind watermark detection, which an original image is not provided, robustness against geometric distortion and compression remains challenging. In this paper, we propose a new perceptual blind discrete wavelet transform - discrete Fourier transform (DWT-DFT) composite watermarking scheme that is robust against both general linear transform and JPEG compression. This algorithm constructs an image-dependent watermark in the most significant DWT coefficients, which is determined by using a hierarchical tree structure. Strength of watermark is determined from a just-noticeable difference (JND) profile of a perceptual model. Furthermore, a desired template is inserted into DFT domain of the watermarked image. In new manner, a cross-ratio of four collinear points is used for detecting the template. Experimental results have showed that the proposed scheme is robust against general linear distortion, JPEG compression and various general kinds of attacks in the Stirmark 3.1 watermark evaluation tool.

• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.868-871
• /
• 2002

Nowadays, zerotrees based digital watermarking techniques are considered to be an efficient watermarking technique used for multimedia data in a compressed form. This paper presents a technique for watermarking an image, by employing zerotrees derived from the wavelet packet coefficients of the transformed image to carry the watermark signal. By setting a proper threshold in zerotrees determining process, the watermark signal can be recovered without the need of original image. With our proposed technique, more amount of watermark signal can be embedded within the image, compared to ordinary wavelet transform based techniques. The experimental results show the improved performance in both qualities of the resultant watermarked image and robustness of the embedded watermark signal against common signal processing such as brightness/contrast enhancement, high-pass filtering, Gaussian noise adding and JPEG compression scheme

• The Journal of the Acoustical Society of Korea
• /
• v.22 no.4
• /
• pp.269-275
• /
• 2003

In this paper, we proposed the robust watermark diminishing distortion of the original data inserting the watermark in specific coefficients of the frequency domain. In case the alpha is more than 0.5. we found that proposed watermark is detected by experiment of MP3, FFT, Cropping and Echo attack. Our proposed method improved the Cox's method in the SNR aspect.

• Proceedings of the KIEE Conference
• /
• 2006.04a
• /
• pp.84-86
• /
• 2006

An informed watermarking algorithm is proposed in this work that aids in concealing packet loss errors in video communications. This watermark-based error concealment(WEC) method embeds a low resolution version of the video frame inside itself as watermark data. At the receiver, the extracted watermark is used as a reference for error concealment. The proposed DCT-based algorithm has features of informed watermarking in order to minimize the distortion of the host frame. At the encoder, a predictive feedback loop Is employed which helps to adjusts the strength of the scale factor Furthermore, some of the modified coefficients of the DCT signal are virtually free from distortion by employing bit- sign adaptivity. The performance of the detector is Qualitatively analyzed for error concealment applications where full-frame DCT embedding proved to be more advantageous.