How to pair two set of coordinates together based on their Euclidean distance?

2 次查看（过去 30 天）

Yuhong 2022-10-3

1
链接

此问题的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/1816715-how-to-pair-two-set-of-coordinates-together-based-on-their-euclidean-distance

评论： Yuhong 2022-10-6

Hi! I got two sets of pixels as my feature points, one is red and another is blue, I want to use Euclidean distance between two features as the metric: if the distance is below a threshold, make the two features as a pair of correspondence. The threshold could be 1 or 2 (pixels). I want to count the number of correspondence pairs. Thank you so much if you can help meT

The image file is the "image.mat", the red pixel coordinates is in "red_pixel_coordinate.mat", and the blue pixel coordinates is in "blue_pixel_coordinate.mat".

0 个评论
显示 -2更早的评论隐藏 -2更早的评论

请先登录，再进行评论。

请先登录，再回答此问题。

回答（1 个）

Matt J 2022-10-3

0
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/1816715-how-to-pair-two-set-of-coordinates-together-based-on-their-euclidean-distance#answer_1065810

编辑：Matt J 2022-10-3

See matchpairs.

The cost matrix can be obtained using pdist2.

6 个评论
显示 4更早的评论隐藏 4更早的评论

Matt J 2022-10-3

From the the doc:

M — Matches

matrix

Matches, returned as a matrix. M is a p-by-2 matrix, where M(i,1) and M(i,2) are the row and column indices of a matched pair in the cost matrix. The rows of M are sorted with the second column in ascending order.

Each row and column can be matched a single time only, so each M(i,1) value and each M(i,2) value is unique.
M contains p matches, and p is less than or equal to the maximum number of matches min(size(Cost)).
The cost of the matches in M is sum([Cost(M(1,1),M(1,2)), Cost(M(2,1),M(2,2)), ..., Cost(M(p,1),M(p,2))]).