Changes between Version 3 and Version 4 of ThinPlateShell
 Timestamp:
 Dec 8, 2014, 1:15:08 AM (9 years ago)
Legend:
 Unmodified
 Added
 Removed
 Modified

ThinPlateShell
v3 v4 1 1 = '''Thin Plate Shell interpolation''' = 2 2 3 3 Interpolation/smoothing is an important aspect of PIV. Linear interpolation is the simplest option but it cannot smooth noise, and for 2D (or 3D) fields it does not extrapolate data beyond the convex hull of the initial data set. Global polynomial interpolation generally produce excessive smoothing, for low order polynomials, or spurious oscillations, for high order polynomials. Cubic spline is an optimum general method to interpolate a 1D data series $f_{i}$ measured at a set of abscissa $x_{i},i=1,\ldots,N.$ The spline interpolation function $f(x)$ is made of piecewise cubic polynomials matched at the measurement abscissa $x_{i}$ by the condition $f(x_{i})=f_{i} $, with the continuity of the first derivative. It can be shown that this spline function minimizes the global curvature $\int_{x_{1}}^{x_{N}}f''(x)^{2}dx$ . The name 'spline' refers to a flexible wooden strip used in ship design to draw a smooth curved line pinned on a set of reference points. Its equilibrium shape indeed minimizes the elastic energy. This is proportional to the integral of $f''^{2}$ if it represents a small transverse displacement from the absissa line. … … 7 7 Generalisation to multidimensional spaces can be performed as products of spline functions along each coordinate. However this choice is not optimum and depends on the coordinate axis. The proper generalisation is the ’thin plate spline’ proposed by Duchon[Duchon]. The name refers to a physical analogy with the bending of a thin sheet of metal. Practical algorithms have been first developed by Pahia Montes .It has been first used in the field of cartography and first applied to flow measurements by NguyenDuc and Sommeria(..). We use here a more recent algorithm proposed by Wahba, 1990, rely on the standard inversion matrix functions provided by Matlab. 8 8 9 = Case of pure interpolation=9 = Case of pure interpolation = 10 10 We consider a set of measurement points ${\bf r_i}, i = 1,2, \ldots,N$, and the corresponding set of measurements values for a quantity $f$ (a velocity component for PIV data). 11 11 $$ … … 57 57 the sources $S_i$ are obtained by solving the matrix equation $ F=S*M$. 58 58 59 {{{Smoothing interpolation}}} 59 = Smoothing interpolation = 60 60 61 61 To account for measurement noise, interpolation should involve smoothing, so that the interpolated data can deviate from the measurement at the measurement sites $r_i$. This can be performed by minimising a linear combination of the elastic energy and the quadratic deviation to the measurement values … … 74 74 where $I_{000}$ is the NxN identity matrix extended by three columns of 0. 75 75 76 = spatial derivatives=76 = Spatial derivatives = 77 77 Spatial derivatives of the interpolated quantity $f$ can be obtained by direct differentiation of the result. 78 78 For any function $\phi(r)$, with radial distance $r={\bf rr_i}$, $r^2=X^2+Y^2$, $\partial_X \phi=(d\phi/dr) \partial_X r$, and $\partial_X r=X/r$. This yields $\partial_X \phi=X (2 \log(r) +1)$, so that, … … 81 81 $$\partial_y f({\bf r})=\sum S_i (2 \log{\bf rr_i}+1)(yy_i)+a_2;$$ 82 82 83 = Subdomains=83 = Subdomains = 84 84 The computing cost and memory required to invert the matrix [>equ. 9] increases as the cube of the number of measurement points, so that large data sets need to be partitioned in subdomains. The interpolation is made independently in each subdomain. If subdomain overlap, the average of the different answers is taken. 85 85