• Journal of Information Processing Systems
• /
• v.13 no.5
• /
• pp.1382-1396
• /
• 2017

In this paper, we analyze a recently proposed semi-fragile watermarking scheme based on local binary pattern (LBP) operators, and note that it has a fundamental flaw in the design. In this work, a binary watermark is embedded into image blocks by modifying the neighborhood pixels according to the LBP pattern. However, different image blocks might have the same LBP pattern, which can lead to false detection in watermark extraction process. In other words, one can modify the host image intentionally without affecting its watermark message. In addition, there is no encryption process before watermark embedding, which brings another potential security problem. To illustrate its weakness, two special copy-paste attacks are proposed in this paper, and several experiments are conducted to prove the effectiveness of these attacks. To solve these problems, an improved semi-fragile watermarking based on LBP operators is presented. In watermark embedding process, the central pixel value of each block is taken into account and Arnold transform is adopted to guarantee the security of watermark. Experimental results show that the improved watermarking scheme can overcome the above defects and locate the tampered region effectively.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.407-410
• /
• 2003

We propose a new logo watermark scheme for digital images which embed a watermark by modifying middle-frequency sub-bands of wavelet transform. Independent component analysis (ICA) is introduced to authenticate and copyright protect multimedia products by extracting the watermark. To exploit the Human visual system (HVS) and the robustness, a perceptual model is applied with a stochastic approach based on noise visibility function (NVF) for adaptive watermarking algorithm. Experimental results demonstrated that the watermark is perfectly extracted by ICA technique with excellent invisibility, robust against various image and digital processing operators, and almost all compression algorithms such as Jpeg, jpeg 2000, SPIHT, EZW, and principal components analysis (PCA) based compression.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.4
• /
• pp.1499-1513
• /
• 2014

This paper proposes a novel blind image watermarking scheme exploiting Block Truncation Coding (BTC). Most of existing BTC-based watermarking or data hiding methods embed information in BTC compressed images by modifying the BTC encoding stage or BTC-compressed data, resulting in watermarked images with bad quality. Other than existing BTC-based watermarking schemes, our scheme does not really perform the BTC compression on images during the embedding process but uses the parity of BTC quantization data to guide the watermark embedding and extraction processes. In our scheme, we use a binary image as the original watermark. During the embedding process, the original cover image is first partitioned into non-overlapping $4{\times}4$ blocks. Then, BTC is performed on each block to obtain its BTC quantized high mean and low mean. According to the parity of high mean and the parity of low mean, two watermark bits are embedded in each block by modifying the pixel values in the block to make sure that the parity of high mean and the parity of low mean in the modified block are equal to the two watermark bits. During the extraction process, BTC is first performed on each block to obtain its high mean and low mean. By checking the parity of high mean and the parity of low mean, we can extract the two watermark bits in each block. The experimental results show that the proposed watermarking method is fragile to most image processing operations and various kinds of attacks while preserving the invisibility very well, thus the proposed scheme can be used for image authentication.

• Journal of the Institute of Convergence Signal Processing
• /
• v.13 no.3
• /
• pp.142-149
• /
• 2012

Various image transformations can be used to compress images, to reduce noises in images and to extract useful features. Watermarking techniques using DCT and DWT have been a lot of research interest in the spread of multimedia contents. In this paper, Gabor cosine and sine transform considered as human visual filter is applied to embedding and extraction of watermarks for digital images. The proposed transform is used for watermarking with fifteen attacks. Randomly normal distributed noises are used as an embedded watermark. To measure the similarity between the embedded watermark and extracted one, a correlation value is computed and furthermore is compared with that of existing DCT method. Correlation values of extracted watermark are computed with randomly normal distributed noise sequences, and the sequence with the largest correlation value is declared as the embedded watermark. Frequency components are divided into various bands. Experimental results for low frequency and mid-frequency bands have shown that the proposed GCST provides a good watermarking algorithm and its performance is better than DCT.

• Proceedings of the KIEE Conference
• /
• 2001.07d
• /
• pp.2777-2781
• /
• 2001

This paper presents an algorithm of the watermark insertion and extraction on the vector image. Most parts of the vector image consist of the array of the coordinate values. The vector watermarking method by Sakamoto et al [1] uses the mask within which all the coordinate values of all the vertices are changed depending on the value of the watermark. The proposed algorithm is the change of the vector image file instead of the change of the coordinate values on the vector image. We use the Drawing Exchange Format (DXF) files since the DXF file is one of the general files in the field of the vector image.

• Proceedings of the IEEK Conference
• /
• 2003.11b
• /
• pp.243-246
• /
• 2003

In this paper, we propose a new digital audio watermarking technique with the wavelet transform. The watermark is embedded by eliminating unnecessary information of audio signal based on human auditory system (HAS). This algorithm is an audio watermarking method, which does not require any original audio information in watermark extraction process. In this paper, the masking effect is used for audio watermarking, that is, post-tempera] masking effect. We construct the window with the synchronization signal and we extract the best frame in the window by using the zero-crossing rate (ZCR) and the energy of the audio signal. The watermark may be extracted by using the correlation of the watermark signal and the portion of the frame. Experimental results show good robustness against MPEG1-layer3 compression and other common signal processing manipulations. All the attacks are made after the D/A/D conversion.

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

• Journal of Advanced Navigation Technology
• /
• v.8 no.2
• /
• pp.169-175
• /
• 2004

We analyzed about digital watermarking embedded transmission of still image in wireless multimedia communication environment. Also, we proposed improved watermark techniques. It effects that get in original image than method to use conventional image is less and shows robust watermark restoration ability from outside attack. Performance analysis achieved about still image and restoration of watermark information using OFDM/QPSK still image transmission system in wireless channel environment. Analysis result, VI watermark performance that influence in original image is very small. And it could know that show high restoration performance. Also, It showed superior copyright information extraction performance than image watermark in wireless channel environment of same transmission error condition.

• Proceedings of the Korea Society of Information Technology Applications Conference
• /
• 2002.11a
• /
• pp.66-71
• /
• 2002

In Generally, a imbedding and extracting is good as watermark using a random dot image. In this paper, when the autostreogram which has some randomness is used watermark image, distortion rate is low and extraction rate is high. Using this quality, when any logo image is transformed to same image domain randomly, distortion rate is low and extraction rate is high, more over the robustness is good in spite of hard clipping.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2002.11a
• /
• pp.66-71
• /
• 2002

In Generally, a imbedding and extracting is good as watermark using a random dot image. In this paper, when the autostreogram which has some randomness is used watermark image, distortion rate is low and extraction rate is high. Using this quality, when any logo image is transformed to same image domain randomly, distortion rate is low and extraction rate is high, more over the robustness is good in spite of hard clipping.