A New Image Compression Algorithm Based on Non-Uniform Partition and U-System

Abstract

JPEG lossy image compression is a still image compression algorithm model that is currently widely used in major network media. However, it is unsatisfactory in the quality of compressed images at low bit rates. The objective of this paper is to improve the quality of compressed images and suppress blocking artifacts by improving the JPEG image compression model at low bit rates. First, the image texture adaptive non-uniform rectangular partition (ITANRP) algorithm is proposed which partitions the image into <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$8\times 8$</tex-math></inline-formula> size image blocks with high texture complexity and <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$16\times 16$</tex-math></inline-formula> size image blocks with low texture complexity. Then, a new transform coding based on the complete orthogonal U-system and all-phase digital filter (APDF) is proposed for coding image blocks with different sizes. Next, a flexible adaptive quantization scheme is designed to quantize image blocks with different sizes by considering the sensitivity of the human visual system (HVS) to different texture complexities. Finally, combining the above method with the JPEG model, a novel image compression algorithm model with low algorithm complexity is proposed to solve the problem in JPEG. The experimental results demonstrate that the performance of our algorithm model outperforms the JPEG image compression algorithms, the quality of the compressed image is greatly improved, and the blocking artifacts are also significantly suppressed.