Matlab - 为每个零矩阵元素查找最接近的非零元素的索引

时间:2016-04-13 20:55:05

标签: matlab matrix nearest-neighbor

在Matlab中,我有一个矩阵,其中一些元素设置为零。 E.g:

0 1 0 0 0
2 5 0 3 0
0 0 0 0 0
0 5 0 2 1

对于每个零的矩阵元素,我想找到最近元素的非零的索引。当可能有多个索引时,应返回所有索引。什么可以是一个聪明的解决方案,我怎么能避免很多for循环的东西?

2 个答案:

答案 0 :(得分:4)

IPT中有一个高效bwdist function来计算distance transform

M = [
    0 1 0 0 0
    2 5 0 3 0
    0 0 0 0 0
    0 5 0 2 1
];
[D,IDX] = bwdist(M~=0)

结果:

D =
    1.0000         0    1.0000    1.0000    1.4142
         0         0    1.0000         0    1.0000
    1.0000    1.0000    1.4142    1.0000    1.0000
    1.0000         0    1.0000         0         0

IDX =
           2           5           5          14          14
           2           6           6          14          14
           2           6           6          14          20
           8           8           8          16          20

返回的IDX包含M中最近非零值的线性索引。它只返回每个元素的一个索引。

答案 1 :(得分:3)

这是一个使用bsxfunmat2cell的矢量化方法,它为每个单元格中的每个零元素存储非零最近元素的索引(按欧几里德距离) -

%// Assuming A as the input matrix. Store rows, columns of zero and non-zeros
[rz,cz] = find(A==0);
[rnz,cnz] = find(A~=0);

%// Store zero pt indices
zero_pts = [rz cz];

%// Get squared euclidean distances
dists = bsxfun(@minus,rnz,rz.').^2 + bsxfun(@minus,cnz,cz.').^2;

%// Get all nearest XY indices of nonzeros for each zero pt
[R_idx,C_idx] = find(bsxfun(@eq,min(dists,[],1),dists));
idx = [rnz(R_idx) cnz(R_idx)];

%// Cut at each shifting positions and thus create a cell array, with a
%// cell of indices of non-zero nearest elements for each zero element 
nearest_nnonzero_pts = mat2cell(idx,histc(C_idx,1:max(C_idx)))

示例输入,输出 -

输入:

>> A
A =
     0     1     0     0     0
     2     5     0     3     0
     0     0     0     0     0
     0     5     0     2     1

输出(零点):

>> disp(zero_pts)
     1     1
     3     1
     4     1
     3     2
     1     3
     2     3
     3     3
     4     3
     1     4
     3     4
     1     5
     2     5
     3     5

输出(对应最近的非零点):

>> celldisp(nearest_nnonzero_pts)
nearest_nnonzero_pts{1} =
     2     1
     1     2
nearest_nnonzero_pts{2} =
     2     1
nearest_nnonzero_pts{3} =
     4     2
nearest_nnonzero_pts{4} =
     2     2
     4     2
nearest_nnonzero_pts{5} =
     1     2
nearest_nnonzero_pts{6} =
     2     2
     2     4
nearest_nnonzero_pts{7} =
     2     2
     4     2
     2     4
     4     4
nearest_nnonzero_pts{8} =
     4     2
     4     4
nearest_nnonzero_pts{9} =
     2     4
nearest_nnonzero_pts{10} =
     2     4
     4     4
nearest_nnonzero_pts{11} =
     2     4
nearest_nnonzero_pts{12} =
     2     4
nearest_nnonzero_pts{13} =
     4     5