#include <SampleConsensus.hpp>
Public Types | |
| typedef problem_t::model_t | model_t |
Public Member Functions | |
| SampleConsensus (int maxIterations=1000, double threshold=1.0, double probability=0.99) | |
| Constructor. More... | |
| virtual | ~SampleConsensus () |
| Destructor. | |
| virtual bool | computeModel (int debug_verbosity_level=0)=0 |
| Fit the model to the data. More... | |
Public Attributes | |
| EIGEN_MAKE_ALIGNED_OPERATOR_NEW typedef PROBLEM_T | problem_t |
| int | max_iterations_ |
| int | iterations_ |
| double | threshold_ |
| double | probability_ |
| model_t | model_coefficients_ |
| std::vector< int > | model_ |
| std::vector< int > | inliers_ |
| std::shared_ptr< PROBLEM_T > | sac_model_ |
Super-class for sample consensus methods, such as Ransac.
| typedef problem_t::model_t opengv::sac::SampleConsensus< PROBLEM_T >::model_t |
The model we trying to fit
| opengv::sac::SampleConsensus< PROBLEM_T >::SampleConsensus | ( | int | maxIterations = 1000, |
| double | threshold = 1.0, |
||
| double | probability = 0.99 |
||
| ) |
Constructor.
| [in] | maxIterations | The maximum number of hypothesis generations |
| [in] | threshold | Some threshold value for classifying samples as an inlier or an outlier. |
| [in] | probability | The probability of being able to draw at least one sample that is free of outliers (see [15]) |
|
pure virtual |
Fit the model to the data.
| [in] | debug_verbosity_level | Sets the verbosity level. |
Implemented in opengv::sac::Ransac< PROBLEM_T >.
| std::vector<int> opengv::sac::SampleConsensus< PROBLEM_T >::inliers_ |
the indices of the samples that have been clasified as inliers
| int opengv::sac::SampleConsensus< PROBLEM_T >::iterations_ |
the current number of iterations
| int opengv::sac::SampleConsensus< PROBLEM_T >::max_iterations_ |
the maximum number of iterations
| std::vector<int> opengv::sac::SampleConsensus< PROBLEM_T >::model_ |
the indices for the currently best hypothesis
| model_t opengv::sac::SampleConsensus< PROBLEM_T >::model_coefficients_ |
the currently best model coefficients
| double opengv::sac::SampleConsensus< PROBLEM_T >::probability_ |
the current probability (defines remaining iterations)
| EIGEN_MAKE_ALIGNED_OPERATOR_NEW typedef PROBLEM_T opengv::sac::SampleConsensus< PROBLEM_T >::problem_t |
A child of SampleConsensusProblem
| std::shared_ptr<PROBLEM_T> opengv::sac::SampleConsensus< PROBLEM_T >::sac_model_ |
the sample-consensus problem we are trying to solve
| double opengv::sac::SampleConsensus< PROBLEM_T >::threshold_ |
the threshold for classifying inliers