Polyharmonic spline

Polyharmonic spline

In mathematics, polyharmonic splines are used for
function approximation and data interpolation.They are very useful for interpolation of scattered datain many dimensions.

Polyharmonic splines are a special case of radial basis functions andare defined as a linear combination of non-linear basis functions phi(.) that depend only on distancestogether with a low order polynomial (for notational simplicity, in thesequel only linear polynomials are treated):

y(mathbf{x}) , = , sum_{i=1}^N w_i , phi(||mathbf{x} - mathbf{c}_i||) + mathbf{v}^T , egin{bmatrix} 1 \\ mathbf{x} end{bmatrix}

where



thumb|350px|right|Polyharmonic basis functions
* mathbf{x} = [x_1, x_2, cdots, x_{nx}] ^T is a real-valued vector of nx independent variables,
* mathbf{c}_i = [c_{1,i}, c_{2,i}, cdots, c_{nx,i}] ^T are N vectors of the same size as mathbf{x} (often called center).
* mathbf{w} = [w_1, w_2, cdots, w_N] ^T are the N weights of the basis functions.
* mathbf{v} = [v_1, v_2, cdots, v_{nx+1}] ^T are the nx+1 weights of the polynomial.
* The linear polynomial with the weighting factors mathbf{v} improves the interpolation close to the "boundary" and expecially the extrapolation "outside" of the centers mathbf{c}_i. If this is not desired, this term can also be removed (see also figure) below.

The basis functions of polyharmonic splines are radial basis functions of the form:

egin{matrix} phi(r) = egin{cases} r^k & mbox{with } k=1,3,5,dots, \\ r^k ln(r) & mbox{with } k=2,4,6,dots end{cases} \\ [5mm] r = ||mathbf{x} - mathbf{c}_i||_2 = sqrt{ (mathbf{x} - mathbf{c}_i)^T , (mathbf{x} - mathbf{c}_i) } end{matrix}

Other values of exponent k are not useful (such as phi(r) = r^2 ),because a solution of the interpolation problem might nolonger exist. To avoid problems at r=0 (since ln(0) = -∞), the polyharmonic splines with the natural logarithm might be implemented as:

phi(r) = egin{cases} r^{k-1} ln(r^r) & mbox{for } r < 1 \\ r^k ln(r) & mbox{for } r ge 1 end{cases}

The weights w_i and v_j are determined such that the functionpasses through N given points(mathbf{c}_i, y_i) (i=1,2,...,N) and fulfill the nx+1 orthogonality conditions:

0 = sum_{i=1}^N w_i, ;; 0 = sum_{i=1}^N w_i , c_{j,i} ;;; (j=1,2,...,nx)

In order to compute the weights, a symmetric, linear system of equations has to besolved:

egin{bmatrix} mathbf{A} & mathbf{V}^T \\ mathbf{V} & mathbf{0} end{bmatrix};egin{bmatrix} mathbf{w} \\ mathbf{v}end{bmatrix} ; = ; egin{bmatrix} mathbf{y} \\ mathbf{0}end{bmatrix};;;;

where

A_{i,j} = phi(||mathbf{c}_i - mathbf{c}_j||), ;;; mathbf{V} = egin{bmatrix} 1 & 1 & cdots & 1 \\ mathbf{c}_1 & mathbf{c}_2 & cdots & mathbf{c}_{nx} end{bmatrix}, ;;; mathbf{y} = [y_1, y_2, cdots, y_N] ^T

Under very mild conditions (essentially, that at least nx+1 pointsare not in a subspace; e.g. for nx=2 that at least 3 points are noton a straight line), the system matrix of the linear system of equationsis positiv definite and therefore a unique solution of the equation systemexists.

Once the weights are determined, interpolation requires to just evaluate thetop most formula for the provided mathbf{x}.

The main advantage of polyharmonic spline interpolation isthat usually very good interpolationresults are obtained for scattered data without performing any "tuning", so automatic interpolation is feasible. This is not the case forother radial basis functions. For example, the Gaussian function(e^{-kcdot r^2}) needs to be tuned, so that k is selectedaccording to the underlying grid of the independent variables. If this gridis non-uniform, a proper selection of k is difficult or impossible, in orderto achieve a good interpolation result.

The main disadvantages are

* In order to determine the weights, a linear system of equations has to be solved, which is non-sparse. The solution of a non-sparse linear system becomes no longer practical if the dimension n is larger as about 1000 (since the storage requirements are O(n2) and the number of operations to solve the linear system is O(n3). For example n=10000 requires about 100 Mbyte of storage and 1000 Gflops of operations).

* In order to perform the interpolation of M data points, operations in the order of O(M*N) are needed. In many applications, like image processing, M is much larger as N, and if both numbers are large, this is no longer practical.

Recently, methods have been developed to overcome the mentioned difficulties,see, e.g., [http://imajna.oxfordjournals.org/cgi/content/short/27/3/427 (Beatson et.al. 2006)]


frame|none|Interpolation with different polyharmonic splines that shall pass the 4 predefined points marked by a circle (the interpolation with phi = r">2 is not useful, since the linear equation system of the interpolation problem has no solution; it is solved in a least squaressense, but then does not pass the centers)

The figure shows the interpolation through four points (marked by "circles") using different types of polyharmonic splines. The "curvature" of the interpolated curves grows with the order of the spline and the extrapolation at the left boundary (x < 0) is reasonable. The figure also includes the radial basis functions phi = exp(-r2) which gives a good interpolation as well. Finally, the figure includes alsothe non-polyharmonic spline phi = r2 to demonstrate, that thisradial basis function is not able to pass through the predefined points(the linear equation has no solution and is solved in a least squares sense).

The figure shows the same interpolation as in the first figure, with the only exception that the points to be interpolated are scaled by a factor of 100 (and the case phi = r2 is no longer included). Since phi = (scale*r)k =(scalek)*rk, the factor (scalek) can be extracted from matrix A of the linear equation system and therefore the solution is not influenced by the scaling. This is different for the logarithmic form of the spline, although the scaling has not much influence. This analysis is reflected in the figure, where the interpolation shows not much differences. Note, for other radial basis functions, such as phi = exp(-k*r2) with k=1, the interpolation is no longer reasonable and it would be necessary to adapt k.

The figure shows the same interpolation as in the first figure, withthe only exception that the polynomial term of the function is nottaken into account (and the case phi = r2 is no longer included). As can be seen from the figure, the extrapolation for x < 0 is no longer as "natural" as in the first figure for some of the basis functions. This indicates, that the polynomial term is useful if extrapolation occurs.

ee also

*Radial basis function
*Subdivision surface (emerging alternative to spline-based surfaces)
*Spline
*Thin plate spline (a special case of a polyharmonic spline)

References

* Beatson R.K., Powell M.J.D., and Tan A.M. (2006): [http://imajna.oxfordjournals.org/cgi/content/short/27/3/427 Fast evaluation of polyharmonic splines in three dimensions] .
* Fasshauer G.F. (2007): [http://books.google.com/books?id=gtqBdMEqryEC Meshfree Approximation Methods with MATLAB] . World Scientific Publishing Company, ISPN-10: 9812706348
* Iske A. (2004): [http://www.springeronline.com/sgw/cda/frontpage/0,10735,5-10042-22-22344683-0,00.html Multiresolution Methods in Scattered Data Modelling] , Lecture Notes in Computational Science and Engineering, Vol. 37, ISBN 3-540-20479-2, Springer-Verlag, Heidelberg.
* Scott A. Sarra (2006): "Integrated Multiquadric Radial Basis Function Approximation Methods", "Computers and Mathematics with Applications", vol. 51, no. 8, pp. 1283–1296.


Wikimedia Foundation. 2010.

Игры ⚽ Поможем решить контрольную работу

Look at other dictionaries:

  • Thin plate spline — This is a brief derivation for the closed form solutions for smoothing Thin Plate Spline . Details about these splines can be found in (Wahba, 1990).Thin plate splines (TPS) were introduced to geometric design by Duchon (Duchon, 1976). The name… …   Wikipedia

  • List of numerical analysis topics — This is a list of numerical analysis topics, by Wikipedia page. Contents 1 General 2 Error 3 Elementary and special functions 4 Numerical linear algebra …   Wikipedia

  • Multivariate interpolation — In numerical analysis, multivariate interpolation or spatial interpolation is interpolation on functions of more than one variable. The function to be interpolated is known at given points and the interpolation problem consist of yielding values… …   Wikipedia

  • Radial basis function — A radial basis function (RBF) is a real valued function whose value depends only on the distance from the origin, so that phi(mathbf{x}) = phi(||mathbf{x}||); or alternatively on the distance from some other point c , called a center , so that… …   Wikipedia

  • List of mathematics articles (P) — NOTOC P P = NP problem P adic analysis P adic number P adic order P compact group P group P² irreducible P Laplacian P matrix P rep P value P vector P y method Pacific Journal of Mathematics Package merge algorithm Packed storage matrix Packing… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”