A hierarchical classification matching scheme for fractal image compression is proposed in this paper. This scheme reduces the encoding time dramatically by partitioning the domain pools hierarchically. Experimental results on standard gray scale image show that the hierarchical classification matching scheme yields much better performance over other classification matching scheme. Compared with Fisher’s quadtree method, the encoding time of the proposed algorithm for Lena reduces by 84.07% in average, while the compression ratio increases by 14.56% and the PSNR of the reconstructed image is also increased by 3.23%.
A Hierarchical Classification Matching Scheme for Fractal Image Compression
2008 Congress on Image and Signal Processing ; 1 ; 283-286
2008-05-01
1278550 byte
Conference paper
Electronic Resource
English
DCT based simple classification scheme for fractal image compression
British Library Online Contents | 2005
|An Improved Fractal Image Compression Scheme Embedding DCT Encoder
British Library Conference Proceedings | 1999
|Fast classification method for fractal image compression [4122-18]
British Library Conference Proceedings | 2000
|A Hybrid Image Compression Scheme using Block-Based Fractal Coding and DCT
British Library Conference Proceedings | 2003
|