Abstract
The model coefficients for the case of the non-orthogonal basis in Jacquin's mappings are contrast scaling and luminance offset. After orthogonalization, the model coefficients become range block mean and contrast scaling. These two fractal coding algorithms have the same encoding procedure except that luminance offset is replaced by range block mean, however, their decoding algorithms are different. In this paper, we prove that the orthogonal decoding algorithm converges faster than the non-orthogonal algorithm, while the two decoding algorithms produce the same iteration series if the initial image is the range-averaged image and the step size equals the side-length of the range block.
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.
