Brute force matcher vs knn+RANSAC, which is better?

asked 2014-05-02 06:58:02 -0500

jpl gravatar image

updated 2014-05-02 07:01:49 -0500

berak gravatar image

Why are most articles that deal with comparing feature descriptors use the k-nearest neighbor matcher + RANSAC instead of a brute force matcher, especially that the brute force matcher performs all the possible comparisons, so he gives the best possible result. It's true that by doing so, the brute force matcher takes much more time the k-nearest neighbor matcher + RANSAC, but are there any other advantages to using the knn+RANSAC ?

edit retag flag offensive close merge delete

Comments

You should try to combine your questions better ... this one has a similar question. Try to create one about looking for the correct matcher and reasons why, close down the other please.

StevenPuttemans gravatar imageStevenPuttemans ( 2014-05-02 07:20:50 -0500 )edit