Basic Image AlgorithmS Library  2.8.0
 All Classes Namespaces Functions Variables Typedefs Enumerations Enumerator Friends Groups Pages
Public Attributes | List of all members
BIAS::PreemptiveRANSAC< SolutionType >::SolStruct Struct Reference

#include <MathAlgo/PreemptiveRANSAC.hh>

+ Collaboration diagram for BIAS::PreemptiveRANSAC< SolutionType >::SolStruct:

Public Attributes

unsigned eval_index
 evaluation of the solution has taken place up to eval_index More...
 
std::vector< bool > inliers
 inlier indicator for the data in the order given by _EvaluationOrder i.e. More...
 
unsigned num_inliers
 
bool refined
 has a refined version of this solution lareday be added? More...
 
double score
 
SolutionType solution
 

Detailed Description

template<class SolutionType>
struct BIAS::PreemptiveRANSAC< SolutionType >::SolStruct

Definition at line 168 of file PreemptiveRANSAC.hh.

Member Data Documentation

template<class SolutionType>
unsigned BIAS::PreemptiveRANSAC< SolutionType >::SolStruct::eval_index
template<class SolutionType>
std::vector<bool> BIAS::PreemptiveRANSAC< SolutionType >::SolStruct::inliers

inlier indicator for the data in the order given by _EvaluationOrder i.e.

inliers[i] indicates if data[_EvaluationOrder[i]] is an inlier

Definition at line 178 of file PreemptiveRANSAC.hh.

Referenced by BIAS::PreemptiveRANSAC< SolutionType >::AddSolutionGuesses(), BIAS::PreemptiveRANSAC< SolutionType >::GenerateRefinedSolutions_(), BIAS::PreemptiveRANSAC< SolutionType >::GenerateSolutions_(), and BIAS::PreemptiveRANSAC< SolutionType >::GetSolution_().

template<class SolutionType>
unsigned BIAS::PreemptiveRANSAC< SolutionType >::SolStruct::num_inliers
template<class SolutionType>
bool BIAS::PreemptiveRANSAC< SolutionType >::SolStruct::refined
template<class SolutionType>
double BIAS::PreemptiveRANSAC< SolutionType >::SolStruct::score
template<class SolutionType>
SolutionType BIAS::PreemptiveRANSAC< SolutionType >::SolStruct::solution

The documentation for this struct was generated from the following file: