Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I am using SURF and i am trying both
FlannBasedMatcher
and
BruteForceMatcher
I saw to get good matches I need to set
matcher.knnMatch(,,2); // with k=2 (At least)
If I set k = 1 I don’t get the first less distant match for that keypoint.
Are there any reasons?
knnMatch partitions your data in k groups. If k=1, you will put it in one big group.
With a single partition, it will be hard for the algorithm to figure out the distance to a second one. So there will be no distance to calculate at all.