Hash-Like Fractal Image Compression with Linear Execution Time

The main computational cost in Fractal Image Analysis (FIC) comes from the required range-domain full block comparisons. In this work we propose a new algorithm for this comparison, in which actual full block comparison is preceded by a very fast hash–like search of those domains close to a given range block, resulting in a performance linear with respect to the number of pixels. Once the algorithm is detailed, its results will be compared against other state–of–the–art methods in FIC.

• Type: Conference
• Year: 2003
• Where: IBPRIA
• Authors: Kostadin Koroutchev, José R. Dorronsoro
• Keywords: Block Comparison, Fractal Image Analysis, IBPRIA 2003, Image Analysis, Main Computational Cost