多结点样条插值及其多尺度细化算法

针对风线与曲面拟事问题，研究多结点样条插值方法。这类方法具有基数型，显式计算及局部性等优点。主要的新结果是：对多结点样条基本函数的构造给出了新的表述；提出了一类新的不带移动的混合形多结点样条基本函数；基于多尺度分析的思想，给出了一种自适应的细化算法，它对消减采样数据的相关性是简便有效的。     

基于局部梯度特征的自适应多结点样条图像插值

为了获得质量更好的插值图像，提出了一种新的C^2。连续的支撑区间为（-2，2）的三次多结点样条插值核函数．通过增加结点带来的自由度构造了多结点样条插值公式；分析了在适当的边界条件和约束下三次多结点样条插值的逼近阶；将一维多结点样条插值算法推广到二维，建立了用于图像数据的插值公式；如果忽视图像的局部特征，通常双三次多结点样条插值图像的边缘会有模糊的现象，为此。对多结点样条插值应用逆梯度，得到了自适应多结点样条插值算法；实验所得误差图像和实验所得图像的峰值信噪比也证实了用自适应多结点样条插值算法重建的图像具有更高的质量．     

有理多结点样条插值曲线及曲面

鉴于多结点样条曲线（MSIC）是一种点点通过的插值样条曲线,因此在多结点样条插值曲线研究的基础上,给出了有理多结点条插值曲线和有理多结点样条插值曲面的定义,并讨论了有理多结点样条的性质,对有理多结 样条曲线和有理多结点样条曲面的光滑拼接问题进行了讨论,此外,还对有理多结点样条在计算机辅助几何设计中的若干应用问题进行了说明。     

图像插值的多结点样条技术

为了获得质量更好的插值图像,提出了用具有紧支集的多结点样条基函数来进行图像插值的新技术,并首先将1维的多结点样条插值算法推广到2维,建立了用于图像数据的插值公式;然后分析了多结点样条插值方法的逼近精度、正则性、插值核函数的频域特性.对逼近精度、正则性、插值核函数频域特性的比较表明,该插值方法优于传统的三次卷积插值方法,实验结果也证实了用多结点样条插值算法重建的图像具有更高的质量.     

基于多结点样条插值的几何造型修补方法

针对历史文物几何建模中的问题,提出了一种基于多结点样条的几何建模修补方法.利用多结点样条插值的局部插值显式特性,对立体视觉摄像系统基于图像的几何建模中形成的＂空洞＂,可通过多结点样条插值算法将＂空洞＂填补起来,对有破损的陶器类文物的几何建模也可通过多结点样条插值算法进行修补.     

带切向控制的多结点曲线造型方法

在普通的多结点样条中加入相当于导数条件的可控参数，通过调节这些参数控制插值曲线在各型值点的切向量，从而达到满意的曲线造型效果．该方法保持了多结点样条的优越性（基数型，局部性），因此可以只对插值曲线作局部调整而不影响整体，有助于计算机辅助几何设计领域的工程人员设计、调整曲线的形状．     

基于多结点样条磨光函数的几何迭代法

几何迭代法在计算机辅助几何设计(CAGD)中有广泛地应用,为了提高传统的 B-样 条曲线插值在几何迭代中的收敛速度和迭代精度,提出了基于多结点样条磨光函数的几何迭代 法,引入多结点样条磨光函数,在曲线拟合时把多结点样条磨光方法和几何迭代方法结合,经过 磨光和迭代,在 L-BFGS 迭代算法的最优解下构造具有高逼近性的曲线拟合方法。实验结果表明, 在相同精度下,该方法不仅减少了迭代次数,且提高了迭代速度,可以用于飞机、汽车等外形设 计上,亦可用于文物、房屋等外形重构和重建,以及卫星图形图像的处理中。     

基于多结点样条的自由曲线最小误差逼近及其应用

多结点样条函数具有良好的局部性,而最小二乘法对数据拟合的全局性较好, 因此多结点样条函数最小二乘逼近的稳定性及数值精度都能得到有效的保证。该文综合两者的特点,实现了自由曲线离散数据最小逼近误差数学模型的建立。同时应用此数学模型于一些平面及空间（甚至一些带噪音的）自由曲线拟合上和几何造型骨骼化上,测试其对各种自由曲线的拟合效果,结果证明最小逼近效果明显。     

带参数的多结点样条

多结点样条函数是在通常样条函数中引入更多的附加结点，其优越性表现在使插值过程无须求解任何方程组，而且有局部性，对多结点样条函数做进一步研究，构造了一类带参数的多结点样条基本函数．该类函数不仅保持了一般多结点样条函数的优点，而且由于参数的引进，使得基数型的插值公式可形成一族，可以根据实际问题的需要在函数(曲线)族中作出最优选择．文中研究的带参数的多结点样条函数，除了能用于表达平滑的数据及几何造型之外。尤其能适应波动较大、频率较高的数据拟合问题，有助于解决信号处理及非规则几何造型的一些问题。     

结点插值新算法

结点插值算法广泛应用开发系统样条曲线、曲面的生成表示和求交分类。本文给出的结点插值新算法不仅可以统一表示已知的Boehm算法和Oslo算法,而且算法效率上优于它们。本算法已用于三维几何造型系统GEMS中。     

Free knot splines for logistic models and threshold selection

The logistic regression model has been in use in statistical analysis for many years. The paper introduces a spline model to remove the linear restriction on logit function. By considering knot locations as free variables, spline approximation of data is improved. The number of knots and the degree of the spline functions can still be determined by using a model selection procedure. Moreover, a knot, seen as a free parameter for a piecewise linear spline, represents a break point in the logit function which may be interpreted as a threshold value. This method is applied to a clinical trial for an in vitro fertilization program.     

Knot calculation for spline fitting via sparse optimization

Curve fitting with splines is a fundamental problem in computer-aided design and engineering. However, how to choose the number of knots and how to place the knots in spline fitting remain a difficult issue. This paper presents a framework for computing knots (including the number and positions) in curve fitting based on a sparse optimization model. The framework consists of two steps: first, from a dense initial knot vector, a set of active knots is selected at which certain order derivative of the spline is discontinuous by solving a sparse optimization problem; second, we further remove redundant knots and adjust the positions of active knots to obtain the final knot vector. Our experiments show that the approximation spline curve obtained by our approach has less number of knots compared to existing methods. Particularly, when the data points are sampled dense enough from a spline, our algorithm can recover the ground truth knot vector and reproduce the spline.     

一种B样条表面插值控制点的缩减方法

研究了从给定节点向量中选择节点进行B样条曲线插值的方法，并将此方法应用到行数据点不相同的B样条曲面插值，得到了一个通过对行节点矢量调整传递的曲面插值方法，理论分析和实验表明该方法可大量减少曲面控制点的数目．     

A simple,efficient degree raising algorithm for B-spline curves

This paper presents a new algorithm to compute the degree-raised version of a spline. The new algorithm is as fast as the best existing algorithm, but is much easier to understand and to implement. The new control vertices of the degree-raised spline are obtained simply by a series of knot insertions followed by a series of knot deletions.     

Approximation and estimation bounds for free knot splines

The fitting to data by splines has long been known to improve dramatically if the knots can be adjusted adaptively. To demonstrate the quality of the obtained free knot spline, it is essential to characterize its generalization ability. By utilizing the powerful techniques of the empirical process and approximation theory to address the estimation and approximation error bounds, respectively, the generalization ability of the free knot spline learning strategy is successfully characterized. We show that the Pseudo-dimension of free knot splines is essentially a linear function of the number of knots. A class of rather general loss functions is considered here and the squared loss is specially treated for its excellent property. We also provide some numerical results to demonstrate the utility of these theoretical results in guiding the process of choosing the appropriate knot numbers through the training data to avoid the overfitting/underfitting problem.     

高精度三次参数样条曲线的构造

构造参数样条曲线的关键是选取节点，该文讨论了GC^2三次参数样条曲线需满足的连续性方程，提出了构造GC^2三次参数样条曲线的新方法，在讨论了平面有序五点确定一组三次多项式函数曲线，平面有序六点唯一确定一条三次多项式函数曲线的基础上，提出了计算相邻两区间上的节点的算法，构造的插值曲线具有三次多项式函数精,该文还以实例对新方法与其它方法构造的插值曲线的精度进行了比较。     

Data based segmentation and summarization for sensor data in semiconductor manufacturing

In semiconductor manufacturing processes, sensor data are segmented and summarized in order to reduce storage space. This is conventionally done by segmenting the data based on predefined chamber step information and calculating statistics within the segments. However, segmentation via chamber steps often do not coincide with actual change points in data, which results in suboptimal summarization. This paper proposes a novel framework using abnormal difference and free knot spline with knot removal, to detect actual data change points and summarize on them. Preliminary experiments demonstrate that the proposed algorithm handles arbitrarily shaped data in a robust fashion and shows better performance than chamber step based segmentation and summarization. An evaluation metric based on linearity and parsimony is also proposed.