Adaptive Greedy Algorithm Realized by Wavelet Transform in Image Compression

This paper deals with the realization of the adaptive greedy algorithm in image compression by wavelet transform. The greedy algorithm is based on the hypothesis that the finite terms satisfying certain conditions can be found in infinite terms. Hence, generally speaking, this algorithm has no maneuverability. In this paper, utilizing two-dimensional wavelet transform, the greedy algorithm based on image compression is realized. Moreover, the effects on the images compressed by this algorithm and by the traditional multilevel algorithm are compared. The simulation results show that the effect of the greedy algorithm for compressing image excels that of the traditional multilevel algorithm.