• Journal of Digital Contents Society
• /
• v.5 no.4
• /
• pp.311-315
• /
• 2004

In this paper, we proposed a robust watermarking algorithm based on fuzzy inference and human visual system. In the first, discrete wavelet transform(DWT) is involved to calculate additive energy strength, then we devised fuzzy inference, which was established by computing contrast and texture degree in gray-level image. Watermark is embeded into the coefficients of 3-level DWT so as to consider a spatial effects. Visual recognizable patterns such as binary image were used as a watermark Consequently, experimental results showed that proposed algorithm is robust in JPEC compression.

• Journal of Information Processing Systems
• /
• v.15 no.1
• /
• pp.169-180
• /
• 2019

Transmitting visual information over a broadcasting network is not only prone to a copyright violation but also is a forgery. Authenticating such information and protecting its authorship rights call for more advanced data encoding. To this end, electronic watermarking is often adopted to embed inscriptive signature in imaging data. Most existing watermarking methods while focusing on robustness against degradation remain lacking of measurement against security loophole in which the encrypting scheme once discovered may be recreated by an unauthorized party. This could reveal the underlying signature which may potentially be replaced or forged. This paper therefore proposes a novel digital watermarking scheme in temporal-frequency domain. Unlike other typical wavelet based watermarking, the proposed scheme employed the Lorenz chaotic map to specify embedding positions. Effectively making this is not only a formidable method to decrypt but also a stronger will against deterministic attacks. Simulation report herein highlights its strength to withstand spatial and frequent adulterations, e.g., lossy compression, filtering, zooming and noise.

• Journal of Korea Multimedia Society
• /
• v.7 no.1
• /
• pp.98-105
• /
• 2004

In this paper, we proposed a watermarking algorithm for embedding visually recognizable pattern into the middle-frequency part:; of image. Binary image as watermark is embedded in the LH2, HL2 and HH2 band of wavelet transformed domain for copyright protection of image data. To evaluate robustness of the proposed method, we applied some basic algorithm of image processing such as scaling, filtering, cropping, histogram equalizing and lossy compression(JPEG, gif). As a result of experiment, the proposed method has the good image quality and the high perceptibility of watermark. It was demonstrated by experiments that the proposed algorithm can provide an excellent protection under various attacks.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.31 no.6
• /
• pp.1171-1179
• /
• 2021

Image forensic is performed to check image limpidness. In this paper, a robust scheme is discussed to detect median filtering in low quality images. Detection of median filtering assists in overall image forensic. Improved spatial statistical features are extracted from the image to classify pristine and median filtered images. Image array data is rescaled to enhance the spatial statistical information. Features are extracted using Markov model on enhanced spatial statistics. Multiple difference arrays are considered in different directions for robust feature set. Further, texture operator features are combined to increase the detection accuracy and SVM binary classifier is applied to train the classification model. Experimental results are promising for images of low quality JPEG compression.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.5
• /
• pp.474-485
• /
• 2001

This paper proposes a user-key-based fragile watermarking for detecting image modification. The embedding data in a form of binary image for authentication are inserted to the DCT coefficients of each block of the given image. To minimize possible exposure of being watermarked and the location of insertion, it is proposed to utilize a user-specific key in randomizing those information. Each DCT block hides one bit of data, all of which represent the user-specific authentication data. Experiments with 5 real images demonstrate that the proposed method not only detects whether there is modification or not, but also the actual location of modification with minimal visual deterioration. However, the proposed method has room for improvement against its loss of watermark by an attack of compression by more than 50%.

• Journal of the Korea Computer Industry Society
• /
• v.4 no.4
• /
• pp.561-568
• /
• 2003

This paper suggests that watermarking technique make use of Threshold Values and PN code for preservation of copyright. To protect copyright, six binary images that are generated by a Dynamic Threshold Value to LSB(least significant bit) of wavelet coefficient through wavelet conversion and watermark image use PN code to each frequency sphere-HL1, LH1, HL2, LH2, HL3, LH3, decide coordinates, operate XOR, and insert watermark. They put the sphere except from low frequency which has much image deterioration and high frequency which has weak loss compression in watermark. As an experimental result, we acquired watermark inserting image that has little image deterioration and extract watermark strongly.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.15 no.2
• /
• pp.113-122
• /
• 2005

In this paper, we propose a multi-watermarking algorithm to satisfy two purposes: fragility against malicious attacks and robustness against non-malicious attacks. The algorithm can be used for image authentication using coefficients of Discrete Wavelet Transform(DWT). In the proposed method, watermarks are generated by combining binary image with some features extracted from the subband LL3, and then they are embedded into both the spatial and frequency domain. That is, on the spatial domain they are embedded into the Least Significant Bit(LSB) of all pixels of image blocks, and on the frequency domain the coefficients of the subband LH2 and HL2 are adjusted according to the watermarks. Thus the algorithm not only resists malicious attack but also permits non-malicious attacks such as blurring, sharpening, and JPEG compression.

• Journal of Internet Computing and Services
• /
• v.8 no.3
• /
• pp.33-43
• /
• 2007

In this proper, we proposes a robust watermarking against the lossy compression in the Hadamard domain. The Hadamard matrix consists of only 1 or -1 and can be computed veru fast. The Hadamrd transform has the inverse transform therefore it is able to be applied into the watermarking technology. In embedding process, we select 10 coefficients from intermediate frequency domain and create two watermark patterns. In extraction process, we use the watermark patterns and compare them to detect the watermark information. When we use the standard image ($512{\times}512$) and binary watermark image ($64{\times}64$), the results of these examines are PSNR for $38{\sim}42dB$ and BER for $3.9{\sim}12.5%$. The JPEG QF between 30 and100, naked human eyes can detect to watermark image easily. The experimental results show that performance of Hadamard domain is better than those of DCT, FFT, and DWT.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.4
• /
• pp.418-423
• /
• 2004

The motion estimation algorithm based block matching is a widely used in the international standards related to video compression, such as the MPEG series and H.26x series. Full search algorithm(FA) ones of this block matching algorithms is usually impractical because of the large number of computations required for large search region. Fast search algorithms and conventional binary block matching algorithms reduce computational complexity and data processing time but this algorithms have disadvantages that is less performance than full search algorithm. This paper presents new Boolean matching algorithm, called BCBM(Bit Converted Boolean Matching). Proposed algorithm has performance closed to the FA by Boolean only block matching that may be very efficiently implemented in hardware for real time video communication. Simulation results show that the PSNR of the proposed algorithm is about 0.08㏈ loss than FA but is about 0.96∼2.02㏈ gain than fast search algorithm and conventional Boolean matching algorithm.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.630-633
• /
• 2007

In this paper, a blind watermarking method using binary images as watermarks is proposed. In order to enhance the detection capability against various attacks that transform watermarked image, the method uses asymmetric thresholds for inserting and detecting. Also, in order to reduce errors in the detected value of watermarks according to small changes in the coefficient values when detecting watermarks, it set the range for movement variation of the coefficients and lowered the sensitivity of variation by ignoring the variations that fall into this range. The experimental results show that the proposed method has good quality and is robust to various attacks such as the JPEG lossy compression, noise addition, cropping, blurring etc.