This forum is disabled, please visit https://forum.opencv.org
 | 1 | initial version |
You can compute the distance between two descriptors according to different metrics (e.g. L2 distance for floating-point descriptors). The smaller the distance, the more similar the matching.
Assuming that you use the bruteforce matcher to match the descriptors from one image (called the "query" image to another image (the "train" image), here is what it does:
_For each descriptor of the query image, compute the distance to each descriptor of the train image and keep the smallest one._
| | 2 | No.2 Revision |
You can compute the distance between two descriptors according to different metrics (e.g. L2 distance for floating-point descriptors). The smaller the distance, the more similar the matching.
Assuming that you use the bruteforce matcher to match the descriptors from one image (called the "query" image to another image (the "train" image), here is what it does:
_For For each descriptor of the query image, compute the distance to each descriptor of the train image and keep the smallest one._one.
