期刊名称:ELCVIA: electronic letters on computer vision and image analysis
印刷版ISSN:1577-5097
出版年度:2005
卷号:5
期号:1
页码:30-40
DOI:10.5565/rev/elcvia.82
出版社:Centre de Visió per Computador
摘要:Fractal image compression gives some desirable properties like resolution independence, fast decoding, and very competitive rate-distortion curves. But still suffers from a (sometimes very) high encoding time, depending on the approach being used. This paper presents a method to reduce the encoding time of this technique by reducing the size of the domain pool based on the Entropy value of each domain block. Experimental results on standard images show that the proposed method yields superior performance over conventional fractal encoding.
其他摘要:Fractal image compression gives some desirable properties like resolution independence, fast decoding, and very competitive rate-distortion curves. But still suffers from a (sometimes very) high encoding time, depending on the approach being used. This paper presents a method to reduce the encoding time of this technique by reducing the size of the domain pool based on the Entropy value of each domain block. Experimental results on standard images show that the proposed method yields superior performance over conventional fractal encoding. keywords: image compression, Fractal image compression, Complexity Reduction, Entropy