Abstract
This paper presents new partitioning methods for image compression using different image quality measures, which are improvements of the recently published Binary Tree Triangular Coding (BTTC) algorithm. The technique is based on recursive partitioning of the image domain into right-angled triangles arranged in a binary tree. All the partitioning methods proposed in this paper execute in O( n log n ) time for encoding and θ ( n ) time for decoding, where n is the number of pixels in the image. Simulation results on standard test images show that the new methods produce significant improvement in quality as compared with conventional BTTC for comparable compression ratios.
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.
