A geometric approach to the cascade approximation operator for wavelets

Abstract

This paper is devoted to an approximation problem for operators in Hilbert space, that appears when one tries to study geometrically the cascade algorithm in wavelet theory. Let H be a Hilbert space, and let π be a representation of L∞(T) on H . Let R be a positive operator in L∞(T) such that R(1)=1 , where 1 denotes the constant function 1 . We study operators M on H (bounded, but non-contractive) such that π(f)M=Mπ(f(z2)) and M* π(f)M=π(R* f) , f ∈ L∞ (T) , where the * refers to Hilbert space adjoint. We give a complete orthogonal expansion of H which reduces π such that M acts as a shift on one part, and the residual part is H(∞)=n[Mn H] , where [Mn H] is the closure of the range of Mn . The shift part is present, we show, if and only if (M*) ≠ \0\ . We apply the operator-theoretic results to the refinement operator (or cascade algorithm) from wavelet theory. Using the representation π , we show that, for this wavelet operator M , the components in the decomposition are unitarily, and canonically, equivalent to spaces L2(En) ⊂ L2(R) , where En ⊂ R , n=0,1,2,...,∞ , are measurable subsets which form a tiling of R ; i.e., the union is R up to zero measure, and pairwise intersections of different En 's have measure zero. We prove two results on the convergence of the cascade algorithm, and identify singular vectors for the starting point of the algorithm.

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…