Perform the distance map between an object and its contour.
[dm] = NARVAL_IP_DistanceMap(im,ct)
binary matrix.
countour matrix.
Distance Map.
NARVAL_IP_DistanceMap performs the distance map dm between the binary object im and its contour ct. For each vertex of the object im(i,j)=1, we find the contour vertex ct(ci,cj) that minimizes the distance {D:(i,j)--(ci,cj)}. This distance is stored in dm(i,j).
dt=getdate(); seed=dt(10); rand('seed',seed);//initialization of the random values generator no=4;//quantity of obstacles (rectangle) L=1000;//squared area side hm=100;//minimal height hM=250;//maximal height wm=100;//minimal width wM=250;//maximal width Al=[0 %pi/2 %pi -%pi/2];//available angles for obstacles [Xs,Ys,X,Y,H,W,A]=NARVAL_IP_RectObstacles(no,L,hm,hM,wm,wM);//generation of obstacles [P]=NARVAL_IP_PotentialRot(X,Y,H,W,A,L);//generation of obstacle matrix z=10;//zoom factor o=2;// 1=mean, 2=max, 3=min, 4=median Pz=NARVAL_IP_MRA(P,z,o);//scale modification [Pzx,Pzy]=size(Pz);//image size w1=1;//window index w2=2;//window index scf(w1); clf(w1); grayplot(1:Pzx,1:Pzy,Pz);//graph visualization xset("colormap",graycolormap(128)); scf(w2); clf(w2); [PEz]=NARVAL_IP_Erosion(Pz);//contour performance Cont=Pz-PEz;//contour 1 [Contx,Conty]=size(Cont);//image size grayplot(1:Contx,1:Conty,Cont);//graph visualization xset("colormap",graycolormap(128)); w3=3;//window index scf(w3); clf(w3); [Dim]=NARVAL_IP_DistanceMap(Pz,Cont);//application of NARVAL_IP_DistanceMap [Dimx,Dimy]=size(Dim);//image size grayplot(1:Dimx,1:Dimy,Dim);//graph visualization xset("colormap",graycolormap(128)); | ![]() | ![]() |
Dr. Foued Melakessou
Research Associate
Interdisciplinary Centre for Security, Reliability and Trust
Room F106
University of Luxembourg
6, rue Coudenhove Kalergi
L-1359 Luxembourg-Kirchberg
E-mail: foued.melakessou@uni.lu
Tel: (+352) 46 66 44 5346