Image compression based on unrestrained sized wavelet transform

In this paper, we adopt a wavelet decomposition scheme that doesn´t require 2^N size image and avoid data padding. Instead of tree-structure coding algorithms, we just apply scalar quantization and arithmetic coding to every sub-band separately after wavelet transformation. The optimized bit-rates for every sub-band are confirmed by the BFOS algorithm. The experiment shows that this scheme can perform as well as the sophisticated algorithm SPIHT and it has the new property of resolution progressive.