Abstract

Fractal image compression is an innovative way of image representation by using relationships among the sub-section of image itself. It utilizes the existence of self-symmetry and uses affine contractive transforms. This technique has manifold advantages like, very high compression ratio, high decompression speed, high bit-rate and resolution independence, but high computation time expenses of suitable domain search in coding phase is the major bottleneck of the technique. This paper presents a fast fractal compression scheme based on feature extraction and innovative way of image comparison. In proposed development the complexity of suitable domain search is reduced by transforming the problem from image domain to vector domain. Simulation results confirms that suggested variant leads to a faster system as compared to existing state-of art Fractal Image Compression techniques.

Full Text
Published version (Free)

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 call