Evaluation of a high performance code compression method

Author(s):  
C. Lefurgy ◽  
E. Piccininni ◽  
T. Mudge
2013 ◽  
Vol 321-324 ◽  
pp. 1219-1224
Author(s):  
Bao Tang Shan ◽  
Fa Nian Wang ◽  
Juan Gao

In order to improve the compression performance of Bayer CFA images exposed continuously, a new high performance remainder set near-lossless compression method is presented. Based on channel-separated-filtering, several typical Bayer CFA image compression methods are compared with the proposed remainder set algorithm. It is proved that the remainder set algorithm has not only the better compression performance, i.e., the lower bits per pixel (average about 2.16bpp), but also the better reconstructed CFA image PSNR (average about 52.31dB). Finally, the proposed method is employed in a multiple channel CMOS image sampling system and some test results are given.


Author(s):  
Borut Žalik ◽  
Domen Mongus ◽  
Niko Lukač

2013 ◽  
Vol 321-324 ◽  
pp. 1234-1237
Author(s):  
Xiao Dong Mu ◽  
Xiao Lin Niu ◽  
Shao Wang Shi ◽  
Wei Song

It has been well accepted that compression is essential to the real-time visualization of large-terrain elevation data. To achieve efficient performance, a terrain compression method featuring high decoding speed is proposed in this paper. A combined prediction scheme is applied in the prediction stage. Golomb-Rice coding is then used to encode the residuals after the prediction stage. The style of the codeword is tailored to make the decoding process amenable to a GPU implementation. Then batching is used to further improve the decoding speed. The proposed method is easy to implement and simple to integrate into existing systems. Experiments show that the compression rate is better than PNG. In terms of decompression efficiency, this method archives a decoding speed of over 5.8 Gpix/s, which is much faster than most existing systems.


2009 ◽  
Vol 2009 ◽  
pp. 1-13 ◽  
Author(s):  
Rung-Ching Chen ◽  
Pei-Yan Pai ◽  
Yung-Kuan Chan ◽  
Chin-Chen Chang

This paper is intended to present a lossless image compression method based on multiple-tables arithmetic coding (MTAC) method to encode a gray-level imagef. First, the MTAC method employs a median edge detector (MED) to reduce the entropy rate off. The gray levels of two adjacent pixels in an image are usually similar. A base-switching transformation approach is then used to reduce the spatial redundancy of the image. The gray levels of some pixels in an image are more common than those of others. Finally, the arithmetic encoding method is applied to reduce the coding redundancy of the image. To promote high performance of the arithmetic encoding method, the MTAC method first classifies the data and then encodes each cluster of data using a distinct code table. The experimental results show that, in most cases, the MTAC method provides a higher efficiency in use of storage space than the lossless JPEG2000 does.


Sign in / Sign up

Export Citation Format

Share Document