This forum is disabled, please visit https://forum.opencv.org

1 | initial version |

I think the description is pretty accurate.

- For a given keypoint K1 from the first set (image), it takes every keypoint in the second set and calculates the distance. The keypoint K2 with the smallest distance will be considered its pair.

If you enable cross-checking, the pair is accepted only if K1 is the closest to K2 from the first set.

- Yes, NORM_L2 is the euclidean distance (
`=sum(da²)`

). The NORM_L1 is the sum of the distances on each dimension (`=sum(abs(da))`

).

2 | No.2 Revision |

I think the description is pretty accurate.

`1.`

For a given keypoint K1 from the first set (image), it takes every keypoint in the second set and calculates the distance. The keypoint K2 with the smallest distance will be considered its pair.

If you enable cross-checking, the pair is accepted only if K1 is the closest to K2 from the first set.

`2.`

Yes, NORM_L2 is the euclidean distance (`=sum(da²)`

). The NORM_L1 is the sum of the distances on each dimension (`=sum(abs(da))`

).

Copyright OpenCV foundation, 2012-2018. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.