#include <itkBSplineScatteredDataPointSetToImageFilter.h>
Given an n-D image with scattered data, this filter finds a fast approximation to that irregularly spaced data using uniform B-splines. The traditional method of inverting the observation matrix to find a least-squares fit is made obsolete. Therefore, memory issues are not a concern and inverting large matrices are unnecessary. The reference below gives the algorithm for 2-D images and cubic splines. This class generalizes that work to encompass n-D images and any *feasible* B-spline order.
In addition to specifying the input point set, one must specify the number of control points. If one wishes to use the multilevel component of this algorithm, one must also specify the number of levels in the hierarchy. If this is desired, the number of control points becomes the number of control points for the coarsest level. The algorithm then increases the number of control points at each level so that the B-spline n-D grid is refined to twice the previous level. The scattered data is specified by the pixel values.
Note that the specified number of control points must be > m_SplineOrder.
Contributed by Nicholas J. Tustison, James C. Gee in the Insight Journal paper: http://hdl.handle.net/1926/140