FlannBasedMatcher returning different results

大城市里の小女人 提交于 2019-12-01 09:42:11

FLANN chooses between the randomized kd-tree algorithm and the hierarchical k-means tree algorithm to make the optimal nearest neighbors approximation. The choice of algorithm is based on several factors such as dataset structure and search precision. Each algorithm also has a set of parameters that effects the search performance.

That means that it uses a random function to match, thats why you get different results each time ;)

易学教程内所有资源均来自网络或用户发布的内容,如有违反法律规定的内容欢迎反馈
该文章没有解决你所遇到的问题?点击提问,说说你的问题,让更多的人一起探讨吧!