• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.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.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2019.05a
• /
• pp.561-563
• /
• 2019

This paper proposes a watermarking method for copyright protection of images used in VR. The Embedding method is that finds the point through the SIFT feature points, inserts the watermark by using DWT and QIM on the surrounding area. The objective image to extract the embedded watermark is the projected image and its method finds the SIFT feature points and extracts watermark data from its surrounding areas after correction by using inverse process of matching and projection in the VR image production process. By comparing the NCC and BER between the extracted watermark and the inserted watermark, the watermark is determined by accumulating the watermark having a threshold value or more. This is confirmed by comparing with a conventional method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.2
• /
• pp.883-900
• /
• 2017

In this paper block based blind secure gray image watermarking scheme based on discrete wavelet transform and singular value decomposition is proposed. In devising the proposed scheme, security is given high importance along with other two requirements: robustness and imperceptibility. The use of discrete wavelet transform not only improves robustness but the selection of bands with high tolerance towards noise caused an improvement in terms of imperceptibility. The robustness further improved due to the involvement of singular vectors along with singular values in watermark embedding and extraction process. Finally, to achieve security, the selected DWT band is decomposed into smaller blocks and random blocks are chosen for modification. Furthermore, the elements of left and right singular vectors of selected blocks are chosen based on their dependence upon each other for watermark embedding. Various experiments using different images as host and watermark were conducted to examine and validate the proposed technique. Additionally, the proposed technique is tested against various attacks like compression, affine transformation, cropping, translation, X shearing, scaling, Y shearing, filtering, blurring, different kinds of noises, histogram equalization, rotation, etc. Lastly, the proposed technique is compared with state-of-the-art watermarking techniques and their comparison shows significant improvement of proposed scheme over existing techniques.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.8
• /
• pp.1484-1490
• /
• 2007

The Cross Reference Point(CRP) is a robust method for finding salient points in watermarking systems because it is based on the geometrical structure of a normalized image in order to avoid pointing error caused by digital attacks. After normalization of an image, the 100 CRPs are calculated. Next, the 100 blocks centered by CRPS are formed. These 100 blocks are arranged using a secrete key. Each boundary of 50 out of 100 blocks is surrounded by 8 blocks which are selected by the ordered number of a preceding block. This number is a seed of random number generator for selecting 8 out of 50 blocks. The search area of a center block is formed by a secrete key. The pixels of a center block are quantized to 10 levels by predefined thresholds. The watermarks are generated by the 50 quantized center blocks. These watermarks are embedded directly in the remaining 50 blocks. In other words, 50 out of 100 blocks are utilized to generate watermarks and the remaining 50 blocks are used to watermark embedding. Because the watermarks are generated in the given images, we can successfully detect watermarks after several digital attacks. The reason is that the blocks for the generation and detection of watermarks are equally affected by digital attacks except for the case of local distortion such as cropping.

• Journal of Broadcast Engineering
• /
• v.24 no.6
• /
• pp.1152-1162
• /
• 2019

With the rapid development of the VR industry, many VR contents are produced and circulated, and the need for copyright protection is increasing. In this paper, we propose a method of embedding and extracting watermarks in consideration of VR production process. In embedding, SIFT is performed by selecting the region where distortion is minimized in VR production, and transformed into frequency domain using DWT and embedded into the QIM method. In extracting process, in order to correct the distortion in the projection process, the top and bottom regions are changed to different projection methods and some middle regions are rotated using 3DoF to extract the watermark. After this processing, extracted watermark has higher accuracy than the conventional watermark method, and the validity of the proposed watermark is shown by showing that the accuracy is maintained even in various attacks.

• Journal of Broadcast Engineering
• /
• v.25 no.2
• /
• pp.166-175
• /
• 2020

Recently, application fields for processing and using digital image contents in various forms and types are rapidly increasing. Since image content is high value-added content, the intellectual property rights of this content must be protected in order to activate the production and use of the digital image content. In this paper, we propose a deep learning based watermark embedding and extraction network. The proposed method is to maximize the robustness of the watermark against malicious/non-malicious attacks while preserving the invisibility of the host image. This network consists of a preprocessing network that changes the watermark to have the same resolution as the host image, a watermark embedding network that embeds watermark data while maintaining the resolution of the host image by three-dimensionally concatenating the changed host image and the watermark information, and a watermark extraction network that reduces the resolution and extracts watermarks. This network verifies the invisibility and robustness of the proposed method by experimenting with various pixel value change attacks and geometric attacks against various watermark data and host images with various resolutions, and shows that this method is universal and practical.

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.138-141
• /
• 2005

In this paper, we propose a watermarking technique of multispectral images. In our method, the Principal Component Analysis (PCA) is preliminarily applied on the multispectral image. The most principal component image is used for embedding with a watermark, which is a pseudo-random number sequence generated with a secret key. The embedding process is performed in the wavelet domain. The resulting image is then reinserted into the principal component images, and the final multispectral image containing the watermark can be produced by the inverse PCA. Experimental results are provided to illustrate the performance of the algorithm against various kinds of attacks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.9C
• /
• pp.898-907
• /
• 2003

In this paper, we propose a new blind watermarking method that embeds a watermark on the lowest wavelet subband coefficients, while most watermarking techniques embed watermarks in the middle frequency range for robustness and fidelity. A new embedding algorithm for watermarking is proposed that embeds a bi-level watermark sequence into randomly selected wavelet coefficients on the lowest subband(LL) using a quantization in order to be robust. Experimental results prove our novel embedding strategy is invisible and good rate-distortion-robustness performance.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.678-683
• /
• 2009

A lot of researches [1] have been conducted on digital watermark embedding in brightness. A prerequisite for the digital watermark is that the image quality does not change even if the volume of the embedded information increases. Generally, the noise on complex images is perceived than the noise on fiat images. Thus, we present a method for watermarking an image by embedding complex areas by priority. The proposed method has achieved higher image quality of digital watermarking compared to other method that do not take into consideration the complexity of blocks, although the PSNR of the proposed method is lower than for a method not based on block complexity.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.45 no.1
• /
• pp.22-28
• /
• 2008

In this paper, we propose a DCT coefficient domain watermarking scheme, which makes use of the sinusoidal patterns created by the watermark embedding. The embedded watermark can be detected in the spatial domain by computing the correlation. Also, the proposed algorithm can detect the spatial synchronization without additional sync bit embedding. Experimental results show that the proposed algorithm is robust to various StirMark attacks.