Michael Innerberger

I had a brief look at the best bin first algorithm. I'm not sure that we want to go to non-exact matching for this problem. If we want, it might...

I tried using approximate nearest neighbor searching algorithms. In particular, I looked at the best-bin-first algorithm detailed in [[Muja, Lowe; 2014]](https://ieeexplore.ieee.org/abstract/document/6809191/) and locality sensitive hashing for Euclidean distance as presented...

After unsuccessfully trying another supposed speedup for the matching process (KNN search using cosine distance instead of Euclidean distance), I acknowledge that there is not much more improvements to be...

Since #61 seems to have been resolved, is there anything else holding up this PR (and a new release)? Let me know if I can help with anything, @axtimwalde!