考虑以下矩阵:
0 3 0 1 1 4
1 3 5 6 7 0
2 5 6 2 6 1
4 4 2 1 5 1
当我指定一个元素的位置时,我希望获得具有相同值的最近元素的位置。例如,如果我选择第3行第3列的元素,即"6",我想获得最接近的"6"的行和列值,在这种情况下,它位于第2行第4列。同样,对于第4行第4栏的"1",最接近的位于第4行、第5列和第4行,第6列,它们中的任何一个都可以。我查找了"bwdist"one_answers"find"函数,但它们没有给出正确的结果。有人能帮我吗?
编辑:
a1 = randi(10,10,5);
disp(a1);
%// For an array of search numbers
search_array = a1(4,5);
disp(search_array);
%%// Find the linear index of the location
[~,ind] = min(abs(bsxfun(@minus,a1(:),search_array')));%//'
%%// Convert the linear index into row and column numbers
[x,y] = ind2sub(size(a1),ind)
"min"函数在这里不起作用,因为所需元素所在的每个位置都将转换为零,"min"逐行扫描矩阵并给出第一个零的位置。以下是这样的情况:
2 6 10 9 2
6 6 7 5 3
1 8 5 2 1
8 1 9 5 5
9 7 6 4 3
10 6 6 5 3
10 2 7 9 5
6 10 4 5 2
3 6 3 4 5
2 5 6 4 8
即使在第4行第5列的"5"旁边有一个"5",也会选择第10行第2列的"五"。
假设A
是输入2D矩阵,这可能是一种方法-
%// Row and column indices of the "pivot"
row_id = 4;
col_id = 5;
%// Get the linear index from row and column indices
lin_idx = sub2ind(size(A),row_id,col_id)
%// Logical array with ones at places with same values
search_matches = false(size(A));
search_matches(A==A(lin_idx)) = 1;
%// Create a logical array with just a single 1 at the "pivot"
A_pivot = false(size(A));
A_pivot(lin_idx) = 1;
%// Use BWDIST to find out the distances from the pivot to all the places
%// in the 2D matrix. Set the pivot place and places with non-similar
%// values as Inf, so that later on MIN could be used to find the nearest
%// same values location
distmat = bwdist(A_pivot)
distmat(lin_idx) = Inf
distmat(~search_matches)=Inf
[~,min_lin_idx] = min(distmat(:))
[closest_row_idx,closest_col_idx] = ind2sub(size(A),min_lin_idx)
这种方法不需要任何工具箱。如果不存在具有相同值的其他条目,则返回[]
。
A = [0 3 0 1 1 4
1 3 5 6 7 0
2 5 6 2 6 1
4 4 2 1 5 1]; %// data matrix
pos_row = 3; %// row of reference element
pos_col = 3; %// col of reference element
ref = A(pos_row,pos_col); %// take note of value
A(pos_row,pos_col) = NaN; %// remove it, to avoid finding it as closest
[ii, jj] = find(A==ref); %// find all entries with the same value
A(pos_row,pos_col) = ref; %// restore value
d = (ii-pos_row).^2+ (jj-pos_col).^2; %// compute distances
[~, ind] = min(d); %// find arg min of distances
result_row = ii(ind); %// index with that to obtain result
result_col = jj(ind);