Ten Lectures on Wavelets

In this chapter we have studied in some depth the reconstruction of f from the sequence
, where ? m,n( x) = a ? m/2 0 ?( a ? m 0 x ? nb 0) (and variations thereof see 3.3.4). We have seen that numerically stable reconstruction is only possible if the ? m,n constitute a frame, and we have derived a reconstruction formula if the ? m,n are a frame. One can, however, use other reconstruction formulas (provided the ? m,n do constitute a frame: the necessity of that condition remains!). To conclude this chapter, let me sketch the approach of S. Mallat, which addresses moreover the problem of shift-invariance.
The discrete wavelet transform, such as I have described it in this chapter, is highly non-invariant under translations. By this I mean that two functions may be shifted versions of each other, while their wavelet coefficients may be very different. This is already illustrated by the "hyperbolic lattice" [17] in Figure 1.4a, where the axis t = 0 plays a unique role. In practice one does not use an infinite number of scales, but cuts off very low and very high frequencies: only those m for which m 1 ? m ? m 0 are used. The resulting truncated lattice is then invariant under translations by b 02 m 0 (choose a 0 = 2 for simplicity), which is, however,...