Package georegression.fitting.curves

Class FitCurve_F64

java.lang.Object

georegression.fitting.curves.FitCurve_F64

public class FitCurve_F64
extends Object

Fits different types of curves to points

Constructor Summary

Constructors

Constructor	Description
FitCurve_F64()

Method Summary

Modifier and Type	Method	Description
static boolean	fit(double[] data, int offset, int length, PolynomialQuadratic2D_F64 output)	Fits points to a 2D quadratic polynomial.
static boolean	fitMM(double[] data, int offset, int length, PolynomialCubic1D_F64 output, @Nullable org.ejml.data.DMatrix4x4 A)	Fits points to the cubic polynomial.
static boolean	fitMM(double[] data, int offset, int length, PolynomialQuadratic1D_F64 output, @Nullable org.ejml.data.DMatrix3x3 work)	Fits points to the quadratic polynomial.
static boolean	fitQRP(double[] data, int offset, int length, PolynomialQuadratic1D_F64 output)	Fits points to the quadratic polynomial using a QRP linear solver.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

FitCurve_F64

public FitCurve_F64()

Method Details

fitMM

public static boolean fitMM(double[] data,
 int offset,
 int length,
 PolynomialQuadratic1D_F64 output,
 @Nullable
 @Nullable org.ejml.data.DMatrix3x3 work)

Fits points to the quadratic polynomial. It's recommended that you apply a linear transform to the points to ensure that they have zero mean and a standard deviation of 1. Then reverse the transform on the result. A solution is found using the pseudo inverse and inverse by minor matrices.

For a more numerically stable algorithm see fitQRP(double[], int, int, PolynomialQuadratic1D_F64)

Parameters:

data - Interleaved data [input[0], output[0], ....

offset - first index in data

length - number of elements in data that are to be read. must be divisible by 2

output - (Optional) storage for the curve

Returns:

The fitted curve

fitQRP

public static boolean fitQRP(double[] data,
 int offset,
 int length,
 PolynomialQuadratic1D_F64 output)

Fits points to the quadratic polynomial using a QRP linear solver.

Parameters:

data - Interleaved data [input[0], output[0], ....

offset - first index in data

length - number of elements in data that are to be read. must be divisible by 2

output - (Optional) storage for the curve

Returns:

The fitted curve

See Also:

• FitPolynomialSolverTall_F64

fitMM

public static boolean fitMM(double[] data,
 int offset,
 int length,
 PolynomialCubic1D_F64 output,
 @Nullable
 @Nullable org.ejml.data.DMatrix4x4 A)

Fits points to the cubic polynomial. It's recommended that you apply a linear transform to the points to ensure that they have zero mean and a standard deviation of 1. Then reverse the transform on the result. A solution is found using the pseudo inverse and inverse by minor matrices.

For a more numerically stable algorithm see fitQRP(double[], int, int, PolynomialQuadratic1D_F64)

Parameters:

data - Interleaved data [input[0], output[0], ....

offset - first index in data

length - number of elements in data that are to be read. must be divisible by 2

output - (Optional) storage for the curve

Returns:

The fitted curve

fit

public static boolean fit(double[] data,
 int offset,
 int length,
 PolynomialQuadratic2D_F64 output)

Fits points to a 2D quadratic polynomial. There are two inputs and one output for each data point. It's recommended that you apply a linear transform to the points.

Parameters:

data - Interleaved data [inputA[0], inputB[0], output[0], ....

offset - first index in data

length - number of elements in data that are to be read. must be divisible by 2

output - (Optional) storage for the curve

Returns:

The fitted curve