• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.2485-2489
• /
• 2005

This paper introduces a new preprocessing scheme to replace original data of gray scale images with particular ordered data so that performance of lossless compression can be improved more efficiently. As a kind of preprocessing technique to maximize performance of entropy encoder, the proposed method converts the input image data into more compressible form. Before encoding a stream of the input image, the proposed preprocessor counts co-occurrence frequencies for neighboring pixel pairs. Then, it replaces each pair of adjacent gray values with particular ordered numbers based on the investigated co-occurrence frequencies. When compressing ordered image using entropy encoder, we can expect to raise compression rate more highly because of enhanced statistical feature of the input image. In this paper, we show that lossless compression rate increased by up to 37.85% when comparing results from compressing preprocessed and non-preprocessed image data using entropy encoder such as Huffman, Arithmetic encoder.

• 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.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.4
• /
• pp.707-715
• /
• 2008

This paper proposes an algorithm for efficient compression gray-level images by entropy encoder. The issue of the proposed method is to replace original data of gray-level images with particular ranked data. For this, first, before encoding a stream of gray-level values in an image, the proposed method counts co-occurrence frequencies for neighboring pixel values. Then, it replaces each pay value with particularly ranked numbers based on the investigated co-occurrence frequencies. Finally, the ranked numbers are transmitted to an entropy encoder. The proposed method improves the performance of existing entropy coding by transforming original gray-level values into rank based images using statistical co-occurrence frequencies of gray-level images. The simulation results, using gray-level images with 8-bits, show that the proposed method can reduce bit rate by up to 37.85% compared to existing conventional entropy coders.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.9
• /
• pp.67-75
• /
• 2012

Optimal quantizers in conducting the entropy-constrained quantization for high bit rates have the lattice structure. The quantization process is simple due to the regular structure, and various quantization algorithms are proposed depending on the lattice. Such a lattice vector quantizer (VQ) can be implemented by using the sample-adaptive product quantizer (SAPQ) and its output can also be easily entropy encoded. In this paper, the entropy encoding scheme for the lattice VQ is proposed based on SAPQ, and the performance of the proposed lattice VQ, which is based on SAPQ with the entropy coder, is asymptotically compared as the rate increases. It is shown by experiment that the gain for the memoryless Gaussian source also approaches the theoretic gain for the uniform density case.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.49 no.2
• /
• pp.18-27
• /
• 2012

Optimal quantizers in conducting the entropy-constrained quantization for high bit rates have the lattice structure. The quantization process is simple due to the regular structure and various quantization algorithms are proposed depending on the lattice. In this paper, such a lattice vector quantization is implemented by using the sample-adaptive product quantizer (SAPQ). It is shown that several important lattices can be implemented by SAPQ and the lattice vector quantization can be performed by using a simple integer-transform function of scalar values within SAPQ. The performance of the proposed lattice SAPQ is compared to the entropy-constrained scalar quantizer and the entropy-constrained SAPQ (ECSAPQ) at a similar encoding complexity. Even though ECSAPQ shows a good performance at low bit-rates, lattice SAPQ shows better performance than the ECSAPQ case for a wide range of bit rates.

• Journal of information and communication convergence engineering
• /
• v.6 no.1
• /
• pp.29-33
• /
• 2008

This paper presents the proposal and hardware design of JPEG baseline encoder. The JPEG encoder system consists of line buffer, 2-D DCT, quantization, entropy encoding, and packer. A fully pipelined scheme for JPEG encoder is adopted to speed-up an image compression. The proposed architecture was described in VHDL and synthesized in Xilinx ISE 7.1i and simulated by modelsim 6.1i. The results showed that the performance of the designed JPEG baseline encoder is higher than that demanded by real-time applications for $1024{\times}768$ image size. The designed JPEG encoder IP can be easily integrated into various application systems, such as scanner, PC camera, color FAX, and network camera, etc.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.8
• /
• pp.1091-1098
• /
• 1995

This paper proposes an efficient noiseless encoding method of vector quantization(VQ) index using a dynamic index mapping. Using high interblock correlation, the proposed index mapper transforms an index into a new one with lower entropy. In order to achieve good performance with low computational complexity, we adopt 'the sum of differences in pixel values on the block boundaries' as the cost function for index mapping. Simulation results show that the proposed scheme reduces the average bitrate by 40 - 50 % in ordinary VQ system for image compression. In addition, it is shown that the proposed index mapping method can be also applied to mean-residual VQ system, which allows the reduction of bitrate for VQ index by 20 - 30 %(10 - 20 % reduction in total bitrate). Since the proposed scheme is one for noiseless encoding of VQ index, it provides the same quality of the reconstructed image as the conventional VQ system.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.11
• /
• pp.1383-1392
• /
• 1995

In this paper, the method to incorporate TCVQ(Trellis Copded Vector Quantizer) into the encoding of the wavelet trans formed(WT) image followed by a variable length coding(VLC) or an entropy coding(EC) is considered. By WT, an original image is separated into 10 bands with various resolutions and directional components. TCVQ used to compress these WT coefficients is a finite state machine that encodes the input source on the basis of the current input and the current state. Wavelet basis used in this paper is designed by orthogonal spline function. A modified set partitioning algorithm to Wang's is also presented. A simple modification to Wang's algorithm gives a highly time-efficient result. Proposed WT-TCVQ encoder shows a very competitive result, giving 37.46dB in PSNR at 1.002bpp when encoding 512$\times$512 LENA.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10b
• /
• pp.262-264
• /
• 1999

본 논문은 IJG(Independent JPEG Group)의 JPEG 부호기의 처리 과정과 동작을 기술한다. IJG JPEG 부호기의 구조는 color conversion, downsampling, preprocessing 과정과 MCU 처리, FDCT, quantization, entropy encoding(sequential 혹은 progressive, huffman 혹은 arithmetic)의 실제적인 JPEG 압축 과정인 JPEG proper로 구성된다. 또한 이러한 모듈들외에 시스템 전체 controller, marker 생성기, 기억장소 관리, 에러 처리를 위한 모듈들을 포함하고 있다. 이에 본 논문에서는 IJG JPEG 부호기의 전체 시스템 구조 및 controller 와 주요 모듈간 인터페이스, 시스템에서 사용하는 주요 자료 구조에 대하여 분석하고자 한다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.4
• /
• pp.774-780
• /
• 2017

This paper proposes an efficient binary arithmetic encoder hardware architecture for CABAC encoding, which is an entropy coding method of HEVC. CABAC is an entropy coding method that is used in HEVC standard. Entropy coding removes statistical redundancy and supports a high compression ratio of images. However, the binary arithmetic encoder causes a delay in real time processing and parallel processing is difficult because of the high dependency between data. The operation of the proposed CABAC BAE hardware structure is to separate the renormalization and process the conventional iterative algorithm in parallel. The new scheme was designed as a four-stage pipeline structure that can reduce critical path optimally. The proposed CABAC BAE hardware architecture was designed with Verilog HDL and implemented in 65nm technology. Its gate count is 8.07K and maximum operating speed of 769MHz. It processes the four bin per clock cycle. Maximum processing speed increased by 26% from existing hardware architectures.