AN EFFICIENT ALGORITHM FOR IMAGE COMPRESSION

In recent years, the development and demand of multimedia product grows increasingly fast, contributing to insufficient bandwidth of network and storage of memory device. Therefore, the theory of data compression becomes more and more significant for reducing the data redundancy to save more hardware space and transmission bandwidth. In computer science and information theory, data compression or source coding is the process of encoding information using fewer bits or other information-bearing units than an unencoded representation. Compression is useful because it helps reduce the consumption of expensive resources such as hard disk space or transmission bandwidth. In project, a spatial domain image compression algorithm is proposed. This algorithm is based on the prediction of each pixel from the previous ones. The errors of the predicted values are encoded using a set of logarithmically distributed possible values, which are called hops. The performance of our algorithm is remarkable when compared to an algorithm in [4] and shows much better quality, in terms of PSNR than an algorithm in [4]