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

• Proceedings of the Korea Contents Association Conference
• /
• 2003.05a
• /
• pp.214-217
• /
• 2003

In this paper, we proposed an efficient blind watermarking algorithm using wavelet transform. The proposed algorithm inserts watermark into the high frequency subbands that were transformed by 1-level wavelet transform of original image. Watermark insertion is achieved by exchanging each the corresponding coefficients in the HL, LH, HH subbands according to be inserted watermark value. And watermark is extracted by the relation of wavelet coefficients without original image. Experimental results demonstrate that watermarked image has a good quality not to be able to be perceptible and is robust various attacks such as JEPG lossy compression, clipping and sharpening.

• Korean Journal of Cognitive Science
• /
• v.21 no.1
• /
• pp.145-156
• /
• 2010

This paper presents a new contents-based digital still image protection method which includes a copyright message. Since the existing method using gradient values used a pixel based $3{\times}3$ Sobel operator, it was sensitive to attacks and could not extract exact copyright message. Therefore, in this paper, we present a algorithm which uses block based OCL(Orientation Certainty Level) instead of pixel. The experimental results show that the proposed scheme not only has good image quality, but also is robust to JPEG lossy compression, filtering, sharpening, blurring and noise. Moreover, the proposed algorithm has good performance more than 10% in rotation attacks than the existing method.

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

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

• Journal of Advanced Navigation Technology
• /
• v.19 no.6
• /
• pp.614-622
• /
• 2015

Binary MQ arithmetic coding is widely used recently as a basic entropy coder in multimedia coding system. MQ coder esteems high in compression efficiency to be used in JBIG2 and JPEG2000. The importance of arithmetic coding is increasing after it is adopted as an unique entropy coder in HEVC standard. In the binary MQ coder, arithmetic approximation without multiplication is used in the process of recursive subdivision of range interval. Because of the MPS/LPS exchange activity happened in MQ coder, output byte tends to increase. This paper proposes an enhanced binary MQ arithmetic coder to make use of a lookup table for AQe using quantization skill in order to reduce the deficiency. Experimental results show that about 4% improvement of compression in case of JBIG2 for bi-level image compression standard. And also, about 1% improvement of compression ratio is obtained in case of lossless JPEG2000 coding. For the lossy JPEG2000 coding, about 1% improvement of PSNR at the same compression ratio. Additionally, computational complexity is not increasing.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.41 no.11
• /
• pp.97-104
• /
• 2004

This paper proposes an efficient VLSI architecture of 9-7/5-3 Lifting DWT filters that is used by lossy or lossless compression of JPEG2000. The proposed architecture uses only internal line memories to compute Lifting-DWT operations and its PE(Processing Element) has critical path with 1 multiplier and 1 adder. To reduce the number of PE, we make the vertical filter that is responsible for the column operations of the first level perform both the row and column operations of the second and following levels. As a result, the architecture has smaller hardware cost compared to that of other architectures. It was modeled in RTL level using VHDL and implemented on Altera APEX 20K FPGA.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.41 no.4
• /
• pp.75-82
• /
• 2004

The channel transmission ratio is speeded up by the combination of the Huffman algorithm, the model scheme of the lossy transform having minimum average code lengths for the image information and good instantaneous decoding capability, with the Lempel-Ziv algorithm showing the fast processing performance during the compression process. In order to increase the processing speed during the compression process, ICMEP algorithm is proposed and the entropy encoder of HDTV is designed and inspected. The ICMEP entropy encoder have been designed by choosing the top-down method and consisted of the source codes and the test benches by the behavior expression with VHDL. As a simulation results, implemented ICMEP entropy encoder confirmed that whole system efficiency by memory saturation prevention and compressibility increase improves.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.12A
• /
• pp.2085-2091
• /
• 2001

In lossy compression method, the transformed coefficients are quantized. This results in the quantization noise. The video image quality and bit rate is closely related with the quantization step. In this paper, we proposed a new quantization function for the improved performance. The DC value of each macroblock is compensated depending on the magnitude of DC quantization error. It is implemented very low bit-rate video coding, i.e., H.26L. The experimental result is useful when the object motion is not severe.