• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.13 no.5
• /
• pp.390-399
• /
• 1988

A conventional BTC has the merit of real time processing and simple computation, but has the problem that its compression rate is low. In this paper, a modified BTC using the Quad Tree which is frequently used in binary image is proposed. The method results in the low compression rate by decreasing the total number of subblocks by mean of making the size of a subblock large in the small variation area of graty level and the size af a subblock small in the large variation area of gary level. For the effective transmission of bit plane, the Huffman run-lengh code for the large size of a subblock and the lookup table for tha small size of a subblock are used. The proposed BTC method show the result of coding 256 level image at the average data rate of about 0.8 bit/pixel.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.3 no.4
• /
• pp.308-312
• /
• 2002

Recently, Internet is getting more popular and the usage of multimedia contents is getting more increased. Among the multimedia contents, the JPEG format is the most commonly used Image data format but the JPEG format doesn't supply cryptographic methods and access control. In this paper, a cryptographic method for cipher JPEG Image is proposed. This method can supply encryption and decryption using several algorithms such as DES to the JPEG Image data. Huffman table, which is the most important data area for JPEG data coding, is chosen as the coding data. Each method is compared to select the optimal cryptographic method in a certain environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.6
• /
• pp.1482-1489
• /
• 1998

This paper aims to extract characteristics of the spectrum of fingerprint image and to apply them to image enhancement techniques in spatial frequency domain. Based on 1$\times$64 window as a processing unit and the different record lengths(32, 16, 8), the estimate of power spectrum density for each length was made. Each acquired spectrum characteristics was applied to the re-synthesis process of the fingerprint image, an improved gray scale image was obtained. In order to select an optimal predictor and the Huffman table for the fingerprint iamge, the lossless JPEG algorithm was used. Experiments were performed for extracting distribution characteristics for the each of 7 predictors from the fingerprint image and modeling processes, and the result was applied to the data compression algorithm and the selection of the optimal predictor.

• Journal of Korea Multimedia Society
• /
• v.7 no.5
• /
• pp.640-647
• /
• 2004

This paper presents a method that, by using a tree splay, dynamically modifies the fixed table of a VLC used in the standards and thus improves the performance of a video encoder. The previous standards, which drew up tables by using a limited number of images, were not able to accommodate the characteristics of new image input. The new method proposed in this paper employs the probabilistic characteristics of an image input, thus making encoding more effective. Furthermore, the present study also proposes a method to regulate the weight in order that the accumulated probabilities can make a dominant symbol emerge, while keeping the probability adequate and thus maximally accommodating the characteristics of the image input. The results from applying the proposed method to a variety of image sequences showed that, while various types of images yielded slightly different results, it improved the performance up to a maximum of 0.23㏈, compared to MPEG-4 standard.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.13 no.6
• /
• pp.33-43
• /
• 2003

In this paper, we proposed a real-time watermarking algorithm to be combined and to work with a DWT(Discrete Wavelet Transform)-based image compressor. To reduce the amount of computation in selecting the watermarking positions, the proposed algorithm uses a pre-established look-up table for critical values, which was established statistically by computing the correlation according to the energy values of the corresponding wavelet coefficients. That is, watermark is embedded into the coefficients whose values are greater than the critical value in the look-up table which is searched on the basis of the energy values of the corresponding level-1 subband coefficients. Therefore, the proposed algorithm can operate in a real-time because the watermarking process operates in parallel with the compression procession without affecting the operation of the image compression. Also it improved the property of losing the watermark and the efficiency of image compression by watermark inserting, which results from the quantization and Huffman-Coding during the image compression. Visual recognizable patterns such as binary image were used as a watermark The experimental results showed that the proposed algorithm satisfied the properties of robustness and imperceptibility that are the major conditions of watermarking.