• Proceedings of the KIEE Conference
• /
• 2005.10b
• /
• pp.192-194
• /
• 2005

Acceptance of the international standards for video compression, such as H.261, MPEG-1 and MPEG-2, along with the developments in video codec hardware, has created an explosion of application. Among these, the long time quest for long-distance digital video transmission causes an increasing interest in transporting compressed video over networks which are nontraditional for this purpose, including asynchronous transfer mode networks, the Internet, and cellular and wireless channels. Transmission of compression video over packet network is improved for error resilience. And layered video coding techniques improves error resilience. We present a efficient method of scalable video coding for low bandwidth.

• IEIE Transactions on Smart Processing and Computing
• /
• v.5 no.2
• /
• pp.143-151
• /
• 2016

This paper presents new prediction methods to improve compression performance of the so-called near-lossless RGB-domain image coder, which is designed to effectively decrease the memory bandwidth of a system-on-chip (SoC) for image processing. First, variable block size (VBS)-based intra prediction is employed to eliminate spatial redundancy for the green (G) component of an input image on a pixel-line basis. Second, inter-color prediction (ICP) using spectral correlation is performed to predict the R and B components from the previously reconstructed G-component image. Experimental results show that the proposed algorithm improves coding efficiency by up to 30% compared with an existing algorithm for natural images, and improves coding efficiency with low computational cost by about 50% for computer graphics (CG) images.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.1
• /
• pp.81-87
• /
• 1988

This paper proposes a new EBTC(extended block truncation coding) algorithm extended from the BTC for image compression. The EBTC has a capability to eliminate the defects of BTC, such as the deterioration of resolution or blocky effect,and to make a real-time processing like BTC. It shows better performances than the DPCM and the transform coding. Especially, it is a suitable coding method for the high quality picture transmission. It may be adequate to the system of transmission rate of 30-50 Mbits/sec. The picture quality has been scarecely degraded with a vector quantization to the EBTC output at the bit rate of 1.25 bits/pel. The bit rate of the scalar quantized EBTC method is 2.6-3.7 bits/pel.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.6
• /
• pp.2554-2575
• /
• 2020

Data hiding technology hides secret information into the carrier, so that when the carrier is transmitted over network, it will not attract any malicious attention. Using data compression, it is possible to reduce the data size into a small compressed code, which can effectively reduce the time when transmitting compressed code on the network. In this paper, the main objective is to effectively combine these two technologies. We designed a data hiding scheme based on two techniques which are turtle-shell information hiding scheme and absolute moment block truncation coding. The experimental results showed that the proposed scheme provided higher embedding capacity and better image quality than other hiding schemes which were based on absolute moment block truncation coding.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2311-2314
• /
• 2003

In this paper, the embedded zero-tree wavelet image compression method using multi- threshold is proposed, which can reduce the scanning and symbol redundancy of the existing embedded zero-tree wavelet (EZW) method and enable more efficient coding. In the proposed scheme, a multi-threshold is constructed with the maximum absolute values from each subband decomposed by the wavelet transforms of the input image data. The multi-threshold values are compared with the threshold value T$_1$ in each pass in Successive Approximation Quantization (SAQ) to select the significant subbands, which are only used for the subsequent coding processes, therefore, can reduce the coding redundancy in the existing EZW. By the experimental results, it is verified that the proposed multi-threshold EZW method shows superior performances to the existing EZW method.

• The Journal of the Acoustical Society of Korea
• /
• v.14 no.2E
• /
• pp.50-56
• /
• 1995

This paper describes an efficient coding method for Korean characters using a three-state transition graph. To our knowledge, this is the first achievement of its kind. This new method, called the Paralle Hangul Dynamic Coding Method(PHDCM), compresses about 3.5 bits per a Korean character, which is more than 1 bit shorter than the conventional codes introduced thus far to achieve extensive code compression. When we ran the method on a MasPar machine, which is on SIMD SM (EFEW-PRAM)., it achieved a 49.314-fold speedup with 64 processors having 10 million Korean characters.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.11
• /
• pp.3462-3469
• /
• 2000

In this paper,new image vector quantization method for improvemtnt computation cost and compression ratio is proposed. A proposed method could saved the cornputatio cost of codebook eneration and encoding using partial codebook search, partial codevector elements, and interuplion criterion. And to improve cornpression ratio of codegook index lossless coding, codebook rearrangement, and variable length coding scheme are used.

• Journal of Broadcast Engineering
• /
• v.11 no.2 s.31
• /
• pp.153-163
• /
• 2006

We propose a new video compression method based on MCTF(motion compensated temporal filtering) with constant quality. SPECK is an efficient image compression coding method of encoding DWT coefficients. Especially SPECK method is very efficient for coding the motion compensated residual image which usually has larger amounts of high frequency components than the natural images. And proposed multi block size hierarchical motion estimation technique is more efficient than classical block matching algorithm with fixed block size both in estimation precision and operation costs. Proposed video method based on MCTF video compression can also support multi-frame rate decoding with reasonable complexity. Simulation results showed that proposed method outperforms H.263 video compression standard.

• Journal of Electrical Engineering and Technology
• /
• v.7 no.2
• /
• pp.264-272
• /
• 2012

In the field of medical diagnostics, interested parties have resorted increasingly to medical imaging. It is well established that the accuracy and completeness of diagnosis are initially connected with the image quality, but the quality of the image is itself dependent on a number of factors including primarily the processing that an image must undergo to enhance its quality. This paper introduces an algorithm for medical image compression based on the quincunx wavelets coupled with SPIHT coding algorithm, of which we applied the lattice structure to improve the wavelet transform shortcomings. In order to enhance the compression by our algorithm, we have compared the results obtained with those of other methods containing wavelet transforms. For this reason, we evaluated two parameters known for their calculation speed. The first parameter is the PSNR; the second is MSSIM (structural similarity) to measure the quality of compressed image. The results are very satisfactory regarding compression ratio, and the computation time and quality of the compressed image compared to those of traditional methods.

• KIISE Transactions on Computing Practices
• /
• v.22 no.3
• /
• pp.127-132
• /
• 2016

Several methods have been proposed to apply artificial neural networks to text compression in the past. However, the networks and targets are both limited to the small size due to hardware capability in the past. Modern GPUs have much better calculation capability than CPUs in an order of magnitude now, even though CPUs have become faster. It becomes possible now to train greater and complex neural networks in a shorter time. This paper proposed a method to transform the distribution of original data with a probabilistic neural predictor. Experiments were performed on a feedforward neural network and a recurrent neural network with gated-recurrent units. The recurrent neural network model outperformed feedforward network in compression rate and prediction accuracy.