Image compression by rectangular wavelet transform

Abstract

We study image compression by a separable wavelet basis \(2k1x-i)(2k2y-j), φ(x-i)(2k2y-j), (2k1(x-i)φ(y-j), φ(x-i)φ(y-i)\, where k1, k2 ∈ Z+; i,j∈Z; and φ, are elements of a standard biorthogonal wavelet basis in L2(R). Because k1 k2, the supports of the basis elements are rectangles, and the corresponding transform is known as the rectangular wavelet transform. We prove that if one-dimensional wavelet basis has M dual vanishing moments then the rate of approximation by N coefficients of rectangular wavelet transform is O(N-MC N) for functions with mixed derivative of order M in each direction. The square wavelet transform yields the approximation rate is O(N-M/2) for functions with all derivatives of the total order M. 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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…