.png){kind=icon}
.png){kind=icon}
Return
Lossless image compression method using vector quantization based on minimizing mean absolute error
.png){kind=icon}
PRE
AI
DOI：10.24425/bpasts.2025.154734.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we propose a novel lossless image compression method. During the prediction stage for each block of 8 x 8 pixels, a mechanism for preselecting one of N linear predictors from the dictionary is employed. The dictionary is determined individually for each encoded image using vector quantization (initially with a redundant number of vectors in the dictionary) and a fast algorithm that minimizes mean absolute error. In next steps, the prediction errors are encoded in a two-step manner using an adaptive Golomb code followed by an adaptive binary arithmetic coder. In this study, we demonstrate the efficiency of the proposed solution against other competitive codecs, including those based on deep learning. The proposed method offers high compression efficiency and is characterized by a short decoding time.
Keywords:
entropy coding
lossless data compression
predictive models
vector quantization
iterative reweighted least squares
Journal
B
IF:
1.1
Papers:
56
Citations:
1.5K