The Sobolev Regularity of Refinable Functions

By Amos Ron, Zuowei Shen. 2000

72 citations recorded by the source corpus.

Refinable functions underlie the theory and constructions of wavelet systems on the one hand and the theory and convergence analysis of uniform subdivision algorithms on the other. The regularity of such functions dictates, in the context of wavelets, the smoothness of the derived wavelet system and, in the subdivision context, the smoothness of the limiting surface of the iterative process. Since the refinable function is, in many circumstances, not known analytically, the analysis of its regularity must be based on the explicitly known mask. We establish in this paper a formula that computes, for isotropic dilation and in any number of variables, the sharp L"2-regularity of the refinable function @f in terms of the spectral radius of the restriction of the associated transfer operator to a specific invariant subspace. For a compactly supported refinable function @f, the relevant invariant space is proved to be finite dimensional and is completely characterized in terms of the dependence relations among the shifts of @f together with the polynomials that these shifts reproduce. The previously known formula for this compact support case requires the further assumptions that the mask is finitely supported and that the shifts of @f are stable. Adopting a stability assumption (but without assuming the finiteness of the mask), we derive that known formula from our general one. Moreover, we show that in the absence of stability, the lower bound provided by that previously known formula may be abysmal. Our characterization is further extended to the FSI (i.e., vector) case, to the unisotropic dilation matrix case, and to even snore general setups. We also establish corresponding results for refinable distributions.

Subfields: Biomedical Engineering, Computational Mechanics, Computer Vision and Pattern Recognition

View Paper: https://www.semanticscholar.org/paper/b9a5fa299a422cc8f062f9185e33195dbaa46b2e

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Biomedical Engineering

  1. Bin Dong
  2. Zuowei Shen

In Computational Mechanics

  1. Bin Dong
  2. Zuowei Shen
  3. Bin Han
  4. Jian-Feng Cai
  5. Stanley J. Osher
  6. Zhouchen Lin
  7. Yi Ma
  8. Jieping Ye

In Computer Vision and Pattern Recognition

  1. Bin Han
  2. Zuowei Shen
  3. Bin Dong
  4. Jian-Feng Cai
  5. Ivan W. Selesnick
  6. Martin Ehler
  7. Stanley J. Osher
  8. Jianwei Ma

Citations in the corpus