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%.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A Hierarchical Classification Matching Scheme for Fractal Image Compression


    Contributors:
    Xing, Cangju (author) / Ren, Yuan (author) / Li, Xuebin (author)


    Publication date :

    2008-05-01


    Size :

    1278550 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    DCT based simple classification scheme for fractal image compression

    Duh, D. J. / Jeng, J. H. / Chen, S. Y. | British Library Online Contents | 2005


    An Improved Fractal Image Compression Scheme Embedding DCT Encoder

    Yuxuan, R. / Nge, T. G. / Institution of Electrical Engineers et al. | British Library Conference Proceedings | 1999


    Fast classification method for fractal image compression [4122-18]

    Truong, T. K. / Jeng, J. H. / SPIE | British Library Conference Proceedings | 2000



    A Hybrid Image Compression Scheme using Block-Based Fractal Coding and DCT

    Farhadi, G. / IEEE / EURASIP | British Library Conference Proceedings | 2003