• Journal of Biomedical Engineering Research
• /
• v.12 no.3
• /
• pp.215-222
• /
• 1991

In this paper, we present a result of our study on how to construct a pilot MPACS (medical hic lure archiving and communication System) based on X -Window system. The proposed MPACS Is composed of image acquisition units, image archiving and processing units, display units, and all units are Interfaced with a LAN The image management is done according to the TIFF (Tagged Image File Format) , and the dis- play system is built upon generally accepted software packages, namely the X -Window system. Also, lossless and lossy digital image compression methods were implemented and tested with X -ray and CT images.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10a
• /
• pp.502-504
• /
• 2003

사전식 압축 방식이라 불리는 LZ-압축은 빠르고도 좋은 압축률을 가지고 있기 때문에 널리 이용되고 있다. 그래서 LZ-압축 방식을 이미지 압축에 적용하는 시도가 이루어지고 있으나 아직 명확하게 정의가 이루어지지 않거나, 정확한 실험 결과가 제시되지 않은 경우가 많다. 이 논문에서는 기존의 정사각형을 이용한 압축 과정 중 다소 모호했던 파싱 과정을 명확히 하며, 매칭에 사용된 정사각형들이 겹쳐지는 비율에 관한 확률적 분석 및 실험 결과를 제시한다. 또한 Test Image Set에 관한 정확한 압축률을 제시한다. 특히 이 논문은 정사각형들이 겹쳐지는 비율에 관한 최초의 확률적 분석을 제시하고 있다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2018.06a
• /
• pp.262-263
• /
• 2018

최근 디스플레이 크기 및 영상 해상도가 커짐에 따라 디스플레이와 외부 메모리 간 대역폭이 큰 부담이 되고 있다. 본 논문은 이런 문제를 해결하기 위해 라인 단위 영상 압축 기법을 제안한다. 방향성 인트라 예측, 컬러 성분 간 보상 등으로 구성된 제안기법은 50dB 정도 PSNR 에서 최대 12:1 정도의 압축률을 보인다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.114-116
• /
• 2008

본 논문은 현존하는 음원 파일 압축의 개선을 위해 작성되었다. 새로운 무손실 압축 알고리즘을 통한 오차값의 분포는 새로운 압축기법의 가능성을 설명한다. 몇가지 실험은 제안하는 알고리즘의 장점을 제안한다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.10
• /
• pp.586-594
• /
• 2003

X-Match algorithm is a lossless compression algorithm suitable for hardware implementation owing to its simplicity. It can compress 32 bits per clock cycle and is suitable for real time compression. However, as the bus width increases 64-bit, the compression unit also need to increase. This paper proposes the cooperative parallel X-Match (X-MatchCP) algorithm, which improves the compression speed by performing the two X-Match algorithms in parallel. It searches the all dictionary for two words, combines the compression codes of two words generated by parallel X-Match compression and outputs the combined code while the previous parallel X-Match algorithm searches an individual dictionary. The compression ratio in X-MatchCP is almost the same as in X-Match. X-MatchCP algorithm is described and simulated by Verilog hardware description language.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.7
• /
• pp.3543-3557
• /
• 2017

Compression is a very important technique for remotely sensed hyperspectral images. The lossless compression based on the recursive least square (RLS), which eliminates hyperspectral images' redundancy using both spatial and spectral correlations, is an extremely powerful tool for this purpose, but the relatively high computational complexity limits its application to time-critical scenarios. In order to improve the computational efficiency of the algorithm, we optimize its serial version and develop a new parallel implementation on graphics processing units (GPUs). Namely, an optimized recursive least square based on optimal number of prediction bands is introduced firstly. Then we use this approach as a case study to illustrate the advantages and potential challenges of applying GPU parallel optimization principles to the considered problem. The proposed parallel method properly exploits the low-level architecture of GPUs and has been carried out using the compute unified device architecture (CUDA). The GPU parallel implementation is compared with the serial implementation on CPU. Experimental results indicate remarkable acceleration factors and real-time performance, while retaining exactly the same bit rate with regard to the serial version of the compressor.

• Journal of Korea Society of Industrial Information Systems
• /
• v.20 no.5
• /
• pp.53-60
• /
• 2015

In this paper, the DCT based lossless image compression system which selects a limited number of DCT coefficients is proposed for the Lenna, Camerman, and Baboon image. The number of DCT coefficients to obtain a suitable image quality for the reconstructed image is computed by simulation. The image size of $256{\times}256$ are used in the experiment. The PSNR values for the reconstructed image by selecting limited number of DCT coefficients are found. It is shown that the minimun number of the coefficients for Lenna, Cameramen Baby and Babbo image to obtain PSNR=30 are N=16, 32, 37, 55, respectively. The result can provide the guideline of the importance of the DCT coefficient toward the compression for the tested image of the Lena, Cameraman, and Baboon.

• Journal of KIISE:Software and Applications
• /
• v.31 no.12
• /
• pp.1628-1636
• /
• 2004

Data compression techniques have been studied for decades because they saved space and time to reduce costs. The Lempel-Ziv 77 (LZ77) is a dictionary-based, lossless compression algorithm. The dictionary size of the LZ77 algorithm is fixed, and the performance of the algorithm is highly dependent on its dictionary size. In this paper, we suggest a dynamic LZ77 algorithm that changes its dictionary size during compression, and also we suggest a genetic algorithm to evolve the dictionary-resizing strategies. The suggested algorithm outperformed the original version up to about 16%.

• Journal of the Korea Society of Computer and Information
• /
• v.4 no.1
• /
• pp.1-6
• /
• 1999

In this paper We propose the new lossless compression method which use Huffman Coding using the preprocessing to compress the still image. The proposed methode divide into two parts according to activity of the image. If activities are high, the original Huffman Coding method was used directly. IF activities are low, the nibble run-length coding and the bit dividing method was used. The experimental results show that compression rate of the proposed method was better than the general Huffman Coding method.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.7-12
• /
• 2009

In JPEG2000, the Cohen-Daubechies-Feauveau (CDF) 9/7-tap wavelet filter adopted in lossy compression is implemented by the lifting scheme or by the convolution scheme while the LeGall 5/3-tap wavelet filter adopted in lossless compression is implemented just by the lifting scheme. However, these filters are not optimal in terms of Peak Signal-to-Noise Ratio (PSNR) values, and irrational coefficients of wavelet filters are complicated. In this paper, we proposed a method to optimize image quality based on wavelet filter design and on wavelet decomposition. First, we propose a design of wavelet filters by selecting the most appropriate rational coefficients of wavelet filters. These filters are shown to have better performance than previous wavelet ones. Then, we choose the most appropriate wavelet decomposition to get the optimal PSNR values of images.