Fast fractal image encoding based on mean deviation
Tao Xu · Jisuanji gongcheng yu sheji · 2008
One shortcoming of the baseline fractal algorithm is the excessive cost of time.A fast fractal encoding algorithm based on mean deviation is proposed.First,all the domain blocks are ordered by their mean deviation.Then,every range block is classified into smooth or non-smooth block according to its root mean square error.The mean is kept for every smooth range block.Every non-smooth range block searched for the best domain block in the vicinity of the nearest domain block in the sense of mean deviation,and an error threshold is used to control the searching area.The experimental results show that the proposed algorithm is much faster than the baseline fractal algorithm and better than the algorithm based on shape feature.