Faster way to calculate the euclidean distance of a matrix than pdist and squareform?
조회 수: 3 (최근 30일)
이전 댓글 표시
design=[0.625 0.875;0.25 0.75;0.375 0.125;0.875 0.375;0.125 0.625;
0 0;0.5 0.5;0.75 0.25;0.6875 0.0625;0.0625 0.8125;0.1875 0.6875;0.3125 0.3125;
0.4375 0.9375;0.5625 0.5625;0.9375 0.1875;0.8125 0.4375];
v=16;
tic
d(:,:)=squareform(pdist(design(1:v,:))).^2;
toc
This code needs about 0.009 seconds to run. I need something faster, because this calculation is in a for loop. Thank you in advance.
댓글 수: 0
채택된 답변
Walter Roberson
2016년 7월 21일
You can use bsxfun of @minus to do the subtractions, then .^2 to square the components, sum() along the appropriate dimension, and .^(1/2) the result. This should be marginally faster than calling pdist, but probably not much faster.
댓글 수: 0
추가 답변 (0개)
참고 항목
카테고리
Help Center 및 File Exchange에서 Matrix Indexing에 대해 자세히 알아보기
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!