The two-dimensional fast wavelet transform is similar to the pyramidal coding scheme of Se...

The two-dimensional fast wavelet transform is similar to the pyramidal coding scheme of Section 7.2.1. How are they similar? Given the three-scale wavelet transform in Fig. 7.10(a), how would you construct the corresponding approximation pyramid? How many levels would it have?

FIGURE 7.10 (a) A discrete wavelet transform using Haar H2 basis functions. Its local histogram variations are also shown. (b)–(d) Several different Approximations (64 × 64, 128 × 128, and 256 × 256) that can be obtained from (a).