dt.m

来自「snake算法的核心源代码。现在图形图像的处理上」· M 代码 · 共 24 行

M
24
字号
function D = dt(B)
% DT apply Eucledian distance transform
%    D = dt(B) compute the Eucledian distance transform of B
%    B must be a binary map. 
%
% NOTE: this is not an efficient way to implement distance transform. 
%    If one is interested in using DT, one may want to implement its
%    own DT. 

%    Chenyang Xu and Jerry L. Prince 6/17/97
%    Copyright (c) 1996-97 by Chenyang Xu and Jerry L. Prince

[i,j] = find(B);

[n,m] = size(B);
for x = 1:n,
    for y = 1:m,
        dx = i-x;
        dy = j-y;
        dmag = sqrt(dx.*dx+dy.*dy);
	D(x,y) = min(dmag);
    end
end

⌨️ 快捷键说明

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