Abstract
The paper analyzes the weakness of traditional speed-up techniques of fractal image compression. Moreover, it presents a novel idea that entropy can be used to improve fractal image compression's performances. It has proofed a theorem that the IFS cannot change the entropy values of image blocks. Therefore, it gives two novel fractal compression algorithms based on entropy. The simulation results illuminate that new methods can improve the compression's performances. © Springer-Verlag Berlin Heidelberg 2003.
Cite
CITATION STYLE
Tan, Y., & Zhou, X. (2003). A novel speed-up algorithm of fractal image compression. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2834, 582–589. https://doi.org/10.1007/978-3-540-39425-9_68
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
