Fast lossless image compression with 2D Golomb parameter adaptation based on JPEG-LS
Zicheng Wang, Michael J. Klaiber, Yurij Gera, Sandra Simon, Th. Richter
Abstract
Zicheng Wang, Michael J. Klaiber, Yurij Gera, Sandra Simon, Th. Richter
Abstract
A Fast and Lossless Image Compression (FLIC) algorithm based on the median edge predictor and Golomb coder of JPEG-LS is presented. FLIC eliminates the gradient-based context model from the JPEG-LS standard, the most expensive parts with respect to computational complexity and memory space requirements. To avoid a large context memory, Golomb parameter is selected based on the coding states and the prediction residuals of up to two immediate neighbors, one in each dimension. The FLIC algorithm has low memory footprint and dissolves the data dependencies in JPEG-LS to facilitate parallelization. Experimental results show that the FLIC algorithm achieves a throughput speedup factor of 3.7 over JPEG-LS with less than 4% compression performance penalty. Lossless compression performance results further show that FLIC outperforms other state-of-the-art standards including JPEG 2000 and JPEG XR.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A Fast and Lossless Image Compression (FLIC) algorithm based on the median edge predictor and Golomb coder of JPEG-LS is presented. FLIC eliminates the gradient-based context model from the JPEG-LS standard, the most expensive parts with respect to computational complexity and memory space requirements. To avoid a large context memory, Golomb parameter is selected based on the coding states and the prediction residuals of up to two immediate neighbors, one in each dimension. The FLIC algorithm has low memory footprint and dissolves the data dependencies in JPEG-LS to facilitate parallelization. Experimental results show that the FLIC algorithm achieves a throughput speedup factor of 3.7 over JPEG-LS with less than 4% compression performance penalty. Lossless compression performance results further show that FLIC outperforms other state-of-the-art standards including JPEG 2000 and JPEG XR.
Key concepts: Lossless JPEG, Lossless compression, Golomb coding, Computer science, JPEG, Image compression, Lossy compression, Data compression