Fast Fractal Image Compression in DCT Domain

摘要

The idea of fractal image compression is based on assumption that the image redundancies can be efficiently exploited by means of block self-affined transformations. Fractal image compression has high computational complexity, its performance can be improved in DCT domain, but its computational complexity increases with additional two dimensional DCT. Flat block is introduced to reduce the computational complexity of the encoder in DCT domain. The block whose energy concentrated highly is called the flat block. These blocks are directly coded instead of doing block match. The simulations show that this method reduces the complexity with low bitrate.