A Fast Fractal Image Compression Using the Improved K-mean Clustering

Xiang Wang · 2008

How to import the advanced theory of K-mean clustering into the domain of fractal image encoding is a hotspot research in national academia.In this paper,the selection of initial clustering center for K-Means clustering is analyzed,an new initial clustering center selection based on average value and variance is given,and a novel fast fractal image coding method is proposed.Experimental results show that the proposed coding is a fast and efficient image compression scheme;it can considerably shorten the encoding time,while achieving the same or better decoded image quality.[JP

Read the paper · More papers on PaperTik