Image Compression Using Blocksort

ICT has been exploring the application of the limited-order blocksort [1MS] to lossy and lossless image compression. The method used to predict values is similar to Binary Tree Predictive Coding (BTPC) [2JR]. In BTPC, the quantized prediction errors are encoded using static Huffman coding. The ICT coder establishes a sorting order based on each pixel's context and applies the limited-order blocksort. The sorted error sequence is then compressed using compression methods developed for Burrows-Wheeler sorted output, such as MTF followed by arithmetic coding [3BW].