From a theoretical perspective, the interpolating procedure takes place in two parts: the first is an estimate of the linear coefficients of a spline function is derived from the observation points using a least squares regression; the second is the computation of the interpolated surface (or interpolated vector points). As used here, the splines are 2D piece-wise non-zero polynomial functions calculated within a limited, 2D area. The length of each spline step is defined by sie for the east-west direction and sin for the north-south direction. For optimum performance, the length of spline step should be no less than the distance between observation points. Each vector point observation is modeled as a linear function of the non-zero splines in the area around the observation. The least squares regression predicts the the coefficients of these linear functions. Regularization, avoids the need to have one one observation and one coefficient for each spline (in order to avoid instability).
With regularly distributed data points, a spline step corresponding to the maximum distance between two points in both the east and north directions is sufficient. But often data points are not regularly distributed and require statistial regularization or estimation. In such cases, v.surf.bspline will attempt to minimize the gradient of bilinear splines or the curvature of bicubic splines in areas lacking point observations. As a general rule, spline step length should be greater than the mean distance between observation points (twice the distance between points is a good starting point). Separate east-west and north-south spline step length arguments allows the user to account for some degree of anisotropy in the distribution of observation points. Short spline step lengths--especially spline step lengths that are less than the distance between observation points--can greatly increase processing time.
Moreover, the maximum number of splines for each direction at each time is fixed, regardless of the spline step length. As the total number of splines used increases (i.e., with small spline step lengths), the region is automatically into subregions for interpolation. Each subregion can contain no more than 150x150 splines. To avoid subregion boundary problems, subregions are created to partially overlap each other. A weighted mean of observations, based on point locations, is calculated within each subregion.
The Tykhonov regularization parameter ("lambda_i") acts to smooth the interpolation. With a small lambda_i, the interpolated surface closely follows observation points; a larger value will produce a smoother interpolation.
The input can be a 2D pr 3D vector points map. If "layer =" 0 the z-value of a 3D map is used for interpolation. If layer > 0, the user must specify an attribute column to used for interpolation using the "column=" argument (2D or 3D map).
v.surf.bspline can produce a raster OR a vector output (NOT simultaneously). However, a vector output cannot be obtained using the default GRASS DBF driver.
If output is a vector points map and a "sparse=" vector points map is not specified, the output vector map will contain points at the same locations as observation points in the input map, but the values of the output points are interpolated values. If instead a "sparse=" vector points map is specified, the output vector map will contain points at the same locations as the sparse vector map points, and values will be those of the interpolated raster surface at those points.
A cross validation "leave-one-out" analysis is available to help to determine the optimal lambda_i value that produces an interpolation that best fits the original observation data. The more points used for cross-validation, the longer the time needed for computation. Empirical testing indicates a threshold of a maximum of 100 points is recommended. Note that cross validation can run very slowly if more than 100 observations are used. The cross-validation output reports mean and rms of the residuals from the true point value and the estimated from the interpolation for a fixed series of lambda_i values. No vector nor raster output will be created when cross-validation is selected.
v.surf.bspline input=point_vector output=interpolate_surface method=bicubic
v.surf.bspline input=point_vector raster=interpolate_surface sie=25 sin=25
v.surf.bspline -c input=point_vector
v.surf.bspline input=point_vector sparse=sparse_points output=interpolate_surface
v.surf.bspline input=point_vector raster=interpolate_surface layer=1 column=attrib_column
In order to avoid RAM memory problems, an auxiliary table is needed for recording some intermediate calculations. This requires the "GROUP BY" SQL function is used, which is not supported by the "dbf" driver. For this reason, vector map output "output=" is not permitted with the DBF driver. There are no problems with the raster map output from the DBF driver.
Update for GRASS 6.X and improvements:
Brovelli M. A. and Cannata M., 2004, Digital Terrain model reconstruction in urban areas from airborne laser scanning data: the method and an example for Pavia (Northern Italy). Computers and Geosciences 30, pp.325-331
Brovelli M. A e Longoni U.M., 2003, Software per il filtraggio di dati LIDAR, Rivista dell'Agenzia del Territorio, n. 3-2003, pp. 11-22 (ISSN 1593-2192)
Antolin R. and Brovelli M.A., 2007, LiDAR data Filtering with GRASS GIS for the
Determination of Digital Terrain Models. Proceedings of Jornadas de SIG Libre,
Girona, España. CD ISBN: 978-84-690-3886-9
Last changed: $Date: 2011-06-28 14:42:04 -0700 (Tue, 28 Jun 2011) $
Main index - vector index - Full index
© 2003-2012 GRASS Development Team