Abstract
Fractal image coding processing searches for the best matching domain block, by pattern matching out of the domain pool that divided into plurality. For this reason, we propose an improvement of the construction of a domain pool from the viewpoint of processing time shortening. By the conventional method, a pattern index is valued by pulling the average value of every block from a pixel value, and domain pools are divided with the pattern matching which settles by its' value becomes positive or negative. On the other hand, proposed method pulls average value from the pixel value, furthermore, the value called distributed pattern block is pulled to calculate pattern index. With the result of a simulation experiment, it is shown that the amount of calculation is reduced sharply.
