Abstract
Best lossless compression results of color map images have been obtained by dividing the color maps into layers, and by compressing the binary layers separately by using an optimized context tree model that exploits inter-layer dependencies. In this paper, we extend the previous context tree based method to operate on color values instead of the binary layers. We generate an n-ary context tree by constructing a complete tree up to a predefined depth, and then prune out nodes that do not provide improvement in compression to generate sub-optimal context tree with incomplete structure. Experiments show that the proposed method outperforms existing methods for a large set of different color map images.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
