Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
158 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Quasi-tight Framelets with Directionality or High Vanishing Moments Derived from Arbitrary Refinable Functions (1806.05241v1)

Published 13 Jun 2018 in cs.IT and math.IT

Abstract: Construction of multivariate tight framelets is known to be a challenging problem. Multivariate dual framelets with vanishing moments generalize tight framelets and are not easy to be constructed either. Compactly supported multivariate framelets with directionality or high vanishing moments are of interest and importance in both theory and applications. In this paper we introduce the notion of a quasi-tight framelet, which is a dual framelet, but behaves almost like a tight framelet. Let $\phi\in L_2(Rd)$ be an arbitrary compactly supported $M$-refinable function such that its underlying low-pass filter satisfies the basic sum rule. We first constructively prove by a step-by-step algorithm that we can always easily derive from the arbitrary $M$-refinable function $\phi$ a directional compactly supported quasi-tight $M$-framelet in $L_2(Rd)$ associated with a directional quasi-tight $M$-framelet filter bank, each of whose high-pass filters has only two nonzero coefficients with opposite signs. If in addition all the coefficients of its low-pass filter are nonnegative, such a quasi-tight $M$-framelet becomes a directional tight $M$-framelet in $L_2(Rd)$. Furthermore, we show by a constructive algorithm that we can always derive from the arbitrary $M$-refinable function $\phi$ a compactly supported quasi-tight $M$-framelet in $L_2(Rd)$ with the highest possible order of vanishing moments. We shall also present a result on quasi-tight framelets whose associated high-pass filters are purely differencing filters with the highest order of vanishing moments. Several examples will be provided to illustrate our main theoretical results and algorithms in this paper.

Citations (1)

Summary

We haven't generated a summary for this paper yet.