1 | initial version |
I do not agree completely on @NightLife 's comment. Offcourse more matches can happen for a single point, that is why people use algorithms like RANSAC to counter that.
However, what happends here is that the matching functionality is a bruteforce matcher, which means that it matches both ways between the data sets. Therefore the result must contain the amounts of elements as the largest descriptor set. Else the matcher will try to access elements in a descriptor set that are out of the actual range. This is the reason of your 258 value, which is completely correct and how the algorithm should work in order not to create errors.