Classification of Refinable Splines

A refinable spline is a compactly supported refinable function that is piecewise polynomial. Refinable splines, such as the well-known B-splines, play a key role in computer aided geometric design. So far all studies on refinable splines have focused on positive integer dilations and integer translations, and under this setting a rather complete classification was obtained in [12]. However, refinable splines do not have to have integer dilations and integer translations. The classification of refinable splines with noninteger dilations and arbitrary translations is studied in this paper. We classify completely all refinable splines with integer translations and arbitrary dilations. Our study involves techniques from number theory and complex analysis.     

Uniform and refinable grids on elliptic domains and on some surfaces of revolution

We construct a bijection from R² to R², which maps rectangles centered at the origin O onto ellipses centered at O, and preserves area. This bijection allows us to construct uniform and refinable grids on elliptic domains. Then, we combine a particular case of this bijection (i.e. that bijection that maps squares into circles) with another area preserving projection from R² to a surface of revolution around Oz. This yields uniform and refinable grids on this surface of revolution. The lines of these grids are situated in horizontal planes, if they are images of squares centered at O. We consider the particular case of the hemisphere and show how the northern hemisphere of the Earth is projected onto a square. Thus, our equiareal maps can be useful for constructing geographical maps of one hemisphere of the Earth onto rectangles.     

一类二维非可分细分函数的正则性估计

设Ｍ-细分函数用于对应于二维图像处理中梅花状子取样的小波基的构造．本文用迹类算子的谱半径给出了具有指数衰减面具的Ｍ-细分函数Ｓｏｂｏｌｅｖ-指数的一个估计.     

Numerical evaluation of new quadrature rules using refinable operators

This paper concerns the construction of quadrature rules based on the use of suitable refinable quasi-interpolatory operators introduced here. Convergence analysis of the obtained quadrature rules is developed and numerical examples are included.     

The refinability of step functions

Refinable functions have been widely investigated because of their importance in wavelet theory and multiresolution analysis, as well as because of intrinsic interest. Problems involving refinability can be challenging and interesting problems in mathematics. Several papers have investigated refinability of splines and other classes of functions. The purpose of this paper is to develop necessary and sufficient conditions for the refinability of the class of step functions on the real line taking complex values.

     

球形阵列自适应网格分层定位算法

刚性球形传声器阵列可以在无空间模糊的条件下进行球谐域数据处理,基于球形阵列的可控波束形成器导向响应功率(SRP)算法定位精度高,但是计算量大,计算效率低。通过将球面致密的全局网格搜索替换为分层搜索策略可以有效减小SRP算法的计算量。提出MRE-SRP算法保持球形阵列SRP定位精度的同时降低计算量,首先通过球谐域MUSIC(SH-MUSIC)算法判断入射声源的数量减小搜索区域;其次将相对熵模型引入球谐域SRP(SH-SRP)定位算法中,提取网格分层前后的信息增益,设计自适应网格选择判据,实现分层多分辨率网格的精准再细分,从而降低计算量。实验验证了所提出算法的性能,结果显示在单双声源定位中,该算法可以实现较高的定位精度,精准选择分层网格,计算量减少75%以上。     

Pointwise convergence of bounded cascade sequences

The cascade algorithm plays an important role in computer graphics and wavelet analysis. For an initial function , a cascade sequence is constructed by the iteration where is defined by In this paper, under a condition that the sequence is bounded in , we prove that the following three statements are equivalent: (i) converges . (ii) For , there exist a positive constant and a constant such that (iii) For some converges in . An example is presented to illustrate our result.

     

A construction of interpolating wavelets on invariant sets

We introduce the concept of a refinable set relative to a family of contractive mappings on a metric space, and demonstrate how such sets are useful to recursively construct interpolants which have a multiscale structure. The notion of a refinable set parallels that of a refinable function, which is the basis of wavelet construction. The interpolation points we recursively generate from a refinable set by a set-theoretic multiresolution are analogous to multiresolution for functions used in wavelet construction. We then use this recursive structure for the points to construct multiscale interpolants. Several concrete examples of refinable sets which can be used for generating interpolatory wavelets are included.

     

A new cross subdivision scheme for surface design

In this paper, a new primal approximation -subdivision scheme for surface design, being named the cross scheme or C-scheme for short, is presented. The C²-continuity of the C-scheme is mathematically analyzed. The new scheme can be effectively applied to any 3D mesh of quadrilaterals. Extraordinary vertices and miscellaneous boundary scenarios are handled as well. Extensive implementation shows that it performs better than the classical Catmull-Clark subdivision scheme both at nearby vertices and along the non-vertical and non-horizontal directions.