A reduced domain pool based on DCT for a fast fractal image encoding
Fractal image compression is time consuming due to the search of the matching between range and domain blocks. In order to improve this compression method, we propose firstly, in this paper, a fast method for reducing the computational complexity of fractal encoding by reducing the size of the domai...
| Autores: | , , |
|---|---|
| Tipo de documento: | artigo |
| Data de publicação: | 2011 |
| País: | España |
| Recursos: | Universitat Autònoma de Barcelona |
| Repositório: | Dipòsit Digital de Documents de la UAB |
| Idioma: | inglês |
| OAI Identifier: | oai:ddd.uab.cat:86362 |
| Acesso em linha: | https://ddd.uab.cat/record/86362 https://dx.doi.org/urn:doi:10.5565/rev/elcvia.389 |
| Access Level: | Acceso aberto |
| Palavra-chave: | Fractal image compression Complexity reduction DCT SSIM index |
| Resumo: | Fractal image compression is time consuming due to the search of the matching between range and domain blocks. In order to improve this compression method, we propose firstly, in this paper, a fast method for reducing the computational complexity of fractal encoding by reducing the size of the domain pool. This reduction is based on the lowest horizontal and vertical DCT coefficients of domain blocks. The experimental results on the test images show that the proposed method reduce the time computation and reach a high speedup factor without decreasing the image quality. Secondly, we combine our method to the AP2D approach which uses two domain pools in two steps of encoding. A more reduction of encoding time is obtained without decreasing the image quality. |
|---|