Adaptive Context Based Coding for Lossless Color Image Compression

An adaptive low complexity lossless segment (context) based color image compression method is proposed by this paper. First, adaptive context based dividing for an image is conducted to find optimal fixed length codes that are used for storing relative values of every pixel in each segment of the image and the length for each segment by a modified greedy algorithm. Then a modified Huffman coding is applied for the result of the first compression. The complexity of the first compression for the developed method is O(n). The developed method was tested by a typical set of natural images. For some type of images, the compression ratios are very high