• Journal of the Institute of Convergence Signal Processing
• /
• v.12 no.3
• /
• pp.176-180
• /
• 2011

Even though algorithms for watermark embedding and extraction step are important issue for digital watermarking, watermark selection and post-processing can give us an opportunity to improve our algorithms and achieve higher performance. For this reason, we summarized the possibilities of improvements for digital watermarking by referring to the watermark merging techniques rather than embedding and extraction algorithms in this paper. We chose Cox's function as main embedding and extraction algorithm, and multiple barcode watermarks as a watermark. Each bit of the multiple copies of barcode watermark was embedded into a gray-scale image with Cox's embedding function. After extracting the numbers of watermark, we applied the watermark merging techniques; including the simple merging, N-step iterated merging, recover merging and combination of iterated-recover merging. Main consequence of our paper was the fact of finding out how multiple barcode watermarks and merging techniques can give us opportunities to improve the performance of algorithm.

• Proceedings of the Korean Institute of IIIuminating and Electrical Installation Engineers Conference
• /
• 2003.11a
• /
• pp.181-183
• /
• 2003

We propose a new watermarking scheme that can be used to embed multiple bits and also resilient to JPEG compression and geometrical transforms such as scaling, rotation, and cropping, based on off-axis holographic watermark that allows multiple watermark recovery without original content(cover image). The holographic watermark is that Fourier transformed digital hologram is embedded into cover image in the spatial domain. The proposed method has not only increased robustness with a stronger embedding but also imperceptibility of the watermark in the evaluation process.

• Proceedings of the Korean Institute of IIIuminating and Electrical Installation Engineers Conference
• /
• 2003.11a
• /
• pp.175-179
• /
• 2003

We propose a new watermarking scheme that can be used to embed multiple bits and also resilient to JPEG compression and geometrical transforms such as scaling, rotation, and cropping based on holographic watermark that allows multiple watermark recovery without original content(cover image).

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.13 no.6
• /
• pp.503-510
• /
• 2020

In this paper, we proposed an effective technique that greatly improves the security of the watermark by concealing the multiple-encrypted watermark in the LSB of the image pixel. Even if multiple encrypted watermark hidden in the LSBs of an image pixel are extracted, it is impossible to decrypt them, so the security of the watermark is maintained very high. If the watermark is multiple encrypted and hidden in the image using the proposed technique, the visual quality of the watermark-hidden image is very high, making it impossible to distinguish between the original image and the resulting image in which the watermark is hidden. The original watermark data can be completely extracted without loss, according to the procedure of the proposed technique, from the resulting image that the watermark is encrypted and hidden in the original image. The performance of the proposed technique was analyzed mathematically and the superiority of the proposed technique was confirmed through experiments. The proposed technique is an excellent image watermarking technique that greatly improves the security of the watermark hidden in the image compared to the existing technique.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.2
• /
• pp.504-523
• /
• 2014

This paper presents a multiple-watermarking scheme for copyright protection and the prevention of illegal copying of mobile 3D contents with low resolution. The proposed scheme embeds a unique watermark and a watermark certification authority (WCA) watermark into the spatial and encryption domains of a mobile 3D content based on the buyer-seller watermarking protocol. The seller generates a unique watermark and embeds it into the local maximum curvedness of a 3D object. After receiving the encrypted watermark from the WCA, the seller embeds it into the encrypted vertex data using an operator that satisfies the privacy homomorphic property. The proposed method was implemented using a mobile content tool, and the experimental results verify its capability in terms of copyright protection and the prevention of illegal copying.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.3
• /
• pp.183-194
• /
• 2004

We propose a now watermarking scheme that can be used to embed multiple bits and also resilient to geometrical transforms such as scaling, rotation, and cropping, based on off - axis holographic watermark that allows multiple watermark recovery without original content(cover image). The holographic watermark is that Fourier transformed digital hologram is embedded into cover image in the spatial domain. The proposed method has not only increased robustness with a stronger embedding but also imprescriptibility of the watermark in the evaluation process. To compare with the convention기 scheme, the spread spectrum, we embedded and recovered maximum 1,024 bits that consist of binary number over PSNR(peak signal-to-noise ratio) 39dB. And also, we computed robustness with BER(bit error rate) corresponding the above attack

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

Recently, digital watermarking has been proposed as a viable solution to the need of copyright protection and authentication of multimedia data. A robust wavelet-based watermark casting scheme and a watermark retrieval technique are suggested in this paper. We present a method which can add the watermark to the significant coefficients in the DWT domain, and does not require the original image in the detection process. In adaptive watermark casting method is developed to select perceptually significant coefficients for each subband using multiple threshold. In the proposed method, an adaptive multiple threshold scheme is used to reflect characteristics of each subband and complexity of image. The watermark is adaptively weighted in different subbands to achieve robustness as well as high perceptual quality. The watermark, Gaussian random sequence is added to the large coefficients but not in the lowest subband in the DWT domain. Experimental results show that the proposed algorithm produced visually very good watermarked image which has good invisibility to human eyes and very robust against various image processing and compression attacks.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.3
• /
• pp.489-497
• /
• 2009

Most of existent blind watermarking methods in frequency domain use coefficient relationship to detect the watermark without original image. But the change in coefficient values occurred when the original image was attacked by lossy JPEG compression or noise addition. So robustness of watermark detection was weaken. In order to solve these problems, this paper presents a robust watermarking method, which enables multiple watermark insertion. Also, in order to reduce errors in the detected value of watermarks according to small changes in the coefficient relationship when detecting watermarks, it set the change guard value for variation of the coefficients. The experimental results show that the proposed method has good image quality and is robust to various attacks such as the JPEG lossy compression, noise addition, etc.

• Korean Journal of Optics and Photonics
• /
• v.19 no.4
• /
• pp.262-269
• /
• 2008

In this paper, we propose an image watermark method using multiple decoding keys. The advantages of this method are that the multiple original images are reconstructed by using multiple decoding keys in the same watermark image, and that the quality of reconstructed images is clearly enhanced based on the idea of Walsh code without any side lobe components in the decoding process. The zero-padded original images, multiplied with random-phase pattern to each other, are Fourier transformed. Encoded images are then obtained by taking the real-valued data from these Fourier transformed images. The embedding images are obtained by the product of independent Walsh codes, and these spreaded phase-encoded images which are multiplied with new random-phase images. Also we obtain the decoding keys by multiplying these random-phase images with the same Walsh code images used in the embedding images. A watermark image is then made from the linear superposition of the weighted embedding images and a cover image, which is multiplied with a new independent Walsh code. The original image is simply reconstructed by the inverse-Fourier transform of the despreaded image of the multiplication between the watermark image and the decoding key. Computer simulations demonstrate the efficiency of the proposed watermark method with multiple decoding keys and a good robustness to the external attacks such as cropping and compression.

• Journal of the Korean Data and Information Science Society
• /
• v.19 no.2
• /
• pp.475-485
• /
• 2008

One of main issues in watermarking is to resolve the strength of watermark for solving the problem of trade-off between fidelity and robustness of watermarking. In the previous research, the strength of watermark has been resolved fixed value generally without considering local image characteristics such as image brightness, contrast, and edge. This paper proposes a new model to predict the strength of watermark considering local image characteristics such as image brightness, contrast, and edge for digital wavelet transform(DWT)-based image watermarking. For the study, psychological experiment was fulfilled to measure the human image perception and regression analysis showed the proposed model was statistically significant at the level of ${\alpha}\;=\;0.01$. Also the model is practically validated on fidelity and robustness of watermarking.