• 한국정보디스플레이학회:학술대회논문집
• /
• 2005.07b
• /
• pp.863-864
• /
• 2005

In recent years, we use overdriving scheme to improve the response time of the liquid crystal. Since conventional overdriving scheme uses memory to perform ideal processing, it is desired to reduce system cost by decreasing the data stored in these SDRAMs. As a general compression method, quantization, sub-sampling and Block Truncation Coding ( BTC ) are used, which process data in block base and cause block effect. So we proposed new data compression method by color space conversion. Because this method compresses luminance and chrominance signal by different ratio, it can efficiently reduce error of block effect in decompression image.

• The Journal of the Acoustical Society of Korea
• /
• v.16 no.1E
• /
• pp.35-40
• /
• 1997

The LZW algorithm has some redundancies for voice traffic. Thus, the V-LZW(Voice LZW) algorithm that decreases the redundancies of the LZW algorithm is suggested for efficent compression of voice. The V-LZW algorithm uses the differential method that reduces the codeword size as well as the length of repeated string. According to the simulation results, it could be seen teat the performance of V-LZW algorithm is better by 35% to 44% in voice compression ratio than that of the conventional modified LZW algorithm. Compared with conventional 32 kbps ADPCM coding with 26 dB SNR, V-LZW has 21 kbps transmission rate, no additional quantization error and simple hardware complexity.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.54 no.11
• /
• pp.673-679
• /
• 2005

This Paper presents the 3D wavelet transformation based video compression system, which possesses the capability of progressive transmission by increasing resolution and increasing rate for multimedia applications. The 3D wavelet packet based video compression system removes the temporal correlation of the input sequences using the motion compensation filter and decomposes the spatio-temporal subband using the spatial wavelet packet transformation. The proposed system allocates the higher bit rate to the low frequency image of the 3D wavelet sequences and improves the 0.49dB PSNR performance of the reconstructed image in comparison with that of H.263. In addition to the limitation on the propagation of the motion compensation error by the 3D wavelet transformation, the proposed system progressively transmits the input sequence according to the resolution and rate scalability.

• Proceedings of the KOSOMBE Conference
• /
• v.1991 no.11
• /
• pp.54-56
• /
• 1991

Many techniques have been used for medial image compression. Its first requirement is "Errorless" or, "Completely Reversible". Under this condition, we have increased the performance of compression using Space Filling Curve. This method converts source image in direction of Hilbert's curve path in order to ate average length longer thar in traditoinal horizental normal path. After that, we have applied RLC and reduced statistical redundancy by Huffman Coding. By this method, we have obtained more efficient results of RLC.

• Journal of Broadcast Engineering
• /
• v.18 no.6
• /
• pp.935-938
• /
• 2013

In this letter, we propose a method for colorization based coding, which divides the colorization matrix into smaller sub-matrices using the meanshift segmentation. Using the proposed method the computation speed becomes more than 30 times faster. Furthermore, the smearing artifact, which appears in conventional colorization based compression method, is greatly reduced.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.7
• /
• pp.1654-1667
• /
• 1996

The conventional fractal image compression methods have high computational complexity at encoding reduce PSNR at low bit rate and havehighly visible blocking effects in a reconstructed image. In this paper we propose a fractal image compression method based on disctete wavelet transform domain, which takes the absolute value of discrete wavelet transform coefficient, and assembles the discrete wavelet tranform coefficients of different highpass subbands corresponding to the same spatial block and then applies "0" encoding according to the energy of each range blocks. The proposed method improved PSNR at low bit rate and reduced computational complexity at encoding distinctly. Also, this method can achieve a blockless reconstructed image and perform hierarchical decoding without recursive constractive transformation. Computer simulations with several test images show that the proposed method shows better performance than convnetional fractal coding methods for encoding still pictures. pictures.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.3
• /
• pp.493-505
• /
• 1997

In this paper, a wavelet image compression method using human visually estimated quantizer is proposed. The quantizer has three components. These are constructed by using effects of frequency band, background luminance, and spatial masking. The first quantization factor is a fixed constant value for each band. The second factor is calculated by averaging four wavelet coefficients in the lowest frequency band. The third factor is determined by the difference between wavelet coefficients in the lowest frequency band. Arithmetic coding is used for encoding quantized wavelet coefficients. Coefficients in the lowest band are transmitted without loss. Therefore the compressed image is decompressed by using three quantization factors which can be calculated in the receiver. Compared with previous image compression methods which adopted human visual system, the proposed method shows improved results with less computational cost.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2000.08a
• /
• pp.253-256
• /
• 2000

In this paper, we propose the lossless image compression algorithm using the integer wavelet transform. Recently, the S＋P transform is widely used and computed with only integer addition and bit-shift operations, but not proper to remove the correlation of smooth images. then 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 compared to the compression ratio using the S+P transform with different types of images.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.23 no.5
• /
• pp.732-736
• /
• 1986

This paper propose a novel vector-quantized block truncation coder for image data compression. A data compression ratio of about 3-6 times larger than that of the BTC can be achieved by utilizign a vector quantizer with the BTC. A vector quantizer was realized by computer simulation. The compressed data rate of 0.7~1.0 bit/pel with intraframe coder and that of 0.3~0.5 bit/pel with interframe coder gives a good performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.6C
• /
• pp.785-792
• /
• 2004

In this paper, we propose a fast and efficient method that improves the performance of embedded zerotree wavelet(EZW) algorithm introduced by Sharipo． In the EZW algorithm, two bits are allocated for a symbol, but it is inefficient for compression and the zerotree coding wastes much time at encoding. In this paper, in order to increase the efficiency of compression, it will be allocated a variable bit for a symbol at each subband. To reduce the encoding time, we use a backscan method and lifting scheme instead of filter bank in wavelet transform. Experimental result are shown that the algorithm suggested in this paper has a better performance about 0.3∼1.5㏈ PSNR while the encoding time was speeded up more than 2-10 times compared with the EZW algorithm.