static void
captoinfo(void)
{
char usename[512];
char *sterm_name;
if (term_name == NULL) {
(void) fprintf(stderr, "%s: Null term_name given.\n",
progname);
return;
}
if (verbose)
(void) fprintf(trace, "changing cap to info, TERM=%s.\n",
term_name);
uselevel = 0;
if (filltables() == 0)
return;
getlongname();
adddefaults();
changecalculations();
if (TLHtcfound != 0) {
uselevel = 1;
if (verbose)
(void) fprintf(trace, "use= found, %s uses %s.\n",
term_name, TLHtcname);
(void) strcpy(usename, TLHtcname);
sterm_name = term_name;
term_name = usename;
if (filltables() == 0)
return;
adddefaults();
changecalculations();
term_name = sterm_name;
print_use_entry(usename);
} else
print_no_use_entry();
}
void scanDef2(ftype *ww1,ftype *ww2,ftype *ww3,ftype *ww4,int fy,int fx,int dimz,ftype *df1,ftype *df2,ftype *df3,ftype *df4,ftype *img,int imgy,int imgx,int *posy,int *posx,int *parts,ftype *res,int rad,int len,int usemrf,ftype *uscr,int useusrc,ftype *prec,int pady,int padx,int occl)
{
//printf("dimz:%d occl:%d",dimz,occl);
int sizedf=4;
ftype maxscr1,maxscr2,maxscr3,maxscr4;
ftype aux,aux0,aux1,aux2,aux3,myaux;
int i,c,p,rdef[4],rdef1[4],dy[4],dx[4];
ftype maxm[(2*maxrad+1)*(2*maxrad+1)];
buildef(def,df3[2],df3[3],rad);
buildef(def+(2*rad+1)*(2*rad+1)*(2*rad+1)*(2*rad+1),df1[2],df1[3],rad);
buildef(def+2*(2*rad+1)*(2*rad+1)*(2*rad+1)*(2*rad+1),df2[2],df2[3],rad);
buildef(def+3*(2*rad+1)*(2*rad+1)*(2*rad+1)*(2*rad+1),df4[2],df4[3],rad);
for (i=0;i<len;i++)//for each location
{
if (posy[i]<-100)//if score too low skip (used for some threshold based filtering)
{
continue;
}
int aord[]={0,1,3,2};
if (useusrc)//load partial score for BU
{
for (p=0;p<4;p++)
for (c=0;c<(2*rad+1)*(2*rad+1);c++)
scr[aord[p]*(2*rad+1)*(2*rad+1)+c]=-uscr[p*len*(2*rad+1)*(2*rad+1)+c*len+i];
}
else//initialize score to 0 for CtF
{
for (c=0;c<4*(2*rad+1)*(2*rad+1);c++)
scr[c]=0;
}
ftype *prec1=NULL,*prec2=NULL,*prec3=NULL,*prec4=NULL;
if (prec!=NULL)//use buffer for memoization
{
prec1=prec;
prec2=prec+(imgy+2*pady)*(imgx+2*padx);
prec3=prec+2*(imgy+2*pady)*(imgx+2*padx);
prec4=prec+3*(imgy+2*pady)*(imgx+2*padx);
}
//compute the score of the 4 parts
maxscr1 = refineighfull(img,imgy,imgx,ww1,fy,fx,dimz,df1[0],df1[1],posy[i],posx[i],rad,rad,scr,dy,dx,prec1,pady,padx,0);
maxscr2 = refineighfull(img,imgy,imgx,ww2,fy,fx,dimz,df2[0],df2[1],posy[i],posx[i]+fx,rad,rad,scr+(2*rad+1)*(2*rad+1),dy+1,dx+1,prec2,pady,padx,0);
maxscr3 = refineighfull(img,imgy,imgx,ww3,fy,fx,dimz,df3[0],df3[1],posy[i]+fy,posx[i],rad,rad,scr+3*(2*rad+1)*(2*rad+1),dy+2,dx+2,prec3,pady,padx,0);
maxscr4 = refineighfull(img,imgy,imgx,ww4,fy,fx,dimz,df4[0],df4[1],posy[i]+fy,posx[i]+fx,rad,rad,scr+2*(2*rad+1)*(2*rad+1),dy+3,dx+3,prec4,pady,padx,0);
if (usemrf)//use lateral constraints
{
for (c=0;c<4*(2*rad+1)*(2*rad+1);c++)
scr[c]=-scr[c];//invert the score to keep compatibility
filltables(scr,def,4,(2*rad+1)*(2*rad+1));
res[i]=map(rdef,0,maxm);
for (c=0;c<4;c++)
{
dy[c]=(rdef[c]/(2*rad+1))-rad;
dx[c]=(rdef[c]%(2*rad+1))-rad;
}
aux=dy[2];dy[2]=dy[3];dy[3]=aux;
aux=dx[2];dx[2]=dx[3];dx[3]=aux;
}
else
res[i]=maxscr1+maxscr2+maxscr3+maxscr4;
//mydef is referered to the next part in clockwise way
parts[0*len*sizedf+0*len+i]=dy[0]; //dy0
parts[0*len*sizedf+1*len+i]=dx[0]; //dx0
parts[0*len*sizedf+2*len+i]=(dy[0]-dy[1])*(dy[0]-dy[1]); //dy01
parts[0*len*sizedf+3*len+i]=(dx[0]-dx[1])*(dx[0]-dx[1]); //dx01
parts[1*len*sizedf+0*len+i]=dy[1]; //dy1
parts[1*len*sizedf+1*len+i]=dx[1]; //dx1
parts[1*len*sizedf+2*len+i]=(dy[1]-dy[3])*(dy[1]-dy[3]); //dy13
parts[1*len*sizedf+3*len+i]=(dx[1]-dx[3])*(dx[1]-dx[3]); //dx13
parts[2*len*sizedf+0*len+i]=dy[2]; //dy2
parts[2*len*sizedf+1*len+i]=dx[2]; //dx2
parts[2*len*sizedf+2*len+i]=(dy[2]-dy[0])*(dy[2]-dy[0]); //dy20
parts[2*len*sizedf+3*len+i]=(dx[2]-dx[0])*(dx[2]-dx[0]); //dx20
parts[3*len*sizedf+0*len+i]=dy[3]; //dy3
parts[3*len*sizedf+1*len+i]=dx[3]; //dx3
parts[3*len*sizedf+2*len+i]=(dy[3]-dy[2])*(dy[3]-dy[2]); //dy32
parts[3*len*sizedf+3*len+i]=(dx[3]-dx[2])*(dx[3]-dx[2]); //dx32
}
}
