1 / 11

Progressive decoding method for fractal image compression

This paper introduces a novel progressive decoding scheme for fractal image compression. The method is based on a new fixed-point iteration theorem, offering a controllable decoding approach. Experimental results show its effectiveness compared to existing schemes. The proposed method utilizes a sequence {λn} with λn values between 0 and 1, enhancing compression efficiency and image quality.

rosendop
Download Presentation

Progressive decoding method for fractal image compression

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Progressive decoding method for fractal image compression • Sourcs: IEE Proc.-Vis. Image Signal Process., Vol. 151, No. 3, June 2004 • Authurs: C. He, S.X. Yang and X. Huang • Presented by: Shih-Chang.Chang • Date: 4/21 2005

  2. Outline • Introduction • fractal image compression • decoding scheme • Experimental results • Conclusion

  3. Introduction • a novel progressive decoding scheme is proposed for fractal image compression, which is based on a new fixed-point iteration theorem. In particular, the existing decoding scheme is a special case of the proposed controllable decoding scheme when its control parameter is set as one.

  4. fractal image compression(cont.) γi λi ti=γi。λi

  5. fractal image compression(cont.) • Ri：finite non-overlapping partition of the original image μorg into range blocks. • Di：the domain Di is typically twice the range side length. • ti：an elementary block mapping from the domain block Di to the range block Ri by ti=γi。λi.

  6. decoding scheme(cont.) • Exist • μn+1=T(μn) ,n=0,1,2….. • Propose • μn+1=(1-λ) μn+ λT(μn), λ=(0,1]

  7. decoding scheme(cont.) exist Propose

  8. Experimental results(cont.)

  9. Experimental results(cont.)

  10. Experimental results(cont.)

  11. Conclusion • The existing decoding scheme is a special case of the proposed decoding scheme. • Increasing sequence {λn} with 0<λn ≦1 is used,instead of the constant parameterλ.

More Related