partition.m

来自「This Two-Category Classifier Using Discr」· M 代码 · 共 28 行

M
28
字号
function A = partition(gi)
%function A = partition(gi)
%
% Find transition from +Ve to -Ve or -Ve to +Ve in Matrix or Vector
% Resultant matrix will be set '1' where transition occurs.

[row col] = size(gi);
A = zeros(row,col);
for i = 1:row
    for j = 1:(col-1)
        if ((abs(gi(i,j))==gi(i,j))&(abs(gi(i,j+1))~=gi(i,j+1)))|...
                ((abs(gi(i,j))~=gi(i,j))&(abs(gi(i,j+1))==gi(i,j+1)))
            tmp = find(abs(gi(i,:))==min(abs(gi(i,j)),abs(gi(i,j+1))));
            if isempty(find(tmp==j))
                A(i,j+1) = 1;
            else A(i,j) = 1; end
        end
        if row>1
            if ((abs(gi(j,i))==gi(j,i))&(abs(gi(j+1,i))~=gi(j+1,i)))|...
                    ((abs(gi(j,i))~=gi(j,i))&(abs(gi(j+1,i))==gi(j+1,i)))
                tmp = find(abs(gi(:,i))==min(abs(gi(j,i)),abs(gi(j+1,i))));
                if isempty(find(tmp==j))
                    A(j+1,i) = 1;
                else A(j,i) = 1; end
            end
        end
    end
end

⌨️ 快捷键说明

复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?