.png){kind=icon}
.png){kind=icon}
Return
A past encoding algorithm for fractal image compression using the DCT inner product
.png){kind=icon}
PRE
AI
DOI：10.1109/83.841930.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 sis 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 mechanism.
Keywords:
contractive mapping
discrete cosine transform
fractal transform coding
iterative function system
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
13.7
Papers:
1.0W
Citations:
8.4W
Organization
No organization information available