Constructs the coefficient vector that implements a Savitzky-Golay smoothing filter
when used with the MovingWindowFilter class. The algorithm is also known by
the terms, least-squares, or DIgital Smoothing POlynomial (DISPO).
The filter coefficients, c(n) are chosen so as to approximate the
underlying function in the window [i - nL, i + nR] with a polynomial, typically
quadratic or quartic, and replace the point f(i) with
the value of the approximating polynomial at i. The polynomial is fit using
a least squares algorithm.
Namespace:
CenterSpace.NMath.Core
Assembly:
NMath (in NMath.dll) Version: 5.1.0.0
Syntax
| C# |
|---|
public static DoubleVector SavitzkyGolayCoefficients(
int numberLeft,
int numberRight,
int polynomialDegree
) |
| Visual Basic (Declaration) |
|---|
Public Shared Function SavitzkyGolayCoefficients ( _
numberLeft As Integer, _
numberRight As Integer, _
polynomialDegree As Integer _
) As DoubleVector |
| Visual C++ |
|---|
public:
static DoubleVector^ SavitzkyGolayCoefficients(
int numberLeft,
int numberRight,
int polynomialDegree
) |
Parameters
- numberLeft
- Type: System..::.Int32
>Number of points to the left in the window.
- numberRight
- Type: System..::.Int32
Number of points to the right in the window.
- polynomialDegree
- Type: System..::.Int32
Degree of the smoothing polynomial. Typically between 3 and 8.
Return Value
See Also