Fixes bug #3071.
If we have perfect matches (min_dist == 0.0), then strict comparison fails. Making it non-strict results in treating perfect matches as good.
This commit is contained in:
parent
98f6a4a615
commit
982ef83f80
@ -85,7 +85,7 @@ This tutorial code's is shown lines below. You can also download it from `here <
|
|||||||
std::vector< DMatch > good_matches;
|
std::vector< DMatch > good_matches;
|
||||||
|
|
||||||
for( int i = 0; i < descriptors_1.rows; i++ )
|
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]); }
|
{ good_matches.push_back( matches[i]); }
|
||||||
}
|
}
|
||||||
|
|
||||||
@ -127,6 +127,3 @@ Result
|
|||||||
.. image:: images/Feature_FlannMatcher_Keypoints_Result.jpg
|
.. image:: images/Feature_FlannMatcher_Keypoints_Result.jpg
|
||||||
:align: center
|
:align: center
|
||||||
:height: 250pt
|
:height: 250pt
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
@ -70,7 +70,7 @@ int main( int argc, char** argv )
|
|||||||
std::vector< DMatch > good_matches;
|
std::vector< DMatch > good_matches;
|
||||||
|
|
||||||
for( int i = 0; i < descriptors_1.rows; i++ )
|
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]); }
|
{ good_matches.push_back( matches[i]); }
|
||||||
}
|
}
|
||||||
|
|
||||||
|
Loading…
x
Reference in New Issue
Block a user