The results from mrpt::slam::data_association.
Definition at line 64 of file data_association.h.
#include <mrpt/slam/data_association.h>
Public Member Functions  
TDataAssociationResults ()  
void  clear () 
Public Attributes  
std::map< observation_index_t, prediction_index_t >  associations 
For each observation (with row index IDX_obs in the input "Z_observations"), its association in the predictions, as the row index in the "Y_predictions_mean" input (or it's mapping to a custom ID, if it was provided). More...  
double  distance 
The Joint Mahalanobis distance or matching likelihood of the best associations found. More...  
mrpt::math::CMatrixDouble  indiv_distances 
Individual mahalanobis distances (or matching likelihood, depending on the selected metric) between predictions (row indices) & observations (column indices). More...  
mrpt::math::CMatrixBool  indiv_compatibility 
The result of a chi2 test for compatibility using mahalanobis distance  Indices are like in "indiv_distances". More...  
std::vector< uint32_t >  indiv_compatibility_counts 
The sum of each column of indiv_compatibility, that is, the number of compatible pairings for each observation. More...  
size_t  nNodesExploredInJCBB 
Only for the JCBB method,the number of recursive calls expent in the algorithm. More...  

inline 
Definition at line 66 of file data_association.h.

inline 
Definition at line 76 of file data_association.h.
References associations, distance, indiv_compatibility, indiv_compatibility_counts, indiv_distances, nNodesExploredInJCBB, and mrpt::math::CMatrixTemplate< T >::setSize().
Referenced by mrpt::slam::CRangeBearingKFSLAM2D::TDataAssocInfo::clear(), and mrpt::slam::CRangeBearingKFSLAM::TDataAssocInfo::clear().
std::map<observation_index_t, prediction_index_t> mrpt::slam::TDataAssociationResults::associations 
For each observation (with row index IDX_obs in the input "Z_observations"), its association in the predictions, as the row index in the "Y_predictions_mean" input (or it's mapping to a custom ID, if it was provided).
Note that not all observations may have an associated prediction. An observation with index "IDX_obs" corresponds to the prediction number "associations[IDX_obs]", or it may not correspond to anyone if it's not present in the std::map (Tip: Use associations.find(IDX_obs)!=associations.end() )
Definition at line 99 of file data_association.h.
Referenced by clear(), mrpt::slam::CRangeBearingKFSLAM2D::OnGetObservationsAndDataAssociation(), mrpt::slam::CRangeBearingKFSLAM::OnGetObservationsAndDataAssociation(), and TEST().
double mrpt::slam::TDataAssociationResults::distance 
The Joint Mahalanobis distance or matching likelihood of the best associations found.
Definition at line 102 of file data_association.h.
Referenced by clear().
mrpt::math::CMatrixBool mrpt::slam::TDataAssociationResults::indiv_compatibility 
The result of a chi2 test for compatibility using mahalanobis distance  Indices are like in "indiv_distances".
Definition at line 113 of file data_association.h.
Referenced by clear().
std::vector<uint32_t> mrpt::slam::TDataAssociationResults::indiv_compatibility_counts 
The sum of each column of indiv_compatibility, that is, the number of compatible pairings for each observation.
Definition at line 116 of file data_association.h.
Referenced by clear().
mrpt::math::CMatrixDouble mrpt::slam::TDataAssociationResults::indiv_distances 
Individual mahalanobis distances (or matching likelihood, depending on the selected metric) between predictions (row indices) & observations (column indices).
Indices are for the appearing order in the arguments "Y_predictions_mean" & "Z_observations", they are NOT landmark IDs.
Definition at line 110 of file data_association.h.
Referenced by clear().
size_t mrpt::slam::TDataAssociationResults::nNodesExploredInJCBB 
Only for the JCBB method,the number of recursive calls expent in the algorithm.
Definition at line 120 of file data_association.h.
Referenced by clear().
Page generated by Doxygen 1.8.14 for MRPT 1.9.9 Git: ad3a9d8ae Tue May 1 23:10:22 2018 0700 at lun oct 28 00:14:14 CET 2019 