Abstract
The baseline fractal image compression algorithm requires a great deal of time to complete the encoding process.In order to solve this problem,an efficient fractal image compression based on pixels distribution and triangular segmentation was proposed in this paper.Exploiting the characteristics of centroid uniqueness and centriod position invariance in discrete particulate system,the matching between range blocks and domain blocks was implemented.In addition,dividing original image into isosceles right triangles segmentation could reduce the number of domain blocks,and raise the efficiency of fractal coding.Experimental results show that the proposed algorithm can produce reconstructed images with good quality and require one third time of the baseline encoding algorithm.
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.
