could anyone help me to calculate the euclidean distance for the matrix.

>> B = sqrt(sum(bsxfun(@minus,permute(A,[1,3,2]),permute(A,[3,1,2])).^2,3))
B =
   0.00000   2.99851   2.56248   0.72363
   2.99851   0.00000   1.02346   3.00859
   2.56248   1.02346   0.00000   2.81615
   0.72363   3.00859   2.81615   0.00000

Or use pdist (requires the Statistics Toolbox):

https://www.mathworks.com/help/stats/pdist.html

1 个评论
显示 -1更早的评论隐藏 -1更早的评论

jaah navi 2019-9-11

i used pdist to calculate the euclidean distance with respect to the following code;

code:

 PPP=[1.8667    0.1553;
     -0.0844    2.4322;
     -0.3485    1.4434;
      2.3628    0.6821]
 D = pdist(PPP)
 f=sum(D)/numel(D)
 indices = find(abs(D)<f)
 D(indices) = []

when i execute the above code i can get the result as

D = [2.9985 2.5625 3.0086 2.8162]

but i want to display which two rows gives the above result.the expected output is

D=[(1,2) (1,3) (2,4) (3,4)]

Could you please help me on it.

请先登录，再进行评论。

Answer 2

Christine Tobler 2019-9-11

1
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/479833-could-anyone-help-me-to-calculate-the-euclidean-distance-for-the-matrix#answer_391370

For MATLAB R2017b or later, you can use the vecnorm function for a simpler construction than the one involving sqrt, sum, and .^2:

vecnorm(permute(A,[1,3,2]) - permute(A,[3,1,2]), 2, 3)

This will give the exact same result as constructing two for-loops and computing B(i, j) = norm(x(i, :) - x(j, :)) individually for each combination.

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

请先登录，再进行评论。

Answer 3

Bruno Luong 2019-9-25

1
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/479833-could-anyone-help-me-to-calculate-the-euclidean-distance-for-the-matrix#answer_393406

Hi Christtine, very good initiative. I think at least 90% of use-case would be p=2.

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

请先登录，再进行评论。

Answer 4

Fabio Freschi 2019-9-11

0
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/479833-could-anyone-help-me-to-calculate-the-euclidean-distance-for-the-matrix#answer_391322

编辑：Fabio Freschi 2019-9-11

I have found that this is usually the fastest way, since the square of the binomial is unrolled

D = sqrt(abs(bsxfun(@plus,sum(A.*A,2),sum(A.*A,2).')-2*A*A'));

If you have two sets of points A and B

D = sqrt(abs(bsxfun(@plus,sum(A.*A,2),sum(B.*B,2).')-2*A*B'));

3 个评论
显示 1更早的评论隐藏 1更早的评论

Bruno Luong 2019-9-11

编辑：Bruno Luong 2019-9-11

The decompose method might have worst roundoff numerical issue:

A=[1e9   0;
   1e9+1 0]
D = sqrt(abs(bsxfun(@plus,sum(A.*A,2),sum(A.*A,2).')-2*A*A'))
B = sqrt(sum(bsxfun(@minus,permute(A,[1,3,2]),permute(A,[3,1,2])).^2,3))

B is correct D is not.

It could even return complex numbers.

Fabio Freschi 2019-9-11

Good point @Bruno Luong

I used this function in a "safe" environment and never met this condition. In any case, thanks for pointing out

请先登录，再进行评论。

Answer 5

Bruno Luong 2019-9-11

0
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/479833-could-anyone-help-me-to-calculate-the-euclidean-distance-for-the-matrix#answer_391379

I would put as comment of Christine's vecnorm soluton, but somehow Answers rejects it.

The vecnorm is slower than standard solution (Stephen's) in case of p = 2.

N = 10000;
A = rand(N,2);
tic
B = sqrt(sum((permute(A,[1,3,2])-permute(A,[3,1,2])).^2,3)); 
toc % Elapsed time is 1.249531 seconds.
tic
C = vecnorm(permute(A,[1,3,2]) - permute(A,[3,1,2]), 2, 3);
toc % Elapsed time is 4.590562 seconds.

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

请先登录，再进行评论。

Answer 6

Christine Tobler 2019-9-24

0
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/479833-could-anyone-help-me-to-calculate-the-euclidean-distance-for-the-matrix#answer_393308

编辑：Christine Tobler 2019-9-24

Hi Bruno, I have the same problem where I can't comment on your answer, so adding another answer here.

That's a good point - vecnorm returns the exact same value as vecnorm, however it's not been optimized for performance as sum. Still, with all the additional overhead in the computation using sum, .^2 and sqrt, it would make sense for vecnorm to be faster here. I've made an enhancement request for this.