Lossless Image Compression Based on Multiple-Tables Arithmetic Coding
نویسندگان
چکیده
1 Department of Information Management, Chaoyang University of Technology, No. 168, Jifong E. Rd., Wufong Township Taichung County 41349, Taiwan 2 Department of Computer Science, National Tsing-Hua University, No. 101, Section 2, Kuang-Fu Road, Hsinchu 300, Taiwan 3 Department of Management Information Systems, National Chung Hsing University, 250 Kuo-kuang Road, Taichung 402, Taiwan 4 Department of Information Engineering and Computer Science, Feng Chia University, No. 100 Wenhwa Rd., Seatwen, Taichung 407, Taiwan
منابع مشابه
Lossless Image Compression Using Data Folding Followed By Arithmetic Coding
The paper presents a lossless image compression technique using the hybridization of two different entropy coding techniques. Initially data folding technique has been applied to the image. A row folding is applied on the image matrix followed by a column folding. Multiple iterations of this process is applied on the image. After completing the data folding process another entropy coding techni...
متن کاملWavelet-Based Image Compression with Polygon-Shaped Region of Interest
A wavelet-based lossy-to-lossless image compression technique with polygon-shaped ROI function is proposed. Firstly, split and mergence algorithms are proposed to separate concave ROIs into smaller convex ROIs. Secondly, row-order scan and an adaptive arithmetic coding are used to encode the pixels in ROIs. Thirdly, a lifting integer wavelet transform is used to decompose the original image in ...
متن کاملEfficient Representation and Decoding of Static Huffman Code Tables in a Very Low Bit Rate Environment
The lossless entropy coding used in many image coding schemes often is overlooked as most research is based around the lossy stages of image compression. This paper examines the relative merits of using static Huffman coding with a compact optimal table verses more sophisticated adaptive arithmetic methods. For very low bit rate image compression, the computationally simple Huffman method is sh...
متن کاملLocal Prediction for Lossless Image Compression
In predictive coding a group of neighboring picture elements is used to select a suitable prediction value for a current pixel. In this paper, we propose two techniques for lossless images compression based on predictive coding. In the rst technique which called, the predictors, we replace each pixel in the image by the predicted pixel; we use various schemes to predict the value of a pixel. In...
متن کاملA Neural Network for Context-based Arithmetic Coding in Lossless Image Compression
Significant progress has recently been made in lossless image compression using discrete wavelet transforms. The overall performance of these schemes may be further improved by properly designing efficient entropy coders. In this paper a new technique is introduced for the implementation of context-based adaptive arithmetic entropy coding. This technique is based on the prediction of the value ...
متن کامل