A Fast Fractal Image Compression Method Based Entropy
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...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2005 |
| País: | España |
| Institución: | Universitat Autònoma de Barcelona |
| Repositorio: | Dipòsit Digital de Documents de la UAB |
| Idioma: | inglés |
| OAI Identifier: | oai:ddd.uab.cat:24315 |
| Acceso en línea: | https://ddd.uab.cat/record/24315 https://dx.doi.org/urn:doi:10.5565/rev/elcvia.82 |
| Access Level: | acceso abierto |
| Palabra clave: | Fractal Image Compression Complexity Reduction Entropy Compressió fractal d'imatges Reducció de la complexitat Entropia Compresión fractal de imágenes Reducción de la complejidad |
| Sumario: | 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. |
|---|