代码搜索：HAUSDORFF
找到约 14 项符合「HAUSDORFF」的源代码
代码结果 14
www.eeworm.com/read/288316/8643396
m hausdorff.m
function c=hausdorff(b,a,bd,ad)
%求出模型图象B和未知图象A之间的hausdorff距离，用来跟踪视频对象
[M,N]=size(a);
[m,n]=size(b);
c=inf*ones(M,N);
[k,l]=find(b);
L=length(k);
% Ux=min(k);
% Dx=max(k);
% Ly=min(l);
% Ry=m
www.eeworm.com/read/204075/15344857
txt hausdorff.txt
void BaseStruct::GetTopologyObjs(CList *pBaseList,CList& objs)
{
int i;
POSITION pos,temp, posTemp;
BaseStruct *pBaseStruct;
ZBXY* zb, *zbTemp;
dou
www.eeworm.com/read/492126/6424296
m hausdorff1.m
i=imread('111.bmp')
i1=imread('222.bmp')
save2_filename='bg_frame';
save2_filename=strcat(save2_filename,'.bmp');
[m,n]=size(i)
index=1;
for t1=1:m
for t2=1:n
if i(t1,t2)>0;
www.eeworm.com/read/237387/13965140
gz hausdorff.tar.gz
www.eeworm.com/read/365737/9849770
m maxhausdorff.m
function distance=maxHausdorff(Bag1,Bag2)
% maxHausdorff Compute the maximum Hausdorff distance between two bags Bag1 and Bag2
% maxHausdorff takes,
% Bag1 - one bag of instances
% Bag2 - the
www.eeworm.com/read/365737/9849771
m minhausdorff.m
function distance=minHausdorff(Bag1,Bag2)
% minHausdorff Compute the minimum Hausdorff distance between two bags Bag1 and Bag2
% minHausdorff takes,
% Bag1 - one bag of instances
% Bag2 - the
www.eeworm.com/read/365737/9849777
m cluster_dist.m
function dist=cluster_dist(cluster1,cluster2,num_cluster1,num_cluster2,in_mode,out_mode)
% in_mode: mode for measuring the distance between bags: 1 for minimum Hausdorff; 2 for maximum Hausdorff;
www.eeworm.com/read/409636/11317503
pdf hausdorff算法在夜间车辆跟踪中的应用研究.pdf
www.eeworm.com/read/396922/8082926