• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.38 no.5
• /
• pp.65-76
• /
• 2001

In this paper, performance of frequency-based watermarking methods is compared, which are used to protect copyright of image data. For performance comparison of each transform method, a test image is transformed into frequency domain by a full- and block-discrete cosine transforms and wavelet transform, and after general image processing, robustness of each transform is evaluated with using the same watermark signals. Simulation results show that the watermarking method based on DCTs are more robust than WT. Especially, $8{\times}8$ BDCT is most robust for JPEG lossy compression and sharpening, while $8{\times}8$ FDCT is best. for smoothing and scaling. In addition, watermarking based on BDCT shows decreasing robustness for a larger block size, compared with general image processing.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.4 no.2
• /
• pp.389-395
• /
• 2000

Digital Watermarking is a research area which aims at hiding secret information in digital multimedia content such as images, audio, and video. In this paper, we propose a new watermarking method with visually recognizable symbols into the digital images using wavelet transform, spread spectrum method and multilevel threshold value in considering the wavelet coefficients. The information of watermark can be extracted by subtracting wavelet coefficients with the original image and the watermarked image. The results of this experiment show that the proposed algorithm was superior to other similar watermarking algorithms. We showed Watermarking algorithm in JPEG lossy compression, resizing, LSB(Least Significant Bit) masking, and filtering.

• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.1019-1022
• /
• 2002

The current paper proposes a wavelet-based digital watermarking algorithm using statistical characteristic of image and human visual system (HVS). The original image is decomposed into 4-level using a discrete wavelet transform (DWT), then the watermark is embedded into the perceptually significant coefficients (PSCs) of the image. In general, the baseband of a wavelet-decomposed image includes most of the energy of the original image, thereby having a crucial effect on the image quality. As such, to retain invisibility, the proposed algorithm does not utilize the baseband. Plus, the wavelet coefficients on the lowest level are also excluded in the watermark-embedding step, because these coefficients call be easily eliminated and modified by lossy compression and common signal processing. As such, the PSCs are selected from all subbands, except for the baseband and subbands on the lowest level. Finally, using the selected PSCs, the watermark is then embedded based on spatial masking of the wavelet coefficients so as to provide invisibility and robustness. Computer simulation results confirmed that the proposed watermarking algorithm was more invisible and robust than conventional algorithms.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.5
• /
• pp.217-223
• /
• 2004

In block-based lossy video compression, severe quantization causes discontinuities along block boundaries so that annoying blocking artifacts are visible in decoded video images. These blocking artifacts significantly decrease the subjective image quality. In order to reduce the blocking artifacts in decoded images, many algorithms have been proposed. However studies on so called comer outlier, have been very limited. Corner outliers make image edges look disconnected from those of neighboring blocks at cross block boundary. In order to solve this problem we propose a corner outlier detection and compensation algorithm as loop-filtering in spatial domain. Experiment results show that the proposed method provides much improved subjective image quality.

• The Journal of the Korea Contents Association
• /
• v.11 no.1
• /
• pp.9-15
• /
• 2011

Zero-watermarking is a digital watermarking technique that can escape from data distortion and quality degradation by no watermark insertion into digital images to be watermarked. This paper proposes DCT0CRT, a CRT-based zero-watermarking technique in the domain of DCT. One of the DC and low-frequency AC coefficients of each DCT block chosen in chaotic way from an image is selected by testing whether it satisfies the CRT-based condition matching with the watermark bit to be embedded. Such selection information forms a key to extract the watermark from the watermarked image. Experimental results show that the image quality watermarked by DCT0CRT is better than that watermarked by any other CRT-based watermarking techniques and the inserted watermark is robust against some common attacks such as sharpening, blurring, and JPEG lossy compression.

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

• The KIPS Transactions:PartB
• /
• v.10B no.6
• /
• pp.619-628
• /
• 2003

In this paper, an effective watermark detection technique in the wavelet transform domain is proposed. In this proposed method, the image is 2-level wavelet transformed, and then the watermark with a binary logo is embedded into middle band except baseband and high band to consider Invisibility and robustness. In this paper, we use an asymmetric thresholds watermarking (ATW) in which detection threshold is higher than inserting threshold in order to enhance watermark detection ratio in attacked images. In watermark detection phase, the detection value is not changed when the difference of the selected wavelet neighboring coefficient pairs Is smaller than specific value. 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.1C
• /
• pp.62-67
• /
• 2008

In this paper, wavelet based blind watermarking using self-reference method is proposed. First, we process wavelet transform of original image. Then, we set all domain except for the low-frequency domain to zero and make self-reference image after wavelet reverse transformation. By choosing specific domain according to the pixel value difference between original image and self-reference image, we make random sequence, use as watermark and embed. The experimental results of the watermark embedding and extraction on various images show that the proposed scheme not only has good image quality, but also has stability on JPEG lossy compression, filtering, sharpening, blurring and noise.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1C
• /
• pp.105-112
• /
• 2009

In this paper, we propose a digital watermarking method using Multi-resolution Characteristic of 2D CAT (2D cellular automata transform). Firstly, we select the gateway values to generate a basis function and the basis function transforms images into cellular automata space. Then, we embed the random bit sequence as watermark in specific parts of cellular automata transform coefficients. The proposed method not only verifies higher fidelity than the existing method but also stronger stability on JPEG lossy compression, filtering, sharpening and noise through tests for robustness. Moreover, the proposed scheme allows only one 2D CAT basis function per gateway value. Since there are $2^{96}$ possible gateway values.

• Cartoon and Animation Studies
• /
• s.14
• /
• pp.37-51
• /
• 2008

The computer has become an indispensable tool for animation works. However if you don't understand the characteristics of the computer and its software, you might not have the result satisfying your efforts. The incorrect understanding of image format sometimes causes it. Habitually image formats are selected usually for most of works but there is a distinct difference among those image formats while the efficient usages of them are different from each other. For your more efficient work therefore, you need to identify the characteristics of various kinds of image format used mostly for animation works. First I took a look at the theories of the lossy compression and lossless compression, which are two types of data compression widely used in the whole parts of computer world and the difference between bitmap method and vector method, which are respectably different in terms of the way of expressing images and finally the 24 bit true color and 8 bits alpha channel. Based on those characteristics, I have analyzed the functional difference among image formats used between various types of animation works such as 2D, 3D, composing and editing and also the benefits and weakness of them. Additionally I've proved it is wrong that the JPEG files consume a small space in computer work. In conclusion, I suggest the TIF format as the most efficient format for whatever it is editing, composing, 3D and 2D in considering capacity, function and image quality and also I'd like to recommend PSD format which has compatibility and excellent function, since the Adobe educational programs are used a lot for the school education. I hope this treatise to contribute to your right choice of image format in school education and practical works.