• International Journal of Control, Automation, and Systems
• /
• v.6 no.6
• /
• pp.794-799
• /
• 2008

This paper presents a user identification method at H.264 streaming using watermarking with fingerprints. The watermark can efficiently reduce the potential danger of forgery or alteration. Especially a biometric watermark has convenient, economical advantages. The fingerprint watermark can also improve reliability of verification using automated fingerprint identification systems. These algorithms, however, are not robust against common video compression. To overcome this problem, we analyze H.264 compression pattern and extract watermark after restoring damaged watermark using various filters. The proposed algorithm consists of enhancement of a fingerprint image, watermark insertion using discrete wavelet transform and extraction after restoring. The proposed algorithm can achieve robust watermark extraction against H.264 compressed videos.

• ETRI Journal
• /
• v.37 no.3
• /
• pp.595-605
• /
• 2015

This paper proposes a robust, imperceptible block-based digital video watermarking algorithm that makes use of the Speeded Up Robust Feature (SURF) technique. The SURF technique is used to extract the most important features of a video. A discrete multiwavelet transform (DMWT) domain in conjunction with a discrete cosine transform is used for embedding a watermark into feature blocks. The watermark used is a binary image. The proposed algorithm is further improved for robustness by an error-correction code to protect the watermark against bit errors. The same watermark is embedded temporally for every set of frames of an input video to improve the decoded watermark correlation. Extensive experimental results demonstrate that the proposed DMWT domain video watermarking using SURF features is robust against common image processing attacks, motion JPEG2000 compression, frame averaging, and frame swapping attacks. The quality of a watermarked video under the proposed algorithm is high, demonstrating the imperceptibility of an embedded watermark.

• International Journal of Contents
• /
• v.11 no.3
• /
• pp.39-46
• /
• 2015

When host images are watermarked with CRT (Chinese Remainder Theorem), the watermark images are still robust in spite of the damage of the host images by maintaining the remainders in an unchanged state within some range of the changes that are incurred by the attacks. This advantage can also be attained by "zero-watermarking," which does not change the host images in any way. This paper proposes an improved zero-watermarking scheme for color images on the DCT (Discrete Cosine Transform) domain that is based on the CRT. In the scheme, RGB images are converted into YCbCr images, and one channel is used for the DCT transformation. A key is then computed from the DC and three low-frequency AC values of each DCT block using the CRT. The key finally becomes the watermark key after it is combined four times with a scrambled watermark image. When watermark images are extracted, each bit is determined by majority voting. This scheme shows that watermark images are robust against a number of common attacks such as sharpening, blurring, JPEG lossy compression, and cropping.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.9
• /
• pp.1767-1778
• /
• 2009

A robust and secure InIm(Integral imaging)-based 3D watermarking scheme using cellular automata transform (CAI) is proposed. In the InIm-based 3D watermarking scheme, the elemental image array (EIA) watermark for the target watermark which has to be detected, is synthesized from the computational pickup process of InIm and embedded in a cover image. The EIA watermark can provide a robust reconstruction of the target watermark However, the 3D property of the EIA watermark causes a weakening of the security. To overcome this problem, the proposed method uses the CAT domain to embed and extract the EIA watermark in the cover image. The use of CAT significantly improves the security for our watermarking algorithm using a single secure key only. Experiments are presented to show that the proposed scheme shows robust and secure performances against various attacks.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.9 no.3
• /
• pp.39-52
• /
• 1999

In this paper we propose a new watermarking technique for copyright protection of images. The proposed technique is based on a spatial masking method with a spatial scale parameter. In general it becomes more robust against various attacks but with some degradations on the image quality as the amplitude of the watermark increases. On the other hand it becomes perceptually more invisible but more vulnerable to various attacks as the amplitude of the watermark decreases. Thus it is quite complex to decide the compromise between the robustness of watermark and its visibility. We note that watermarking using the spread spectrum is not robust enought. That is there may be some areas in the image that are tolerable to strong watermark signals. However large smooth areas may not be strong enough. Thus in order to enhance the invisibility of watermarked image for those areas the spatial masking characteristics of the HVS(Human Visual System) should be exploited. That is for texture regions the magnitude of the watermark can be large whereas for those smooth regions the magnitude of the watermark can be small. As a result the proposed watermarking algorithm is intend to satisfy both the robustness of watermark and the quality of the image. The experimental results show that the proposed algorithm is robust to image deformations(such as compression adding noise image scaling clipping and collusion attack).

• 제어로봇시스템학회:학술대회논문집
• /
• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.9C
• /
• pp.1289-1297
• /
• 2004

Digital watermarking is a technique which blends intellectual property right with security Blind watermarking 1S one of the difficult watermark technique because original data or inserted watermark is not needed. In this paper, we propose a new blind watermarking method using energy quantization in wavelet domain to insert watermark. The proposed method is robust for various attacks and attack strength because watermark strength is adaptively changed for energy variation of attacks. Simulation results show the proposed method is robust to various attacks such as noise addition, cropping, blurring, sharpening, maintaining imprescriptibility.

• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.857-860
• /
• 2000

This paper presents a new watermarking method based on wavelet transform. Embedding algorithm call define robust area by varying thresholds and gives a watermark image the priority of significance by analyzing spatial correlation of the watermark image. Detector can adjust thresholds to the distorted watermarked image. Also detector can extract the embedded data without an original image. A new measurement for detecting the correct watermark is suggested. Simulation results show that the embedded watermark is robust against various signal processing and compression attacks.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.57 no.12
• /
• pp.2330-2335
• /
• 2008

In this paper, we proposed a robust watermark scheme for image based on the discrete wavelet transform. In the first, we use the triplet method for embedding and extraction of watermark. Triplet method uses relationship among the discrete wavelet coefficients at the same position in the three detail subband of image. In the second, we use barcode Pattern Image for watermark scheme. By using barcode Pattern Images, a user is able to make many kinds of own watermark. In the third, the proposed method for image watermark provides the invisiblility which the other user can not discriminate watermark from watermarked image. The advantage of the proposed method is visibility when we extracted watermark from the image. The corresponding experimental results show that the proposed method has performance of a robustness from the noise attack.

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

In this paper, we propose a robust blind watermarking scheme for high-definition video. In the embedding process, luminance component of each frame is transformed by 2-dimensional fast Fourier transform (2D FFT). A secret key is used to generate a matrix of random numbers for the security of watermark information. The matrix is transformed by inverse steerable pyramid transform (SPT). We embed the watermark into the low and mid-frequency of 2D FFT coefficients with the transformed matrix. In the extraction process, the 2D FFT coefficients of each frame and the transformed matrix are transformed by SPT respectively, to produce two oriented sub-bands. We extract the watermark from each frame by cross-correlating two oriented sub-bands. If a video is degraded by some attacks, the watermarks of frames contain some errors. Thus, we use an ensemble position-based error correcting algorithm to estimate the errors and correct them. The experimental results show that the proposed watermarking algorithm is imperceptible and moreover is robust against various attacks. After embedding 64 bits of watermark into each frame, the average peak signal-to-noise ratio between original frames and embedded frames is 45.7 dB.