AcqTrackReconstructor Class Reference

#include <AcqTrackReconstructor.h>

Inheritance diagram for AcqTrackReconstructor:

Collaboration diagram for AcqTrackReconstructor:

Public Member Functions
	AcqTrackReconstructor ()
int	RecNetscan (EdbView *View)
int	RecRating (EdbView *View)
int	RecSySal (EdbView *View)
int	RecValeri (EdbView *View)
virtual	~AcqTrackReconstructor ()

Constructor & Destructor Documentation

AcqTrackReconstructor()

AcqTrackReconstructor::AcqTrackReconstructor

(

)

{
 
}

~AcqTrackReconstructor()

AcqTrackReconstructor::~AcqTrackReconstructor ( )

virtual

{
}

Member Function Documentation

RecNetscan()

int AcqTrackReconstructor::RecNetscan

(

EdbView *

View

)

  {
  // reconstruction a la Netscan (slow)
      return 0;
  }

RecRating()

int AcqTrackReconstructor::RecRating

(

EdbView *

View

)

  {
      // reconstruction based on rating propagation
      int iX,iY,iZ,ind;
      float SizeX=360.,SizeY=300.; //view size in microns
      float DX,DY;
      float DZ=40.;// emulsion thickness in real space
      float MaxT=.7; //max tangent of track angle
      MinRating=10; //minimum rating to keep the chain
      int CurRating=0; // current chain rating during propagation
      NCellZ=View->GetNframes();
      DX=DZ*MaxT;
      DY=DZ*MaxT;
      NCellX=int(SizeX/DX);
      NCellY=int(SizeY/DY);
      Volume=new TObjArray(NCellX*NCellY*NCellZ);
      for( ind=0;ind<NCellX*NCellY*NCellZ;ind++)   Volume->AddAt(new  TObjArray(10),ind);
      TObjArray *arr,*farr;
      EdbCluster *cl, *fcl;
      try {
          //Building index  table
      for(int i=0;i<View->Nclusters();i++)
      {
          cl=View->GetCluster(i);
          cl->SetSegment(0);
          iX=int((cl->X()+SizeX/2.)/DX);
          iY=int((cl->Y()+SizeY/2.)/DY);
          iZ=cl->GetFrame();
          ind=iZ*NCellX*NCellY+iY*NCellX+iX;
          if(ind>=NCellX*NCellY*NCellZ) continue;
          ((TObjArray*)(Volume->At(ind)))->AddLast(cl);
      }
         // now all clusters in 9 neighbour cells to the given one are within MaxT angle
      //Cluster->eSegment is used as chain rating variable
      for(int Lyr=0;Lyr<NCellZ-MinRating+1;Lyr++)  //loop on first layers
      {   iZ=Lyr;
          for(iX=2;iX<NCellX-2;iX++) for(iY=2;iY<NCellY-2;iY++) //loop on all cells in layer
          {
              ind=iZ*NCellX*NCellY+iY*NCellX+iX;
              arr=(TObjArray*)(Volume->At(ind)); //get array of clusters in the cell
              for(int i=0;i<arr->GetEntries();i++) //loop on clusters
              {
                  cl=(EdbCluster*)(arr->At(i));    // looking for beginning of the chain
                  if(cl->GetSegment()>0) continue; // cluster already a member of the chain - go to next
                  // cluster can be a start of the chain. iterate now.
                  if(!Propagate(&CurRating, iX,iY,iZ)) continue; //no valid chain found, skip the cluster
                  cl->SetSegment(CurRating); 
 
              }
          }
      }
 
 
 
      }
      catch(...) {printf("Exception! ind=%d, max=%d.\n",ind,NCellX*NCellY*NCellZ); }
      for( ind=0;ind<NCellX*NCellY*NCellZ;ind++)   delete (Volume->At(ind));
      delete Volume;
 
      return 0;
  }

RecSySal()

int AcqTrackReconstructor::RecSySal

(

EdbView *

View

)

  {
  // reconstruction a la SySal
      return 0;
  }

RecValeri()

int AcqTrackReconstructor::RecValeri

(

EdbView *

View

)

  {
  // reconstruction a la Valeri Tiukov (4D histogramming)
      int iX,iY,iZ,ind;
      float SizeX=360.,SizeY=300.; //view size in microns
      float DX,DY;
      float DZ=40.;// emulsion thickness in real space
      float MaxT=.7; //max tangent of track angle
      MinRating=10; //minimum rating to keep the chain
      int CurRating=0; // current chain rating during propagation
      NCellZ=View->GetNframes();
      DX=DZ*MaxT;
      DY=DZ*MaxT;
      NCellX=int(SizeX/DX);
      NCellY=int(SizeY/DY);
      Volume=new TObjArray(NCellX*NCellY*NCellZ);
      for( ind=0;ind<NCellX*NCellY*NCellZ;ind++)   Volume->AddAt(new  TObjArray(10),ind);
      TObjArray *arr,*farr;
      EdbCluster *cl, *fcl;
      try {
          //Building index  table
      for(int i=0;i<View->Nclusters();i++)
      {
          cl=View->GetCluster(i);
          cl->SetSegment(0);
          iX=int((cl->X()+SizeX/2.)/DX);
          iY=int((cl->Y()+SizeY/2.)/DY);
          iZ=cl->GetFrame();
          ind=iZ*NCellX*NCellY+iY*NCellX+iX;
          if(ind>=NCellX*NCellY*NCellZ) continue;
          ((TObjArray*)(Volume->At(ind)))->AddLast(cl);
      }
      }
      catch(...) {printf("Exception! ind=%d, max=%d.\n",ind,NCellX*NCellY*NCellZ); }
      for( ind=0;ind<NCellX*NCellY*NCellZ;ind++)   delete (Volume->At(ind));
      delete Volume;
      return 0;
  }

---

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

• src/libACQ/AcqTrackReconstructor.h
• src/libACQ/AcqTrackReconstructor.cxx