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

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.5
• /
• pp.1041-1046
• /
• 2009

In this paper, we proposed a robust watermark scheme for image based on SVD(Singular Value Transform) and Triplet. First, the original image is decomposed by using 3-level DWT, and then used the singular values changed for embedding and extracting of the watermark sequence in LL3 band. Since the matrix of singular values is not easily altered with various signal processing noises, the embedded watermark sequence has the ability to withstand various signal processing noise attacks. Nevertheless, this method does not guarantee geometric transformation(such as rotation, cropping, etc.) because the geometric transformation changes the matrix size. In this case, the watermark sequence cannot be extracted. To compensate for the above weaknesses, a method which uses the triplet for embedding a barcode image watermark in the middle of frequency band is proposed. In order to generate the barcode image watermark, the pattern of the watermark sequence embedded in a LL3 band is used. According to this method, the watermark information can be extracted from attacked images.

• Journal of Broadcast Engineering
• /
• v.9 no.1
• /
• pp.64-73
• /
• 2004

A robust watermarking algorithm is proposed for 3D mesh models. Watermark is inserted into the 2D image which is extracted from the target 3D model. Each Pixel value of the extracted 2D image represents a distance from the predefined reference points to the face of the given 3D model. This extracted image is defined as “range image” in this paper. Watermark is embedded into the range image. Then, watermarked 3D mesh is obtained by modifying vertices using the watermarked range Image. In extraction procedure, the original model is needed. After registration between the original and the watermarked models, two range images are extracted from each 3D model. From these images. embedded watermark is extracted. Experimental results show that the proposed algorithm is robust against the attacks such as rotation, translation, uniform scaling, mesh simplification, AWGN and quantization of vertex coordinates.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.12
• /
• pp.6190-6213
• /
• 2019

For small-scale vector data, restrictions on watermark scheme capacity and robustness limit the use of copyright protection. A watermarking scheme based on robust geometric features and capacity maximization strategy that simultaneously improves capacity and robustness is presented in this paper. The distance ratio and angle of adjacent vertices are chosen as the watermark domain due to their resistance to vertex and geometric attacks. Regarding watermark embedding and extraction, a capacity-improved strategy based on quantization index modulation, which divides more intervals to carry sufficient watermark bits, is proposed. By considering the error tolerance of the vector map and the numerical accuracy, the optimization of the capacity-improved strategy is studied to maximize the embedded watermark bits for each vertex. The experimental results demonstrated that the map distortion caused by watermarks is small and much lower than the map tolerance. Additionally, the proposed scheme can embed a copyright image of 1024 bits into vector data of 150 vertices, which reaches capacity at approximately 14 bits/vertex, and shows prominent robustness against vertex and geometric attacks for small-scale vector data.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.12
• /
• pp.4568-4587
• /
• 2014

Authentication of videos and images based on the content is becoming an important problem in information security. Unfortunately, previous studies lack the consideration of Kerckhoffs's principle in order to achieve this (i.e., a cryptosystem should be secure even if everything about the system, except the key, is public knowledge). In this paper, a solution to the problem of finding a relationship between a frame's index and its content is proposed based on the creative utilization of a robust manifold feature. The proposed solution is based on a novel semi-fragile watermarking scheme for H.264/AVC video content authentication. At first, the input I-frame is partitioned for feature extraction and watermark embedding. This is followed by the temporal feature extraction using the Isometric Mapping algorithm. The frame index is included in the feature to produce the temporal watermark. In order to improve security, the spatial watermark will be encrypted together with the temporal watermark. Finally, the resultant watermark is embedded into the Discrete Cosine Transform coefficients in the diagonal positions. At the receiver side, after watermark extraction and decryption, temporal tampering is detected through a mismatch between the frame index extracted from the temporal watermark and the observed frame index. Next, the feature is regenerate through temporal feature regeneration, and compared with the extracted feature. It is judged through the comparison whether the extracted temporal watermark is similar to that of the original watermarked video. Additionally, for spatial authentication, the tampered areas are located via the comparison between extracted and regenerated spatial features. Experimental results show that the proposed method is sensitive to intentional malicious attacks and modifications, whereas it is robust to legitimate manipulations, such as certain level of lossy compression, channel noise, Gaussian filtering and brightness adjustment. Through a comparison between the extracted frame index and the current frame index, the temporal tempering is identified. With the proposed scheme, a solution to the Kerckhoffs's principle problem is specified.

• The KIPS Transactions:PartB
• /
• v.10B no.4
• /
• pp.367-372
• /
• 2003

The existing watermarking techniques for copyright protection of a digital image are fragile in geometric distortion and it is hard to detect whether it was manipulated artificially. In this paper, we proposed the new copyright protection system that can authorize a digital mage and :an embed or extract a robust watermark in a artificial manipulation in order to solve these problems. In a watermarking part, the proposed a watermarking technique embeds a watermark in a phase component after a Complex Wavelet Transform (CWT) with an original image, and a watermark is extracted from an watermarked image by stages. A copyright about an image can be insisted on than a threshold after comparing a correlation of an original watermark with an extracted watermark if large. In an authentication part of a digital image, EZW (Embedded Zerotree Wavelet) is used, and an authentication cord of an watermarked image is generated. An authentication code of an image to have been distribute to is compared with a generated authentication cord, and artificial operation isn´t than a threshold if large. The proposed copyright protection system through performance evaluation display that it was robust in geometric distortion and a artificial operation was able to be detected.

• Journal of Korea Multimedia Society
• /
• v.16 no.5
• /
• pp.591-600
• /
• 2013

This paper addresses a feature-based robust watermarking scheme for digital images using a local invariant features of SURF (Speeded-Up Robust Feature) descriptor. In general, the feature invariance is exploited to achieve robustness in watermarking schemes, but the leakage of information about hidden watermarks from publicly known locations and sizes of features are not considered carefully in security perspective. We propose embedding and detection methods where the watermark is bound with circular areas and inserted into extracted circular feature regions. These methods enhance the robustness since the circular watermark is inserted into the selected non-overlapping feature regions instead of entire image contents. The evaluation results for repeatability measures of SURF descriptor and robustness measures present the proposed scheme can tolerate various attacks, including signal processing and geometric distortions.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.657-660
• /
• 2001

In this paper, a robust watermarking technique is presented by using a block-based statistics in DCT domain. First, the proposed technique calculates JND threshold value using the global statistics in DCT domain. Then watermark insertion is carried out by inserting one watermark into coefficients which are above the threshold value J within a 2${\times}$2 block. Finally, watermark is estimated by averaging the extracted watermarks from the coefficients which are above the threshold in a window. In experiments it is shown that the proposed techniques can enhance perceptual invisibility and robustness against additive noise and JPEG compression attacks by using the characteristics of JND.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.1C
• /
• pp.124-130
• /
• 2008

We present in this paper a method of digital watermarking for video data based on the discrete wavelet transform. In the proposed method, a watermark signal is inserted into the decompressed bitstream while detection is performed using the uncompressed video. This method allows detection if video has been manipulated or its format changed. We embed the watermark in the lowest frequency components of each frame in the un-coded video by using wavelet transform. The watermark can be extracted directly from the decoded video without access to the original video. Experimental results show that the proposed method gives the watermarked video of better quality and is robust against MPEG coding, down sampling and re-encoding to other type of video format such as MPEG4, H.264

• Proceedings of the IEEK Conference
• /
• 2000.09a
• /
• pp.519-522
• /
• 2000

Digital watermarking has been proposed as a solution to the problem of copyright protection of the multimedia documents. In this paper a new watermarking method for digital images operating in the frequency domain is proposed. In our approach, DCT coefficients of the watermark are added to the low frequency region of the host image, and extract it using the Wiener Filter. Due to the characteristic of the wiener filtering, the watermark is robust to various image processing techniques. Experimental results show that it is possible to reliably extract the watermark without degrading image quality.