• The Transactions of the Korea Information Processing Society
• /
• v.3 no.6
• /
• pp.1624-1635
• /
• 1996

Palletized color images are the dominant type of the image used on Internet and World-Wide Web. In spite of this, most image compression and progressive transmission algorithm have been designed for continuous-tone images. Pallettize images. Palletized images differ from continuous-tone images in such a aspect that values are lookup table indices a new pyramid structure for compression and progressive transmission of a palletized image. In the proposed pyramid structure, the color of a node at higher level is the one that occupies the most part in 4 sons and each node is represented by a type code and several color codes. Since the proposed method do not exploit spatial correlation in an image, it is ideally applied to lossless compression and progressive transmission of palletized images. We have confirmed this through the experimental results.

• Journal of Internet Computing and Services
• /
• v.10 no.1
• /
• pp.75-82
• /
• 2009

In this paper, we propose a robust preprocessing scheme for entropy coding in gray-level image. The issue of this paper is to reduce additional information needed when bit stream is transmitted. The proposed scheme uses the preprocessing method of co-occurrence count about gray-levels in neighboring pixels. That is, gray-levels are substituted by their ranked numbers without additional information. From the results of computer simulation, it is verified that the proposed scheme could be reduced the compression bit rate by up to 44.1%, 37.5% comparing to the entropy coding and conventional preprocessing scheme respectively. So our scheme can be successfully applied to the application areas that require of losslessness and data compaction.

• Journal of the Institute of Convergence Signal Processing
• /
• v.1 no.1
• /
• pp.82-88
• /
• 2000

In this paper, We compare the Harr wavelet of the S+P transform with various integer coefficient filter banks and apply 9/7 ICFB to the wavelet transform. In addition, we propose a entropy-coding method that exploits the multiresolution structure and the feedback of the prediction error, and can efficiently compress the transformed image for progressive transmission. Simulation results are included to compare to the compression ratio using the S+P transform with different types of images.

• Proceedings of the KIEE Conference
• /
• 1993.07a
• /
• pp.504-506
• /
• 1993

The Joint Photographic Experts Group (JPEG) standard was proposed by the International Standardization Organization (ISO/SC 29/WG 10) and the CCITT SG VIII as an international standard for digital continuous-tone still image compression. The JPEG standard has been widely accepted in electronic imaging, computer graphics, and multi-media applications, however, due to the lossy character of the JPEG compression its application in the field of medical imaging has been limited. In this paper, the JPEG standard was applied to a series of head sections of magnetic resonance (MR) images (256 gray levels, $256{\times}256$ size) and its performance was investigated. For this purpose, DCT-based sequential mode of the JPEG standard was implemented using the CL550 compression chip and progressive and lossless coding was implemented by software without additional hardware. From the experiment, it appears that the compression ratio of about 10 to 20 was obtained for the MR images without noticeable distortion. It is also noted that the error signal between the reconstructed image by the JPEG and the original image was nearly random noise without causing any special-pattern-related artifact. Although the coding efficiency of the progressive and hierarchical coding is identical to that of the sequential coding in compression ratio and SNR, it has useful features In fast search of patient Image from huge image data base and in remote diagnosis through slow public communication channel.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.4
• /
• pp.714-725
• /
• 1997

This paper proposes an image compression method using the wavelet transform and bit-plane coding of wavelet coefficients. The hierarchical application of wavelet transform to an image produces one low resoluation(the subband with lowest frequency) image and several high frequency subbands. In the proposed method, the low resolution image is compressed by a lossless method at 8 bits per each coefficient. However, the high frequency subbands are decomposed into 8 bit planes. With an adptive block coding method, the decomposed bit planes are effectively compressed using localized edge information in each bit plane. In addition, the propsoed method can control bit rates by selectively eliminating lessimportant subbands of low significant bit planes. Experimental results show that the proposed scheme has better performance in the peak signal to noise ratio (PSNR) and compression rate than conventional image coding methods using the wavelet transform and vector quantization.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.1
• /
• pp.81-90
• /
• 2010

This paper presents H.264 coding schemes for multi-view video using the concept of layered depth image(LDI) representation and efficient compression technique for LDI. After converting those data to the proposed representation, we encode color, depth, and auxiliary data representing the hierarchical structure, respectively, Two kinds of preprocessing approaches are proposed for multiple color and depth components. In order to compress auxiliary data, we have employed a near lossless coding method. Finally, we have reconstructed the original viewpoints successfully from the decoded approach that is useful for dealing with multiple color and depth data simultaneously.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.3
• /
• pp.36-41
• /
• 2002

Generally, cartoon images are simple and involve a small number of colors and often include large homogeneous regions with same color or gradient. In this paper, effective compression method for complementary quadtree was suggested for cartoon images, by using those properties. And with progressive transmission, this method involves a progressive increase in the image resolution at the receiver from a lower to a higher resolution during the transmission of data. This is an effective way of using a limited transmission channel, because, after estimating the value of the data in the early transmission period, a decision can be made whether or not to proceed with the transmission of the remaining part. Since the proposed method is lossless and involves progressive transmission, it was compared with progressive PNG and progressive GIF, which had same functions.

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

• Proceedings of the KIEE Conference
• /
• 2008.04a
• /
• pp.107-108
• /
• 2008

본 논문에서는 8-bits의 그레이레벨 영상에서 그레이레벨(gray-level) 값들의 발생 빈도(frequency)에 따른 순위 변환(Ranking-Transformation)을 이용한 효율적인 무손실 압축을 제안한다. 제안한 기법은 서로 인접한 픽셀의 그레이레벨의 쌍에 대한 발생 빈도를 토대로 원 영상의 그레이레벨 값을 이에 대응하는 순위 값으로 변환시킨다. 이때 부가정보가 발생하지 않도록 입력영상의 픽셀들에 대하여 한 픽셀씩 순차적으로 지정한 순위로 재구성한다. 실험결과, 부가 정보 없이 입력 영상을 압축하게 되어 엔트로피 부호화기를 통한 디지털 영상들의 효율적인 압축 성능 향상을 기대할 수 있다.