Flann (Tree) + Cross Check

asked 2016-11-03 07:46:06 -0500

MQ gravatar image

Is there a way to create a matching based on trees and that computes the Cross Checking?

Now, I have two ways to make the matching:

1) FlannBasedMatcher matcher(new flann::KDTreeIndexParams(num_trees));

2) BFMatcher matcher(NORM_HAMMING, CrossCheck = true);

Can I merge both ideas?

Thanks in advance,

edit retag flag offensive close merge delete



You should be able to use the FLANN matcher to keep only the good pairs of keypoints and the good pairs of descriptors. Then, you should be able to use the BF matcher with the new data.

Or you can do the FLANN matching and perform manually the cross check.

Eduardo gravatar imageEduardo ( 2016-11-03 11:37:23 -0500 )edit