曲线的一类非线性多分辨率算法及其收敛性

在曲线的多分辨率分析基础上,构造了一种新的非线性三分多分辨率算法.并研究这个正则三分多分辨率算法的收敛性和稳定性,进一步,证明了小波参数的收敛性精密地依靠这个基本的多分辨率细分算法的收敛性.     

Analysis of a New Nonlinear Subdivision Scheme. Applications in Image Processing

A nonlinear multiresolution scheme within Harten's framework is presented, based on a new nonlinear, centered piecewise polynomial interpolation technique. Analytical properties of the resulting subdivision scheme, such as convergence, smoothness, and stability, are studied. The stability and the compression properties of the associated multiresolution transform are demonstrated on several numerical experiments on images.     

Analysis of a class of nonlinear subdivision schemes and associated multiresolution transforms

This paper is devoted to the convergence and stability analysis of a class of nonlinear subdivision schemes and associated multiresolution transforms. As soon as a nonlinear scheme can be written as a specific perturbation of a linear and convergent subdivision scheme, we show that if some contractivity properties are satisfied, then stability and convergence can be achieved. This approach is applied to various schemes, which give different new results. More precisely, we study uncentered Lagrange interpolatory linear schemes, WENO scheme (Liu et al., J Comput Phys 115:200–212, 1994), PPH and Power-P schemes (Amat and Liandrat, Appl Comput Harmon Anal 18(2):198–206, 2005; Serna and Marquina, J Comput Phys 194:632–658, 2004) and a nonlinear scheme using local spherical coordinates (Aspert et al., Comput Aided Geom Des 20:165–187, 2003). Finally, a stability proof is given for the multiresolution transform associated to a nonlinear scheme of Marinov et al. (2005).     

Regularity of multivariate vector subdivision schemes

In this paper we discuss methods for investigating the convergence of multivariate vector subdivision schemes and the regularity of the associated limit functions. Specifically, we consider difference vector subdivision schemes whose restricted contractivity determines the convergence of the original scheme and describes the connection between the regularity of the limit functions of the difference subdivision scheme and the original subdivision scheme.     

三进制Loop细分曲面的C~1连续性分析

本文利用计算机代数系统,通过对三进制Loop细分算法的细分矩阵和特征映射的构造与分析,证明Loop给出的掩模设计能够保证细分曲面在奇异点是C1连续的,还给出细分矩阵的次优势特征值的一个取值范围,在此范围内利用三进制Loop细分算法生成的细分曲面都是C1连续的.最后给出一种三进制Loop细分算法的新的边点掩模设计方法,在保证细分曲面是C1连续的前提下,比Loop给出的计算公式更简单,细分算法在奇异点附近收敛更快.     

Hermite subdivision on manifolds via parallel transport

We propose a new adaption of linear Hermite subdivision schemes to the manifold setting. Our construction is intrinsic, as it is based solely on geodesics and on the parallel transport operator of the manifold. The resulting nonlinear Hermite subdivision schemes are analyzed with respect to convergence and C ¹ smoothness. Similar to previous work on manifold-valued subdivision, this analysis is carried out by proving that a so-called proximity condition is fulfilled. This condition allows to conclude convergence and smoothness properties of the manifold-valued scheme from its linear counterpart, provided that the input data are dense enough. Therefore the main part of this paper is concerned with showing that our nonlinear Hermite scheme is “close enough”, i.e., in proximity, to the linear scheme it is derived from.     

Subdivision schemes inL p spaces

Subdivision schemes play an important role in computer graphics and wavelet analysis. In this paper we are mainly concerned with convergence of subdivision schemes inL _p spaces (1≤p≤∞). We characterize theL _p -convergence of a subdivision scheme in terms of thep-norm joint spectral radius of two matrices associated with the corresponding mask. We also discuss various properties of the limit function of a subdivision scheme, such as stability, linear independence, and smoothness.     

Noninterpolatory Hermite subdivision schemes

Bivariate interpolatory Hermite subdivision schemes have recently been applied to build free-form subdivision surfaces. It is well known to geometric modelling practitioners that interpolatory schemes typically lead to ``unfair" surfaces--surfaces with unwanted wiggles or undulations--and noninterpolatory (a.k.a. approximating in the CAGD community) schemes are much preferred in geometric modelling applications. In this article, we introduce, analyze and construct noninterpolatory Hermite subdivision schemes, a class of vector subdivision schemes which can be applied to iteratively refine Hermite data in a not necessarily interpolatory fashion. We also study symmetry properties of such subdivision schemes which are crucial for application in free-form subdivision surfaces.

A key step in our mathematical analysis of Hermite type subdivision schemes is that we make use of the strong convergence theory of refinement equations to convert a prescribed geometric condition on the subdivision scheme--namely, the subdivision scheme is of Hermite type--to an algebraic condition on the subdivision mask. The latter algebraic condition can then be used in a computational framework to construct specific schemes.

     

The template‐based procedure of biorthogonal ternary wavelets for curve multiresolution processing

Curve multiresolution processing techniques have been widely discussed in the study of subdivision schemes and many applications, such as surface progressive transmission and compression. The ternary subdivision scheme is the more appealing one because it can possess the symmetry, smaller topological support, and certain smoothness, simultaneously. So biorthogonal ternary wavelets are discussed in this paper, in which refinable functions are designed for cure and surface multiresolution processing of ternary subdivision schemes. Moreover, by the help of lifting techniques, the template‐based procedure is established for constructing ternary refinable systems with certain symmetry, and it also gives a clear geometric templates of corresponding multiresolution algorithms by several iterative steps. Some examples with certain smoothness are constructed.     

Convergent Vector and Hermite Subdivision Schemes

Hermite subdivision schemes have been studied by Merrien, Dyn, and Levin and they appear to be very different from subdivision schemes analyzed before since the rules depend on the subdivision level. As suggested by Dyn and Levin, it is possible to transform the initial scheme into a uniform stationary vector subdivision scheme which can be handled more easily.With this transformation, the study of convergence of Hermite subdivision schemes is reduced to that of vector stationary subdivision schemes. We propose a first criterion for C⁰-convergence for a large class of vector subdivision schemes. This gives a criterion for C¹-convergence of Hermite subdivision schemes. It can be noticed that these schemes do not have to be interpolatory. We conclude by investigating spectral properties of Hermite schemes and other necessary/sufficient conditions of convergence.     

On refinable functions and subdivision with positive masks

We consider aspects of the analysis of refinement equations with positive mask coefficients. First we derive, explicitly in terms of the mask, estimates for the geometric convergence rate of both the cascade algorithm and the corresponding subdivision scheme, as well as the Hölder continuity exponent of the resulting refinable function. Moreover, we show that the subdivision scheme converges for a class of unbounded initial sequences. Finally, we present a regularity result containing sufficient conditions on the mask for the refinable function to possess continuous derivatives up to a given order.     

A Necessary and Sufficient Proximity Condition for Smoothness Equivalence of Nonlinear Subdivision Schemes

In the recent literature on subdivision methods for approximation of manifold-valued data, a certain “proximity condition” comparing a nonlinear subdivision scheme to a linear subdivision scheme has proved to be a key analytic tool for analyzing regularity properties of the scheme. This proximity condition is now well known to be a sufficient condition for the nonlinear scheme to inherit the regularity of the corresponding linear scheme (this is called smoothness equivalence). Necessity, however, has remained an open problem. This paper introduces a smooth compatibility condition together with a new proximity condition (the differential proximity condition). The smooth compatibility condition makes precise the relation between nonlinear and linear subdivision schemes. It is shown that under the smooth compatibility condition, the differential proximity condition is both necessary and sufficient for smoothness equivalence. It is shown that the failure of the proximity condition corresponds to the presence of resonance terms in a certain discrete dynamical system derived from the nonlinear scheme. Such resonance terms are then shown to slow down the convergence rate relative to the convergence rate of the corresponding linear scheme. Finally, a super-convergence property of nonlinear subdivision schemes is used to conclude that the slowed decay causes a breakdown of smoothness. The proof of sufficiency relies on certain properties of the Taylor expansion of nonlinear subdivision schemes, which, in addition, explain why the differential proximity condition implies the proximity conditions that appear in previous work.     

On a nonlinear mean and its application to image compression using multiresolution schemes

This paper is devoted to the compression of colour images using a new nonlinear cell-average multiresolution scheme. The aim is to obtain similar compression properties as linear multiresolution schemes but eliminating the classical Gibbs phenomenon of this type of reconstructions near the edges. The algorithm is based on a nonlinear reconstruction operator (using a nonlinear trigonometric mean). The new reconstruction is third-order accurate in smooth regions and adapted to the presence of discontinuities. The data used are always centred with optimal support. Some theoretical properties of this scheme are analysed (order of approximation, convergence, elimination of Gibbs effect and stability).     

A Construction of Multiresolution Analysis on Interval

We present a concrete method of constructing multiresolution analysis on interval. The method generalizes the corresponding results of Cohen, Daubechies and Vial [Appl. Comput. Harmonic Anal., 1（1993）, 54-81]. By the use of the subdivision operator, the expressions of the constructed functions are more compact. Furthermore, the method reveals more clearly some properties of multiresolution analysis with certain approximation order.     

A Branch and Bound Algorithm for Separable Concave Programming

In this paper, we propose a new branch and bound algorithm for the solution of large scale separable concave programming problems. The largest distance bisection (LDB) technique is proposed to divide rectangle into sub-rectangles when one problem is branched into two subproblems. It is proved that the LDB method is a normal rectangle subdivision(NRS). Numerical tests on problems with dimensions from 100 to 10000 show that the proposed branch and bound algorithm is efficient for solving large scale separable concave programming problems, and convergence rate is faster than ω-subdivision method.     

Lp空间中重分算法的收敛性

§ 1　IntroductionThe nontrivial solution of the following refinement equation = αa(α)( 2 .-α) ( 1 )is called refinable.The sequence a is called the refinementmask.When the mask a is finite-ly supported on Zand αa(α) =2 ,itis well known thatthe refinementequation( 1 ) hasa unique compactly supported distribution solution satisfies^( 0 ) =1 ,where^denotes theFourier transform of.This solution is called the normalized solution of( 1 ) .In order to study the solution of the equ…     

Nonlinear Subdivision Schemes on Irregular Meshes

The present article deals with convergence and smoothness analysis of geometric, nonlinear subdivision schemes in the presence of extraordinary points. We discuss when the existence of a proximity condition between a linear scheme and its nonlinear analogue implies convergence of the nonlinear scheme (for dense enough input data). Furthermore, we obtain C ¹ smoothness of the nonlinear limit function in the vicinity of an extraordinary point over Reif’s characteristic parametrization. The results apply to the geometric analogues of well-known subdivision schemes such as Doo–Sabin or Catmull–Clark schemes.     

Analysis of some bivariate non-linear interpolatory subdivision schemes

This paper is devoted to the convergence analysis of a class of bivariate subdivision schemes that can be defined as a specific perturbation of a linear subdivision scheme. We study successively the univariate and bivariate case and apply the analysis to the so called Powerp scheme (Serna and Marquina, J Comput Phys 194:632–658, 2004).     

Multiresolution analyses originated from nonstationary subdivision schemes

We analyze the properties of a new class of totally positive refinable functions obtained from nonstationary subdivision schemes. We show that the corresponding system of the integer translates is linearly independent, satisfies a Whitney–Schoenberg condition, reproduces polynomials up to a certain degree and generates a multiresolution analysis. Finally, pre-wavelets and bases on the interval are constructed.     

From Hermite to stationary subdivision schemes in one and several variables

Vector and Hermite subdivision schemes both act on vector data, but since the latter one interprets the vectors as function values and consecutive derivatives they differ by the “renormalization” of the Hermite scheme in any step. In this paper we give an algebraic factorization method in one and several variables to relate any Hermite subdivision scheme that satisfies the so–called spectral condition to a vector subdivision scheme. These factorizations are natural extensions of the “zero at π” condition known for the masks of refinable functions. Moreover, we show how this factorization can be used to investigate different forms of convergence of the Hermite scheme and why the multivariate situation is conceptionally more intricate than the univariate one. Finally, we give some examples of such factorizations.