Implementation of the LATCH feature descriptor and brute force matcher (Levi/Hassner)
This is my own implementation of the LATCH descriptor by Levi and Hassner written from scratch in C++.
Detection is performed using the OpenCV built-in FAST detector, and the OpenCV KeyPoint class is used. A simple brute-force matcher has been implemented where paired features must be each other's closest matcher under Hamming distance. A simple descriptor class is used to handle the 512-bit descriptors.
The LATCH paper is here.
I used the LATCH triple values from the OpenCV implementation source code.
csp256 has made many helpful suggestions for this project.
OpenCV