Near lossless image compression by local packing of histogram

In this paper a low complexity algorithm is proposed for near lossless compression of images. The reconstructed near lossless image can differ from the original one within a pixelwise error tolerance. This property is used to convert the histogram of the original image, by the proposed algorithm, to a new histogram which is proved to have minimum entropy. Hence, a new image is formed which has minimum entropy and high spatial correlation among its pixels and can efficiently be compressed. Simulation results show the effectiveness of this compression algorithm.