Answers are grounded in this paper and cite their sources.
A new algorithm for fractal compression of greyscale images is presented. It uses some previous results allowing the compression process to be reduced to a nearest neighbors problem, and is essentially based on a geometrical partition of the image block feature space. Experimental comparisons with previously published methods show a significant improvement in speed with no quality loss.
No takes yet. Share an insight, caveat, or question.
Jean Cardinal (2001) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: