Abstract
image compression is a an active area of research with new promising technique that will work very effectively in areas where we have to deal with a huge size of data .In Fractal compression major challenge is the exhaustive comparison needed in the encoding stage. In this paper a method of iteration free- detail space fractal image compression is proposed, in which time of encoding is reduced without compromising much on the quality of image and this algorithm guarantees a high compression ratio. This is a hybrid algorithm of fractal mathematics and wavelet Transform. When comparing with the existing hybrid techniques the advantage of this proposed method is, only the approximation space undergoes exhaustive comparison and thereby it guarantees higher speed than the existing Hybrid techniques. IFS (Iterated function system) of detail space are calculated using the result of approximation space. Experimental results show that in the proposed method Computational over head is considerably reduced and maintains a good tradeoff between compression ratio and quality of image. Resultant image is resolution independent, which is the one of the properties of fractal image compression. Since this new technique guarantees, high compression ratio and low encoding time, it may work very well in mobile communication, especially in face book application.
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.
