Abstract
This paper introduces a new lossy approach for compression of cartoon images. The image is firstly partitioned into regions of roughly the same colour. The chain codes are then determined of all regions. The sequence of the obtained chain code symbols is transformed with the Burrows-Wheeler Transform, Move-To-Front transform, and compressed with Run-Length Encoding. In the final step, an arithmetic encoder may be used to compress the obtained binary stream additionally. The proposed algorithm is asymmetric, meaning that the decompression does not reverse all the steps of the compression procedure. The experimental results have shown that the described method produces considerably better compression ratios than JPEG, JPEG2000, WebP, SPIHT, PNG, and two of the algorithms specialised in compression of cartoon images: the algorithm using quad-tree, and RS-LZ algorithm.
Highlights
Image compression is a widely researched area with a huge amount of developed methods
Vertex Chain Code moves along vertices that connect 4 neighbouring cells and encodes the number of pixels belonging to the region
The features of the algorithm are compared with the PNG [3], RS-LZ [9], WebP [12], SPIHT [13], the Quad-tree approach [20], as well as with the image compression standards JPEG [23] and JPEG2000 [17]
Summary
Image compression is a widely researched area with a huge amount of developed methods. In 2006, Tsai et al presented a quasi-lossless method for compressing cartoon images using quad-trees [20]. Multimedia Tools and Applications (2020) 79:433–451 small regions Another lossless compression method, named RS-LZ, was developed by Li et al [9]. A promising research was done by Taylor in 2011 [18] He introduced a lossy compression algorithm, which takes into account small colour differences between neighbouring pixels, and a quantization procedure for small details/noise. A new lossy method for cartoon image compression, named Chain Code Cartoon Compression (4C), is proposed in this paper. The proposed method produces better compression ratios than the referenced algorithms. The chain codes of all regions are concatenated, and Burrows-Wheeler Transform (BWT), Move-to-Front Transform (MTF), and Run-Length Encoding (RLE) are applied to the resulting chain.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
