Searchless Fractal Image Compression Using Fast DCT and Real DCT

Abstract

Growing need for pictorial data in information era makes image storage and transmission very expensive. Fast algorithms to compress visual information without degrading the quality are of utmost importance. To overcome this problem, this paper proposes new methods to reduce the encoding time for no search fractal image compression in DCT domain by curtailing the computational complexity of the discrete cosine transform (DCT) equations. Fast DCT and real DCT are the techniques, which are employed for the purpose of increasing the performance of searchless DCT. FDCT uses the concept of fast Fourier transform (FFT) which acts as fast discrete cosine transform (FDCT). Real DCT performs only real calculations and omits the imaginary complexity of the DCT. Proposed methods perform the calculations involved in DCT to be computed faster while keeping the quality of the image as much as nearly possible. Furthermore, the experimental results specified show the effectiveness of the methods being proposed for grayscale images.