If we have perfect matches (min_dist == 0.0), then strict comparison
fails. Making it non-strict results in treating perfect matches as
good.
std::vector< DMatch > good_matches;
for( int i = 0; i < descriptors_1.rows; i++ )
- { if( matches[i].distance < 2*min_dist )
+ { if( matches[i].distance <= 2*min_dist )
{ good_matches.push_back( matches[i]); }
}
.. image:: images/Feature_FlannMatcher_Keypoints_Result.jpg
:align: center
:height: 250pt
-
-
-
std::vector< DMatch > good_matches;
for( int i = 0; i < descriptors_1.rows; i++ )
- { if( matches[i].distance < 2*min_dist )
+ { if( matches[i].distance <= 2*min_dist )
{ good_matches.push_back( matches[i]); }
}