A Fast Fractal Image Compression Algorithm Based on K-mean Clustering Optimization
Mingyan Jiang · Journal of Electrical & Electronic Education · 2006
Range and domain blocks are clustered by using K-mean clustering method,and range blocks search domain blocks in the same category,which can shorten encoding time significantly.The encoding speed of our method is about 5 times faster than that of the classical Jacquin's algorithm,and the quality of the decoding images can be retained as well when the compression ratio is fixed.We also tested some other fast encoding schemes based on variance,and the experimental results show that our algorithms are superior to them.