login

Regularity of refinable function vectors

Journal of Fourier Analysis and ApplicationsPublished 1 May 1997
Albert Cohen, Ingrid Daubechies, Gerlind Plonka
Citations121
SJR quartileQ1
SJR score0.74
SNIP1.15

TL;DR

The results on decay are used to prove uniqueness of solutions and convergence of the cascade algorithm and the existence and regularity of compactly supported solutions of vector refinement equations.

Abstract

We study the existence and regularity of compactly supported solutions φ = (φv) v= /r− of vector refinement equations. The space spanned by the translates of φv can only provide approximation order if the refinement maskP has certain particular factorization properties. We show, how the factorization ofP can lead to decay of |̸v(u)| as |u| → ∞. The results on decay are used to prove uniqueness of solutions and convergence of the cascade algorithm.

Keywords

Computer ScienceEngineering