Related papers: Smooth supersaturated models
Detecting slender, overlapping structures remains a challenge in computational microscopy. While recent coordinate-based approaches improve detection, they often produce less accurate splines than pixel-based methods. We introduce a…
This paper discusses the dimension of spline spaces with highest order smoothness over hierarchical T-meshes over certain type of hierarchical T-meshes. The major step is to set up a bijection between the spline space with highest order…
Given a system of triangles in the plane $\mathbb{R}^2$ along with given data of function and gradient values at the vertices, we describe the general pattern of local linear methods invoving only four smooth standard shape functions which…
The goal of this paper is to design compact support basis spline functions that best approximate a given filter (e.g., an ideal Lowpass filter). The optimum function is found by minimizing the least square problem ($\ell$2 norm of the…
Using a deterministic framework allows us to estimate a function with the purpose of interpolating data in spatial statistics. Radial basis functions are commonly used for scattered data interpolation in a d-dimensional space, however,…
This article presents a new mathematical framework to perform statistical analysis on time-indexed sequences of 2D or 3D shapes. At the core of this statistical analysis is the task of time interpolation of such data. Current models in use…
The paper motivates high dimensional smoothing with penalized splines and its numerical calculation in an efficient way. If smoothing is carried out over three or more covariates the classical tensor product spline bases explode in their…
M-type smoothing splines are a broad class of spline estimators that include the popular least-squares smoothing spline but also spline estimators that are less susceptible to outlying observations and model-misspecification. However,…
Polynomial splines are ubiquitous in the fields of computer aided geometric design and computational analysis. Splines on T-meshes, especially, have the potential to be incredibly versatile since local mesh adaptivity enables efficient…
The method of constructing spline classes in the form of trigonometric Fourier series whose coefficients have a certain decreasing order are considered. in turn, this decrement determines the number of continuous derivatives of sum of this…
A cutting-plane model for a nonsmooth function is the maximum of several first-order expansions centered at different points. Using such a model in a bundle method leads to linear convergence (of serious steps) to a minimum. In smooth…
It is well-known that univariate cubic spline interpolation, if carried out on point sets with fill distance $h$, converges only like ${\cal O}(h^2)$ in $L_2[a,b]$ for functions in $W_2^2[a,b]$ if no additional assumptions are made. But…
This paper develops a unified theoretical framework for constructing B-spline basis function spaces with structural equivalence to finite element spaces. The theory rigorously establishes that these bases emerge as explicit linear…
In applications that involve interactive curve and surface modeling, the intuitive manipulation of shapes is crucial. For instance, user interaction is facilitated if a geometrical object can be manipulated through control points that…
Rescaled spike and slab models are a new Bayesian variable selection method for linear regression models. In high dimensional orthogonal settings such models have been shown to possess optimal model selection properties. We review…
This paper deals with Hermite osculatory interpolating splines. For a partition of a real interval endowed with a refinement consisting in dividing each subinterval into two small subintervals, we consider a space of smooth splines with…
A "blendstring" is a piecewise polynomial interpolant with high-degree two-point Hermite interpolational polynomials on each piece, analogous to a cubic spline. Blendstrings are smoother and can be more accurate than cubic splines, and can…
A new efficient orthogonalization of the B-spline basis is proposed and contrasted with some previous orthogonalized methods. The resulting orthogonal basis of splines is best visualized as a net of functions rather than a sequence of them.…
Observations made in continuous time are often irregular and contain the missing values across different channels. One approach to handle the missing data is imputing it using splines, by fitting the piecewise polynomials to the observed…
In this paper, a method is proposed to solve the problem of monotone smoothing splines using general linear systems. This problem, also called monotone control theoretic splines, has been solved only when the curve generator is modeled by…