English

Image compression by rectangular wavelet transform

Computer Vision and Pattern Recognition 2007-05-23 v1

Abstract

We study image compression by a separable wavelet basis {ψ(2k1xi)ψ(2k2yj),\big\{\psi(2^{k_1}x-i)\psi(2^{k_2}y-j), ϕ(xi)ψ(2k2yj),\phi(x-i)\psi(2^{k_2}y-j), ψ(2k1(xi)ϕ(yj),\psi(2^{k_1}(x-i)\phi(y-j), ϕ(xi)ϕ(yi)},\phi(x-i)\phi(y-i)\big\}, where k1,k2Z+k_1, k_2 \in \mathbb{Z}_+; i,jZi,j\in\mathbb{Z}; and ϕ,ψ\phi,\psi are elements of a standard biorthogonal wavelet basis in L2(R)L_2(\mathbb{R}). Because k1k2k_1\ne k_2, the supports of the basis elements are rectangles, and the corresponding transform is known as the {\em rectangular wavelet transform}. We prove that if one-dimensional wavelet basis has MM dual vanishing moments then the rate of approximation by NN coefficients of rectangular wavelet transform is O(NMlogCN)\mathcal{O}(N^{-M}\log^C N) for functions with mixed derivative of order MM in each direction. The square wavelet transform yields the approximation rate is O(NM/2)\mathcal{O}(N^{-M/2}) for functions with all derivatives of the total order MM. Thus, the rectangular wavelet transform can outperform the square one if an image has a mixed derivative. We provide experimental comparison of image compression which shows that rectangular wavelet transform outperform the square one.

Cite

@article{arxiv.cs/0406008,
  title  = {Image compression by rectangular wavelet transform},
  author = {Vyacheslav Zavadsky},
  journal= {arXiv preprint arXiv:cs/0406008},
  year   = {2007}
}