• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.1375-1378
• /
• 1987

In this paper, an efficient data compression algorithm for binary image is proposed. This algorithm makes use of the fact that boundaries contain all the information about such images. The compression efficiency is then further increased by efficient coding of Boundary Information Matrix. The comparison of performance with modified Huffman coding was made by a computer simulation with some images. The results of simulation showed that the proposed algorithm was more efficient than modified Huffman code.

• Proceedings of the KIEE Conference
• /
• 1993.11a
• /
• pp.346-349
• /
• 1993

A method for image compression based on decomposition is presented. We design the efficient coding technique for upper band image signals. This coding technique with directive 1-D DPCM is based on the statistical properties of upper bands. Lower band image signals is encoded using 2-D DPCM. The directive 1-D DPCM is performed, scanning upper bands according to edge direction. And then the predicted error signals of upper band sis coded using B1 and Huffman code, and the predicted error signals of lower band is coded using Huffman code. The proposed system shows improved performance when compared with other existing methods with respect to peak signal to noise ratio(PSMR) and human visual system(HVS) properties.

• The Journal of the Acoustical Society of Korea
• /
• v.20 no.7
• /
• pp.76-82
• /
• 2001

In this paper, a novel quantization method for wideband signal codec with 7 kHz bandwidth is proposed. In the transform-based wideband signal codecs, the signal is transformed to frequency domain and the spectral coefficients in each frequency band are quantized based on human perceptual model, followed by Huffman coding. However, the property of each band varies with frequency, and the codec has poor performance when all bands are quantized with the same method. Therefore, a selective quantization method is proposed, which analyzes the band property and selects the quantization domain between frequency domain and time domain based on the quantization efficiency. It is confirmed that the proposed method has better performance than the quantizer of G722.1 codec.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.1
• /
• pp.111-119
• /
• 1994

In this paper we propose a reversible image coding methods with progressive build-up function by bit-plane of multi-lavel image. Firstly, the differencial conversion is applied to reduce the entropy of source images. Then the bit-plane sequences of converted images are coded by means of the newly designed VFRL(Variable to Fixed Run-Llength) code and the RDHC(Run-length Dynamic Huffman Coding). We aim to the simple construction to reduce the complexity. The computer simulated results show that the proposed methods are very effective to the multi-level digital images. For "GIRL" and "COUPLE" of 1EEE monochromatic standard images, the compressibility are superior to the results obtained by the well-known universal codes.own universal codes.

• The Journal of the Acoustical Society of Korea
• /
• v.28 no.3
• /
• pp.290-297
• /
• 2009

This paper presents an improved adaptive multi-rate wideband (AMR-WB) algorithm for the efficient Text-To-Speech (TTS) database compression. The proposed algorithm includes unnecessary common bit-stream (CBS) removal and parameter delta coding combined with speaker-dependent huffman coding to reduce the required bit-rate without any quality degradation. We also propose lossy coding schemes to produce the maximum bit-rate reduction with negligible quality degradation. The proposed lossless algorithm including CBS removal can reduce bit-rate by 12.40% without quality degradation compared with the 12.65 kbps AMR-WB mode. The proposed lossy algorithm can reduce bit-rate by 20.00% with 0.12 PESQ degradation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.12
• /
• pp.1956-1969
• /
• 1993

The tilted Huffman trees are used in JPEG and MPEG image compression standards for Huffman coding. In this paper we propose a new decoding technique for Huffman code, symbols are decoded by repeatedly obtaining the predefined number of consecutive bits and accessing symbol tables based on the obtaining bits. We show that the size of the symbol table can be small if the Huffman tree is tilted. Specifically, we show an upper bound on the size in this paper. Since the proposed method processes multiple bits at each clock, it can be used for real time processing. We show such evaluation results.

• ETRI Journal
• /
• v.31 no.5
• /
• pp.613-615
• /
• 2009

We propose a pilot-based coding (PBC) scheme for lossless bit rate reduction of parametric stereo (PS) in enhanced aacPlus. It uses PBC in addition to the existing frequency and time differential coding to encode and decode PS parameter indexes. We also design optimal Huffman codebooks (HCBs) for PBC in the proposed scheme. Experiments show that the proposed scheme is superior to the original coding scheme, where both the new coding structure and the optimal HCBs contribute to the bit rate reduction.

• Convergence Security Journal
• /
• v.7 no.2
• /
• pp.57-63
• /
• 2007

The security of data in network is provided by encryption. Selective encryption is a recent approach to reduce the computational cost and complexity for large file size data such as image and video. This paper describes techniques to encrypt Huffman code and discusses the performance of proposed scheme. We propose a simple encryption technique applicable to the Huffman code and study effectiveness of encryption against insecure channel. Our scheme combine encryption process and compression process, and it can reduce processing time for encryption and compression by combining two processes.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.1
• /
• pp.57-68
• /
• 2004

Although variable-length codes (VLCs) increase coding efficiency using the statistical characteristics of the source data, they have catastrophic effects from bit errors in noisy transmission environments. In order to overcome this problem with VLCs, reversible variable-length codes (RVLCS) have recently been proposed owing to their data recovering capability. RVLCS can be divided into two categories: symmetrical and asymmetrical RVLCs. Although the symmetrical RVLC has generally more overheads than the asymmetrical RVLC, it has some advantages of simpler design and more efficient memory usage. However, existing symmetrical RVLCs still have high complexity in their code design and some room for improvement in coding efficiency. In this paper, we propose a new algorithm for constructing a symmetrical RVLC from the optimal Huffman code table. The proposed algorithm has a simpler design process and also demonstrates improved performance in terms of the average codeword length relative to the existing symmetrical RVLC algorithms.

• Journal of Korea Multimedia Society
• /
• v.4 no.1
• /
• pp.75-81
• /
• 2001

A EBCOT(Embedded Block Coding with Optimized Truncation) is image compression codec using in JPEG2000, currently the new standard for still image coding. this paper proposes multi-channel video transfer system with EBCOT using a single codec to transfer video to difference band-width channel. This parer testify that compression rate of EBCOT higher than ordinary VLC using RLC and Huffman codec and apply EBCOT to JPEG structure. this structure increases parallelism and error resilience using black coding method. finally it looks into difficult to apply MPEG structure to multi channel video transfer system, and proposes solution using EBCOT.