next up previous contents
Next: Background estimate by filtering Up: Background Definition Previous: Bivariate polynomial interpolation

Smoothing spline interpolation

An alternative method performs the interpolation of interorder background using smoothing spline polynomials. Spline interpolation consists of the approximation of a function by means of series of polynomials over adjacent intervals with continuous derivatives at the end-point of the intervals. Smoothing spline interpolation enables to control the variance of the residuals over the data set, as follows:


\begin{displaymath}\delta = \sum_{i=1}^{m} (y_i - \hat y_i)^{2} \end{displaymath}

where yi is the ith observed value and \( \hat y_i \) the ith interpolated value is the sum of the squared residuals and the smoothing spline algorithm will try to fit a solution such as:

\begin{displaymath}\delta \le S*\alpha \end{displaymath}

where S is the smoothing factor and \( \alpha=0.001 \) is the tolerance.

One must retain two particular values of S:

The solution is estimated by an iterative process. Smoothing spline interpolation is designed to smooth data sets which are mildly contaminated with isolated errors. Convergence is not always secured for this class of algorithms, which on the other hand enables to control the residuals. The median of pixel values in a window surrounding the background reference position is computed before spline interpolation. The size of the window (session keyword BKGRAD) is defined along the orders and along the columns of the raw spectrum.


next up previous contents
Next: Background estimate by filtering Up: Background Definition Previous: Bivariate polynomial interpolation
http://www.eso.org/midas/midas-support.html
1999-06-15