• DocumentCode
    1333864
  • Title

    A fast encoding algorithm for fractal image compression using the DCT inner product

  • Author

    Truong, Trieu-Kien ; Jeng, Jyh-Horng ; Reed, Irving S. ; Lee, P.C. ; Li, Alan Q.

  • Author_Institution
    Coll. of Electr. & Inf. Eng., I-Shou Univ., Taiwan
  • Volume
    9
  • Issue
    4
  • fYear
    2000
  • fDate
    4/1/2000 12:00:00 AM
  • Firstpage
    529
  • Lastpage
    535
  • Abstract
    In this paper, a fast encoding algorithm is developed for fractal image compression. At each search entry in the domain pool, the mean square error (MSE) calculations of the given range block and the eight dihedral symmetries of the domain block are obtained simultaneously in the frequency domain, in which the redundant computations are all eliminated in the new encoding algorithm. It is shown in software simulation that the encoding time is about six times faster than that of the baseline method with almost the same PSNR for the retrieved image. The fast algorithm is performed to deal with the eight dihedral symmetries at each search entry. Therefore, it can be applied to various enhanced algorithms which are equipped with quadtree, classification, and other mechanisms
  • Keywords
    data compression; discrete cosine transforms; fractals; image coding; least mean squares methods; transform coding; DCT inner product; MSE; coding time; dihedral symmetries; domain block; enhanced algorithms; fast encoding algorithm; fractal image compression; frequency domain; mean square error calculations; range block; redundant computations; search entry; Classification algorithms; Computational modeling; Discrete cosine transforms; Fractals; Frequency domain analysis; Image coding; Iterative algorithms; Mean square error methods; Partitioning algorithms; Transform coding;
  • fLanguage
    English
  • Journal_Title
    Image Processing, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1057-7149
  • Type

    jour

  • DOI
    10.1109/83.841930
  • Filename
    841930