EdbTestAl Class Reference

alignment test class More...

#include <EdbTestAl.h>

Inheritance diagram for EdbTestAl:

Collaboration diagram for EdbTestAl:

Public Member Functions
int	CheckMaxBin ()
int	CheckMaxBin (float dz, float phi, float &meanbin, float &xmax, float &ymax)
int	DubletsFilterOut (EdbPattern &p, float xbin, float ybin, float dMin=5, float dtMin=0.05)
	EdbTestAl ()
int	FillTree (float gdz=0)
void	HDistance (EdbPattern &p1, EdbPattern &p2)
int	MakeTrans (EdbAffine2D &aff, float dz=0, const char *ccut="abs(dy)<400&&abs(dx)<400")
void	PositionPlot (EdbPattern &p1, EdbPattern &p2, float xbin, float ybin, TObjArray &arr1, TObjArray &arr2)
void	PositionPlot (EdbPattern &p1, EdbPattern &p2, TH2F &hd, float xbin=100, float ybin=100, TTree *posnt=0)
virtual	~EdbTestAl ()

Public Attributes
float	eBinSize
	microns More...
TNtuple *	eBinTree
	put bins value for all attempts More...
Float_t	eD0 [4]
	limits, and found value of the peak for dx,dy,dz,phi More...
Float_t	eDmax [4]
Float_t	eDmin [4]
TFile *	eFile
Int_t	eITMAX
	angular step (def=50) More...
Float_t	eMaxBin
	the max value corresponding to eD0 More...
Int_t	eN [4]
	nx,ny,nz,nphi - number of divisions More...
Int_t	eOCMAX
	occupancy (def=100) More...
float	eOffset
TObjArray *	eS1
TObjArray *	eS2
	pointers to segments selected by HDistance More...
TTree *	eT
TH2F *	HD
TH2F *	HDF
TH2F *	HDF2

Detailed Description

alignment test class

Constructor & Destructor Documentation

EdbTestAl()

EdbTestAl::EdbTestAl

(

)

{
  eITMAX=50;  // angular normalization (def=50) (the step is ~1./eITMAX)
  eOCMAX=100; // occupancy (def=100)
 
  eOffset=5000;
  eBinSize=50.;//microns
 
  eS1=0;
  eS2=0;
 
  eBinTree=0;
  eT   = 0;
  eFile= 0;
  HD=0;
  HDF=0;
  HDF2=0;
 
  eMaxBin=0;
  for(int i=0; i<4; i++) {eN[i]=0; eDmin[i]=0; eDmax[i]=0; eD0[i]=0;}
 
}

~EdbTestAl()

EdbTestAl::~EdbTestAl ( )

virtual

{
  if(eT)    eT->AutoSave("SaveSelf");
  if(eFile) eFile->Close();
}

Member Function Documentation

CheckMaxBin() [1/2]

int EdbTestAl::CheckMaxBin

(

)

Output: vmax - x,y,z,phi of the highest bin

{
 
  printf("CheckMaxBin:(z:nphi): %d %f %f  %d %f %f\n",eN[3],eDmin[3],eDmax[3],eN[2],eDmin[2],eDmax[2]);
 
  TH2F  *h2 = new TH2F("z_phi","z_phi",eN[3],eDmin[3],eDmax[3],eN[2],eDmin[2],eDmax[2]);
 
  float binz = (eDmax[2]-eDmin[2])/eN[2];
  float binp = (eDmax[3]-eDmin[3])/eN[3];
  float dz=0,  dphi=0, mean=0;
  float xmax=0,ymax=0;
  int   mbin=0;
  for(int iz=0; iz<eN[2]; iz++) {
    dz = eDmin[2] + iz*binz +binz/2;
    for(int ip=0; ip<eN[3]; ip++) {
      dphi = eDmin[3] + ip*binp + binp/2;
      mbin = CheckMaxBin(dz,dphi,mean,xmax,ymax);
      h2->Fill(dphi,dz,mbin);
      printf("dx,dy,dz,dphi = %f %f %f %f;  maxbin/mean= %d/%f = %f\n",xmax,ymax,dz,dphi, mbin,mean,  mbin/mean);
      if(mbin>=eMaxBin) {
    eD0[0] = xmax; eD0[1]=ymax; eD0[2]=dz; eD0[3]=dphi;
    eMaxBin=mbin;
      }
    }
  }
  h2->Draw("colz");
 
  int mx,my,mz;
  h2->GetMaximumBin(mx,my,mz);
  float phi = h2->GetXaxis()->GetBinCenter(mx);
  float z   = h2->GetYaxis()->GetBinCenter(my);
  mbin = (int)(h2->GetMaximum());
  mean = h2->GetSum()/h2->GetNbinsX()/h2->GetNbinsY();
  printf("max(%f,%f) = %d ; mean = %f\n",phi,z,mbin,mean);
 
  return mbin;
}

CheckMaxBin() [2/2]

int EdbTestAl::CheckMaxBin	(	float	dz,
		float	phi,
		float &	meanbin,
		float &	xmax,
		float &	ymax
	)

Output: vmax - x,y,z,phi of the highest bin

{
 
  if(!eS1) return 0;
  EdbSegP *s1=0, *s2=0;
  float x2p,y2p,dx,dy;
  TH2F  h2("H2","H2",eN[0],eDmin[0],eDmax[0],eN[1],eDmin[1],eDmax[1]);
  int n = eS1->GetEntries();
  for(int i=0; i<n; i++) {
    s1 = (EdbSegP *)(eS1->UncheckedAt(i));
    s2 = (EdbSegP *)(eS2->UncheckedAt(i));
 
    x2p = s2->X()*Cos(phi)-s2->Y()*Sin(phi);
    y2p = s2->X()*Sin(phi)+s2->Y()*Cos(phi);
    // todo - transform angles?
 
    dx= (x2p-s2->TX()*gdz) - s1->X();
    dy= (y2p-s2->TY()*gdz) - s1->Y();
    h2.Fill(dx,dy);    
  }
 
  if(eBinTree) {   // disabled test
    for(int i=0; i<eN[0]; i++)
      for(int j=0; j<eN[1]; j++) {
    float bin=h2.GetBinContent(h2.GetBin(i,j));
    if(bin<1) continue;
    dx = eDmin[0] + (i+0.5)*(eDmax[0]-eDmin[0])/eN[0];
    dy = eDmin[1] + (j+0.5)*(eDmax[1]-eDmin[1])/eN[1];
    eBinTree->Fill(gdz,phi,dx,dy,bin);
      }
  }
  meanbin = h2.GetSum()/h2.GetNbinsX()/h2.GetNbinsY();
  int mx,my,mz;
  h2.GetMaximumBin(mx,my,mz);
  xmax = h2.GetXaxis()->GetBinCenter(mx);
  ymax = h2.GetYaxis()->GetBinCenter(my);
  return (int)(h2.GetMaximum());
}

DubletsFilterOut()

int EdbTestAl::DubletsFilterOut	(	EdbPattern &	p,
		float	xbin,
		float	ybin,
		float	dMin = 5,
		float	dtMin = 0.05
	)

assign flag = -10 for the duplicated segments

{
  int nout=0;
 
  float dxMin=dMin,dyMin=dMin, dtxMin=dtMin, dtyMin=dtMin;
 
  TObjArray arr1(10000), arr2(10000);
  PositionPlot(p,p, xbin,ybin, arr1,arr2);
  int n1 = arr1.GetEntries();
  EdbSegP *s1,*s2;
  for(int i=0; i<n1; i++) {
    s1 = (EdbSegP*)arr1.At(i);
    s2 = (EdbSegP*)arr2.At(i);
    if( Abs(s2->X()-s1->X())   > dxMin )                     continue;
    if( Abs(s2->Y()-s1->Y())   > dyMin )                     continue;
    if( Abs(s2->TX()-s1->TX()) > dtxMin )                    continue;
    if( Abs(s2->TY()-s1->TY()) > dtyMin )                    continue;
    if( s2->Aid(0)==s1->Aid(0) && s2->Aid(1)==s1->Aid(1) && s1->Side()==s2->Side() )   continue;
    if( s2->W()>s1->W() ) s1->SetFlag(-10);
    else                  s2->SetFlag(-10);
    nout++;
  }
  Log(2,"DubletsFilterOut","%d segments discarded",nout);
  return nout;
}

FillTree()

int EdbTestAl::FillTree

(

float

gdz = 0

)

{
  if(!eS1) return 0;
 
  eFile = new TFile("alt.root","RECREATE");
  eT    = new TTree("T","Alignment tree");
  float dx,dy;
  static DTR dtr;
  eT->Branch("dtr",&dtr,"it1/I:it2/I:x1/F:y1/F:z1/F:x2/F:y2/F:z2/F:tx1/F:ty1/F:tx2/F:ty2/F:chi1/F:chi2/F");
  EdbSegP *s1,*s2;
  int steps=int(2.*eOffset/eBinSize);
  if(HD) HD->Reset(); 
  else   HD=new TH2F("HD","HD",steps,-eOffset,eOffset,steps,-eOffset,eOffset);
  if(HDF) HDF->Reset(); 
  else    HDF=new TH2F("HDF","HDF",100,-eBinSize,eBinSize,100,-eBinSize,eBinSize);
  HDF2=new TH2F("HDF2","HDF2",100,-3*eBinSize,3*eBinSize,100,-3*eBinSize,3*eBinSize);
 
  int n = eS1->GetEntries();
  for(int i=0; i<n; i++) {
    s1 = (EdbSegP *)(eS1->UncheckedAt(i));
    s2 = (EdbSegP *)(eS2->UncheckedAt(i));
    dtr.x1=s1->X();
    dtr.y1=s1->Y();
    dtr.z1=s1->Z();
    dtr.x2=s2->X();
    dtr.y2=s2->Y();
    dtr.z2=s2->Z();
    dtr.chi1=s1->Chi2();
    dtr.chi2=s2->Chi2();
    
    dtr.tx1=s1->TX();
    dtr.ty1=s1->TY();
    dtr.tx2=s2->TX();
    dtr.ty2=s2->TY();
    
    dx= (dtr.x2+s2->TX()*gdz) - dtr.x1;
    dy= (dtr.y2+s2->TY()*gdz) - dtr.y1;
    eT->Fill();
    HD->Fill(dx,dy);
    HDF->Fill(dx,dy);
    HDF2->Fill(dx,dy);
  }
  HD->Write();
  HDF->Write();
  HDF2->Write();
  eT->Write();
  return n;
}

HDistance()

void EdbTestAl::HDistance	(	EdbPattern &	p1,
		EdbPattern &	p2
	)

{
  int nx=200, ny=200, no=100;
  Long_t *ind1 = new Long_t[nx*ny*no];
  Long_t *ind2 = new Long_t[nx*ny*no];
  Int_t  *oc1  = new Int_t[nx*ny];
  Int_t  *oc2  = new Int_t[nx*ny];
  memset(ind1,0,nx*ny*no*sizeof(Long_t));
  memset(ind2,0,nx*ny*no*sizeof(Long_t));
  memset( oc1,0,nx*ny*sizeof(Int_t));
  memset( oc2,0,nx*ny*sizeof(Int_t));
 
  int itx,ity;  
 
  for(int i=0;i<eITMAX;i++) for(int j=0;j<eITMAX;j++) { oc1[i*nx+j]=0; oc2[i*nx+j]=0;} 
  for(int i=0;i<p1.N();i++){
    itx=int( (p1.GetSegment(i)->TX()+1.)*eITMAX/2. );
    ity=int( (p1.GetSegment(i)->TY()+1.)*eITMAX/2. );
    if(itx<eITMAX)
      if(ity<eITMAX)
    if(itx>=0)
      if(ity>=0)
        if(oc1[itx*nx+ity]<eOCMAX-1) 
          { ind1[itx*nx*ny+ity*ny+oc1[itx*nx+ity]]=i; (oc1[itx*nx+ity])++;}
  }
  for(int i=0;i<p2.N();i++){
    itx=int( (p2.GetSegment(i)->TX()+1.)*eITMAX/2 );
    ity=int( (p2.GetSegment(i)->TY()+1.)*eITMAX/2 );
    if(itx<eITMAX)
      if(ity<eITMAX)
    if(itx>=0)
      if(ity>=0)
        if(oc2[itx*nx+ity]<eOCMAX-1) 
          { ind2[itx*nx*ny+ity*ny+oc2[itx*nx+ity]]=i; (oc2[itx*nx+ity])++;}
  }
  
  if(!eS1) eS1=new TObjArray(1000);  else eS1->Clear();
  if(!eS2) eS2=new TObjArray(1000);  else eS2->Clear();
 
  for(int itx=0;itx<eITMAX;itx++) for(int ity=0;ity<eITMAX;ity++) 
    for(int i=0;i<oc1[itx*nx+ity];i++)
      for(int j=0;j<oc2[itx*nx+ity];j++)
    {
      eS1->Add( p1.GetSegment(ind1[itx*nx*ny+ity*ny+i]) );
      eS2->Add( p2.GetSegment(ind2[itx*nx*ny+ity*ny+j]) );
    }
 
  delete [] ind1;
  delete [] ind2;
  delete [] oc1;
  delete [] oc2;
}

MakeTrans()

int EdbTestAl::MakeTrans	(	EdbAffine2D &	aff,
		float	dz = 0,
		const char *	ccut = "abs(dy)<400&&abs(dx)<400"
	)

{
  static DTR dtr;
  eT->SetBranchAddress("dtr",&dtr);
 
  printf("MakeTrans: propagate the first pattern to %f before...\n",dz);
  char str[64];
  eT->SetAlias("dtx","tx2-tx1");
  eT->SetAlias("dty","ty2-ty1");
  sprintf(str,"x2-(%f*tx1+x1)",dz);  eT->SetAlias("dx",str);
  sprintf(str,"y2-(%f*ty1+y1)",dz);  eT->SetAlias("dy",str);
 
  TCanvas *c = new TCanvas("alcan","alignment check");
  c->Divide(2,2);
  
  TCut cut=ccut;
 
  c->cd(1); eT->Draw("dy:dx",cut);
  c->cd(2); eT->Draw("dy:x2",cut);
  c->cd(4); eT->Draw("dx:y2",cut);
 
  TEventList *lst =0;
  eT->Draw(">>lst", cut );
  lst = (TEventList*)gDirectory->GetList()->FindObject("lst");
  int nlst =lst->GetN();
  int entr=0;
 
  TArrayF x1(nlst);
  TArrayF x2(nlst);
  TArrayF y1(nlst);
  TArrayF y2(nlst);
 
  for(int i=0; i<nlst; i++ ) {
    entr = lst->GetEntry(i);
    eT->GetEntry(entr);
    x1[i]=dtr.x1;
    y1[i]=dtr.y1;
    x2[i]=dtr.x2;
    y2[i]=dtr.y2;
  }
 
  aff.Calculate(nlst,x1.GetArray(),y1.GetArray(),x2.GetArray(),y2.GetArray());
  return nlst;
}

PositionPlot() [1/2]

void EdbTestAl::PositionPlot	(	EdbPattern &	p1,
		EdbPattern &	p2,
		float	xbin,
		float	ybin,
		TObjArray &	arr1,
		TObjArray &	arr2
	)

speed-optimized position plot when xbin,ybin << (xmax-xmin),(ymax-ymin)

{
 
  EdbSegP *s = p1.GetSegment(0);
  float xmin = p1.Xmin(), xmax = p1.Xmax();
  float ymin = p1.Ymin(), ymax = p1.Ymax();
  int nx = (int)((xmax-xmin)/xbin+2);
  int ny = (int)((ymax-ymin)/ybin+2);
  //printf("xbin = %f, ybin=%f    nx = %d  ny = %d\n", xbin, ybin, nx,ny);
 
  int meancell1 = (int)Sqrt(p1.N()/nx/ny);
  int meancell2 = (int)Sqrt(p2.N()/nx/ny);
  int meancell  = (int)Max(meancell1,meancell2)+10;
 
  TObjArray as1(nx*ny), as2(nx*ny);
  for(int i=0; i<nx*ny; i++) {
    as1.Add(new TObjArray(meancell));
    as2.Add(new TObjArray(meancell));
  }
 
  int kx,ky, k;
  for(int i=0; i<p1.N(); i++) {
    s = p1.GetSegment(i);
    if(s->Flag()==-10) continue;
    ky = (int)((s->Y()-ymin)/ybin);
    kx = (int)((s->X()-xmin)/xbin);
    k = nx*ky + kx;
    ((TObjArray*)(as1.At(k)))->Add(s);
  }
  for(int i=0; i<p2.N(); i++) {
    s = p2.GetSegment(i);
    if(s->Flag()==-10)         continue;
    if( s->X() <= xmin-xbin/2) continue;
    if( s->X() >= xmax+xbin/2) continue;
    if( s->Y() <= ymin-ybin/2) continue;
    if( s->Y() >= ymax+ybin/2) continue;
 
    kx = (int)((s->X()-xmin - xbin/2)/xbin);
    ky = (int)((s->Y()-ymin - ybin/2)/ybin);
    if(kx>nx-1||kx<0||ky>ny-1||ky<0) continue;
    ((TObjArray*)(as2.At(nx*ky+kx)))->Add(s);
    ((TObjArray*)(as2.At(nx*ky+kx+1)))->Add(s);
    ((TObjArray*)(as2.At(nx*(ky+1)+kx)))->Add(s);
    ((TObjArray*)(as2.At(nx*(ky+1)+kx+1)))->Add(s);
  }
 
  TObjArray *a1,*a2;
  EdbSegP *s1,*s2;
  for(int i=0; i<nx*ny; i++) {
    a1 = (TObjArray*)as1.At(i);
    a2 = (TObjArray*)as2.At(i);
    for(int i1=0; i1<a1->GetEntriesFast(); i1++) 
      {
    s1 = (EdbSegP*)a1->At(i1);
    for(int i2=0; i2<a2->GetEntriesFast(); i2++) 
      {
        s2 = (EdbSegP*)a2->At(i2);
        if(s1==s2) continue;                           // useful in case if p1==p2
        if( Abs(s2->TX()-s1->TX()) > 0.25) continue;
        if( Abs(s2->TY()-s1->TY()) > 0.25) continue;
        arr1.Add(s1);
        arr2.Add(s2);
      }
      }
  }
  
}

PositionPlot() [2/2]

void EdbTestAl::PositionPlot	(	EdbPattern &	p1,
		EdbPattern &	p2,
		TH2F &	hd,
		float	xbin = 100,
		float	ybin = 100,
		TTree *	posnt = 0
	)

{
  TObjArray arr1(10000), arr2(10000);
  PositionPlot(p1,p2,xbin,ybin,arr1,arr2);
  int n1 = arr1.GetEntries();
  EdbSegP *s1,*s2;
  for(int i=0; i<n1; i++) {
    s1 = (EdbSegP*)arr1.At(i);
    s2 = (EdbSegP*)arr2.At(i);
 
    hd.Fill(s2->X()-s1->X(), s2->Y()-s1->Y());
    if(posnt)  {
      posnt->SetBranchAddress("s1.",&s1);
      posnt->SetBranchAddress("s2.",&s2);
      posnt->Fill();
    }
 
//     if(posnt)  posnt->Fill( 
//             s1->X(),s1->Y(),s1->Z(),s1->TX(),s1->TY(),
//             s2->X(),s2->Y(),s2->Z(),s2->TX(),s2->TY(),
//             s1->Vid(0),s1->Vid(1),s2->Vid(0),s2->Vid(1)
//             );
  }  
}

Member Data Documentation

eBinSize

float EdbTestAl::eBinSize

microns

eBinTree

TNtuple* EdbTestAl::eBinTree

put bins value for all attempts

eD0

Float_t EdbTestAl::eD0[4]

limits, and found value of the peak for dx,dy,dz,phi

eDmax

Float_t EdbTestAl::eDmax[4]

eDmin

Float_t EdbTestAl::eDmin[4]

eFile

TFile* EdbTestAl::eFile

eITMAX

Int_t EdbTestAl::eITMAX

angular step (def=50)

eMaxBin

Float_t EdbTestAl::eMaxBin

the max value corresponding to eD0

eN

Int_t EdbTestAl::eN[4]

nx,ny,nz,nphi - number of divisions

eOCMAX

Int_t EdbTestAl::eOCMAX

occupancy (def=100)

eOffset

float EdbTestAl::eOffset

eS1

TObjArray* EdbTestAl::eS1

eS2

TObjArray * EdbTestAl::eS2

pointers to segments selected by HDistance

eT

TTree* EdbTestAl::eT

HD

TH2F* EdbTestAl::HD

HDF

TH2F* EdbTestAl::HDF

HDF2

TH2F* EdbTestAl::HDF2

---

The documentation for this class was generated from the following files:

• /home/antonio/fedra_doxygen/src/libAlignment/EdbTestAl.h
• /home/antonio/fedra_doxygen/src/libAlignment/EdbTestAl.cxx