• DocumentCode
    3273147
  • Title

    An improved fractal image coding based on the quadtree

  • Author

    Liu, Bohong ; Yan, Ying

  • Author_Institution
    Coll. of Comput. Sci. & Technol., Chongqing Univ. of Post & Telecommun., Chongqing, China
  • Volume
    2
  • fYear
    2010
  • fDate
    16-18 Oct. 2010
  • Firstpage
    529
  • Lastpage
    532
  • Abstract
    Fractal image coding based on quadtree is a novel technique for still image compression. Compared with other image compression methods, fractal image coding has the advantage of higher compression ratio, higher decoding speed and decoded image having nothing to do with the resolution of image. However, it spends too much time to look for the best matching Ri block on encoding. To improve the encoding speed, we must narrow the search range and improve the search skills to ensure the best match block falls within the range. In this paper, an improved fractal image compression algorithm based on quadtree is proposed. First, we improve the construction method of search attractor by constructing directly from the big Di, block, so it can save a lot of searching time in encoding. Second, the attractors can be self-constructed, so it is not happened that the attractor is not found in the traditional methods. Experimental result shows that the algorithm makes image coding faster and more efficiency.
  • Keywords
    image coding; image resolution; quadtrees; decoding speed; encoding speed; fractal image coding; image resolution; quadtree; still image compression; Classification algorithms; Decoding; Encoding; Fractals; Image coding; Image segmentation; Reflection; coding; fractal; image compression; quadtree;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Image and Signal Processing (CISP), 2010 3rd International Congress on
  • Conference_Location
    Yantai
  • Print_ISBN
    978-1-4244-6513-2
  • Type

    conf

  • DOI
    10.1109/CISP.2010.5647658
  • Filename
    5647658