public class IntegerBootstrapping extends LambdaMethod
This method is really faster for integer ambiguity resolution than LAMBDA or MLAMBDA method but its success rate is really smaller. The method extends LambdaMethod as it uses LDL' factorization and reduction methods from LAMBDA method. The method is really different from LAMBDA as the solution found is not a least-square solution. It is a solution which asses a probability of success of the solution found. The probability increase with the does with LDL' factorization and reduction methods.
If one want to use this method for integer ambiguity resolution, one just need to construct IntegerBootstrapping only with a double which is the minimal probability of success one wants. Then from it, one can call the solveILS method.
Constructor and Description |
---|
IntegerBootstrapping(double prob)
Constructor for the bootstrapping ambiguity estimator.
|
Modifier and Type | Method and Description |
---|---|
protected void |
discreteSearch()
Compute the solution by the bootstrap method from equation (13) in
P.J.G.
|
protected IntegerLeastSquareSolution[] |
recoverAmbiguities()
Recover ambiguities prior to the Z-transformation.
|
inverseDecomposition, ltdlDecomposition, reduction
addSolution, getDecorrelatedReference, getDiagReference, getLowReference, getMaxDistance, getMaxSolution, getSize, getSolutionsSize, getZInverseTransformationReference, integerGaussTransformation, lIndex, permutation, removeSolution, setComparator, solveILS, zIndex
public IntegerBootstrapping(double prob)
prob
- minimum probability acceptance for the bootstrapprotected void discreteSearch()
discreteSearch
in class LambdaMethod
protected IntegerLeastSquareSolution[] recoverAmbiguities()
recoverAmbiguities
in class AbstractLambdaMethod
Copyright © 2002-2021 CS GROUP. All rights reserved.