• Journal of IKEEE
• /
• v.17 no.3
• /
• pp.352-359
• /
• 2013

This paper proposes an entropy coding unit for H.264/AVC baseline profile. Entropy coding requires code tables for macroblock encoding. There are patterns in codewords of each code tables. In this paper, the patterns between codewords are analyzed to reduce the hardware cost. The entropy coding unit consists of Exp-Golomb unit and CAVLC unit. The Exp-Golomb unit can process five code types in a single unit. It can perform Exp-Golomb processing using only two adders. While typical CAVLC units use various code tables which require large amounts of resources, the sizes of the tables are reduced to about 40% or less of typical CAVLC units using relationships between table elements in the proposed CAVLC unit. After the Exp-Golomb unit and the CAVLC unit generate code values, the entropy unit uses a small size shifter for bit-stream generation while typical methods are barrel shifters.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.7
• /
• pp.1515-1522
• /
• 1997

Several image coding algorithms have been developed for the telecommunication and multimedia systems with high image quality and high compression ratio. In order to achieve low entropy and distortion, the system should pay great cost of computation time and memory. In this paper, the uniform cubic lattice is chosen for Lattice Vector Quantization (LVQ) because of its generic simplicity. As a transform coding, the Discrete Wavelet Transform (DWT) is applied to the images because of its multiresolution property. The proposed algorithm is basically composed of the biorthogonal DWT and the uniform cubic LVQ. The multiresolution property of the DWT is actively used to optimize the entropy and the distortion on the basis of the distortion-rate function. The vector codebooks are also designed to be optimal at each subimage which is analyzed by the biorthogonal DWT. For compression efficiency, the vector codebook has different dimension depending on the variance of subimage. The simulation results show that the performance of the proposed coding mdthod is superior to the others in terms of the computation complexity and the PSNR in the range of entropy below 0.25 bpp.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.6
• /
• pp.1222-1236
• /
• 2010

In this paper, we propose an improved distributed multi-view video coding method that is robust to illumination changes among different views. The use of view dependency is not effective for multi-view video because each view has different intrinsic and extrinsic camera parameters. In this paper, a modified distributed multi-view coding method is presented that applies illumination compensation when generating side information. The proposed encoder codes DC values of discrete cosine transform (DCT) coefficients separately by entropy coding. The proposed decoder can generate more accurate side information by using the transmitted DC coefficients to compensate for illumination changes. Furthermore, AC coefficients are coded with conventional entropy or channel coders depending on the frequency band. We found that the proposed algorithm is about 0.1~0.5 dB better than conventional algorithms.

• 한국정보디스플레이학회:학술대회논문집
• /
• 2004.08a
• /
• pp.1240-1243
• /
• 2004

Multi-Valued Image Entropy Coding (MVIEC) is a new class of joint source channel coding, which reduces both input-width (1/4) and average current (0.36-1.3) for LCD source drivers. This paper describes the detail results on MVIEC for several image sets in order to verify the practical performance.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.609-612
• /
• 1999

In this paper, we propose wavelet transform image compression method such that an image is decomposed into multiresolutions using biorthogonal wavelet transform with linear phase response property and decomposed subbands are classified by maximum classification gain. The classified data is quantized by allocating bits in accordance with classified class informations within subbands through arbitrary set bit allocation algorithm. And then, quantized data in each subband are entropy coded. The proposed coding method is that the quantized data perform shuffling before entropy coding in order to remove sign bit plane. And the context is assigned by maximum correlation direction for bit plane coding.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.114-117
• /
• 2004

This paper proposes a novel algorithm for hybrid lossless audio coding, which employs integer discrete cosine transform. The proposed algorithm divides the input signal into frames of a proper length, decorrelates the framed data using the integer DCT and finally entropy-codes the frame data. In particular, the adaptive Golomb-Rice coding method used for the entropy coding selects an optimal option which gives the best compression efficiency. Since the proposed algorithm uses integer operations, it significantly improves the computation speed in comparison with an algorithm using real or floating-point operations. When the coding algorithm is implemented in hardware, the system complexity as well as the power consumption is remarkably reduced. Finally, because each frame is independently coded and is byte-aligned with respect to the frame header, it is convenient to move, search, and edit the coded data.

• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.908-911
• /
• 2002

Over the past 30 years, many efficient 2D video coding techniques have been presented and developed from many research centers for commercialization. However, direct application of these monocular compression schemes is not optimal for stereo video coding. In this paper, we present a new technique for coding stereo video sequences based on Discrete Wavelet Transform (DWT). The proposed technique exploits Zerotree Entropy Coding (ZTE) that makes use of the wavelet block concept to achieve low bit rate stereo video coding. The one of two image streams, called main stream, is independently coded by modified MPEG-4 encoder and the other stream, called auxiliary stream, is coded by predicting from its corresponding image, its previous image or its follow image.

• Journal of Korea Society of Industrial Information Systems
• /
• v.6 no.1
• /
• pp.39-47
• /
• 2001

A blocked zerotree coding algorithm for compression of subband image is proposed. Significance of blocks with respect to a certain threshold are coded with a set of transition rules for the significance of blocks. Significant blocks are quantized by vector quantization. The basic idea for this coding approach are: 1) Subband images are coded by blocks, 2) Important blocks based on the significance of blocks are coded and quantized, 3) Multiband codebook which is composed of sub-codebooks dedicated for each threshold and subband level is adapted to produce good reproduction vectors for vector quantization. The compression results are similar to Shapiro's zerotree coding even though ours are obtained without entropy coding of bit streams from blocked zerotree encoder. If an entropy coding is applied to the bitstream, PSNR will be improved.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.8C
• /
• pp.1055-1061
• /
• 2004

In this paper, we propose an efficient dynamic coding scheme by using multiple codewords in H.264/AVC entropy coding. The exponential Golomb (Exp-Golomb) codewords used in H.264/AVC do not reflect enough the symbol distributions of the combined syntax element in (7) due to their static probability distribution characteristics. However, the multiple codewords in this paper have different statistical characteristics. we propose a dynamic coding scheme by using selectively among multiple codewords to encode the combined syntax element according to given image sequences. Simulation results show that our proposed scheme outperforms the existing (7) method in compression efficiency without loss of quality.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.9C
• /
• pp.1244-1251
• /
• 2004

In this paper, we propose an efficient dynamic coding scheme by using multiple code words in H.264/A VC entropy coding. The exponential Golomb (Exp-Golomb) code words used in H 264/A VC do not reflect enough the symbol distributions of the combined syntax element in [7] due to their static probability distribution characteristics However, the multiple codewords in this paper have different statistical characteristics. we propose a dynamic coding scheme by using selectively among multiple codewords to encode the combined syntax clement according to given image sequences. Simulation results show that our proposed scheme outperforms the existing [7] me in compression efficiency without loss of quality.