• Journal of the Institute of Electronics Engineers of Korea CI
• /
• 제40권3호
• /
• pp.164-170
• /
• 2003

This paper proposes a novel method to detect Furon's asymmetric watermark by using a correlation detector that is mathematically tractable and simple. The performance of the proposed method is tested under various conditions. The experimental results matched the theoretical results well, showing that the correlation detector can indeed be used for the detection of asymmetric watermark. The proposed detector is aplied to both single and multiple bit embedded watermark. Bit error rate (BER), obtained from the experiment, was compared to the one obtained from the theory. As the embedded information increases, the BER of the Furon's asymmetric watermarking method also increases rapidly.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 한국해양정보통신학회 2007년도 춘계종합학술대회
• /
• pp.157-160
• /
• 2007

System realization and video watermarking using spatial and interframe information is presented in this paper. The system is constructed with DSP processor to process compression and watermark algorithm with real time. Video watermark algorithm is used the watermark insertion using the spatial and interframe. As a results, the processing time of D1 image per frame is 32.1msec in DSP.

• International Journal of Contents
• /
• 제11권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 Institute of Electronics Engineers of Korea SP
• /
• 제41권2호
• /
• pp.65-72
• /
• 2004

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. To select the watermark embedding locations, we use the increment and decrement information of the successive approximation coefficients after discrete wavelet transformed. In order to evaluate the proposed algorithm we embed watermark into test images and detect the watermark after attacks like JPEG lossy compression and performing of various liters. Experimental results show that the proposed method is robust against various kinds of attacks and still remains transparency.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• 제35S권4호
• /
• pp.85-95
• /
• 1998

In this paper, a new watermarking method for a copy protectionof images is proposed. The proposed method adaptively embeds a watermark in the frequency domain of images using human visual system model. For this purpose, the Just Noticeable Differences(JNDs) of each frequency coeffeicient value of a luminance plane is first found using Watson and Solomon's visual system model. An invisible maximum watermark value with is different in every position according to the characteristics of images is determined usig JND and Minkowski metric. A low frequency domain is divided into two sets based on a PN-sequence to protect thewatermark from the attack. The watermarks are added to one set of coefficients and detecting a watermark, the difference between the mean values of absolute coefficient values of both sets is calculated. The embedded watermark is tested using statistical hypothesis based on test static dertermined by the ean difference. To demonstrate the perfromance of the proposed method, the new watermarking method is applied to a high frequency image and low frequency images. Experimenatal results show the watermark is invisible and robust to JPEGlossy compression and noise.

• Journal of the Korea Society of Computer and Information
• /
• 제23권4호
• /
• pp.33-39
• /
• 2018

In this paper, we propose a describes how to detect a false iris image by inserting watermark into a iris image. The existing method, which inserts the watermark into the entire iris image to detect a fake iris, has a problem that can evade it by segmenting iris region of an iris image. The purpose of overcoming the problem, this paper proposes a new fake iris detection technique based on digital watermark. It first searches a central point of an iris image, divide the image into blocks with respect to the point. executes Discrete Cosine Transform, inserts watermark into the blocks, and then verifies an iris image using NC(Normalized Correlation). In the experiments, we confirm the robustness for attacks - crop and JPEG.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• 제57권8호
• /
• pp.1478-1483
• /
• 2008

In this paper, a digital watermarking method using the WPT (Wavelet Packet Transform) is proposed. The proposed algorithm transforms the input image by using the WPT and inserts the watermark by using the quad-tree algorithm and Cox's algorithm. The experiments for evaluating the performances of the proposed algorithm is carried out by inserting a watermark in each wavelet packet transform step and by inserting a watermark into the lowest frequency domain (LL). As a simulation result, the performance of the insertion of the watermark into the 6 levels of WPT is better than that of other cases. In addition, about $30{\sim}60%$ of all watermarks are inserted into the LL band, the correlation value is improved though the PSNR performance decreases $1{\sim}2dB$.

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• 제59권4호
• /
• pp.395-400
• /
• 2010

Digital watermark technologies conceal the information of video contents that presents who is the owner and/or who is the user. In spite of various attempts to insert watermark, trials to mark information of users or buyers into contents have not been successful. It is the reason that the rates of detection is decreased seriously if there are some attacks to the contents such as resizing or bitrate decreasing. In this paper, the algorithm to insert the coded watermarks of users into video contents and to detect them without original contents under attacks will be described.

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• 제59권4호
• /
• pp.390-394
• /
• 2010

This paper describes a study on developing an insert and detect system of digital watermark to the MPEG-2 coder and decoder. Digital watermark inserting system substitutes a coefficient among the DCT coefficients for new one. This replacement performs in MPEG-2 PS format. Watermark detecting system analyzes the input data stream of MPEG-2 and detect the probability of occurrence of a specific code or watermarking code. Our inserting system had very high invisibility and the PSNR of the results was 130 dB around. And our detection rate of watermark was over 99% in digital format and over 85% in analog captured format according to the quality of contents.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제17권3호
• /
• pp.938-957
• /
• 2023

The limited computing power of sensor nodes in wireless sensor networks (WSNs) and data tampering during wireless transmission are two important issues. In this paper, we propose a scheme for independent individual authentication of WSNs data based on digital watermarking technology. Digital watermarking suits well for WSNs, owing to its lower computational cost. The proposed scheme uses independent individual to generate a digital watermark and embeds the watermark in current data item. Moreover, a sink node extracts the watermark in single data and compares it with the generated watermark, thereby achieving integrity verification of data. Inherently, individual validation differs from the grouping-level validation, and avoids the lack of grouping robustness. The improved performance of individual integrity verification based on proposed scheme is validated through experimental analysis. Lastly, compared to other state-of-the-art schemes, our proposed scheme significantly reduces the false negative rate by an average of 5%, the false positive rate by an average of 80% of data verification, and increases the correct verification rate by 50% on average.