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

• Published in: IEEE transactions on image processing Vol. 9; no. 4; pp. 529 - 535
• Main Authors: Trieu-Kien Truong, Jyh-Horng Jeng, Reed, I.S., Lee, P.C., Li, A.Q.
• Format: Journal Article
• Language: English
• Published: New York, NY IEEE 01.04.2000; Institute of Electrical and Electronics Engineers; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithms; Classification algorithms; Computational modeling; Computers in experimental physics; Discrete cosine transforms; Encoding; Exact sciences and technology; Fractal analysis; Fractals; Frequency domain analysis; Fundamental areas of phenomenology (including applications); Image coding; Image compression; Image processing; Imaging and optical processing; Instruments, apparatus, components and techniques common to several branches of physics and astronomy; Iterative algorithms; Mean square error methods; Optics; Partitioning algorithms; Physics; Searching; Symmetry; Transform coding; Image processing; Computer software; Redundancy; Data compression; Quadtrees; Fractal system; Frequency domain method; Encoding; Experimental study; Cosine transform; Mean square error; Classification; Fast algorithm; Symmetry
• ISSN: 1057-7149; 1941-0042
• DOI: 10.1109/83.841930

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.