EdbIP Class Reference

#include <EdbIP.h>

Inheritance diagram for EdbIP:

Collaboration diagram for EdbIP:

Public Member Functions
int	Clusterize (EdbFrame *frame, TTree *tree)
int	Clusterize2 (EdbFrame *frame, TTree *tree)
int	CutBG (EdbFrame *frame)
	EdbIP ()
TTree *	InitTree ()
void	SetFIR (EdbFIRF *fir)
void	SetThr (Float_t thr)

Static Public Member Functions
static float	BurnPix (TH2F *h, int ic, int ir, float thr, EdbClustP &cl)
static int	BurnPix (unsigned char *img, int ic, int ir, int nc, unsigned char thr, EdbCluster &cl)
static int	Clusterize (EdbFrame *f, unsigned char thr, EdbView &v)
static int	Clusterize (TH2F *h, float thr, TTree *tree, float z, int ifr)
static int	Clusterize2 (TH2F *h, float thr, TTree *tree, float z, int ifr)
static int	Peak12 (TH2F *h, float thr)
static int	Peak8 (TH2F *h, float thr)

Private Attributes
EdbFIRF *	eFIR
Float_t	eThr

Constructor & Destructor Documentation

EdbIP()

EdbIP::EdbIP

(

)

{
  eFIR=0;
  eThr=0;
}

Member Function Documentation

BurnPix() [1/2]

float EdbIP::BurnPix ( TH2F *  h, int  ic, int  ir, float  thr, EdbClustP &  cl  )

static

{
  float pix=h->GetBinContent(ic,ir);
  if( pix<thr )   return 0;
 
  cl.AddPixel(ic-.5,ir-.5,pix-thr);
 
  h->SetBinContent(ic,ir,0,-pix);
  pix = 1;
  
  int xn[4] = { 1, -1, 0,  0 };    //pixel closest suburbs
  int yn[4] = { 0,  0, 1, -1 };
  float pp;
  int i,j;
 
  for(int in=0; in<4; in++) {
    i = ic+xn[in];
    j = ir+yn[in];
    pp = (float)( h->GetBinContent(i,j) );
    if( pp < thr ) continue;
    pix += BurnPix(h,i,j, thr, cl);
  }
  return pix;
}

BurnPix() [2/2]

int EdbIP::BurnPix ( unsigned char *  img, int  ic, int  ir, int  nc, unsigned char  thr, EdbCluster &  cl  )

static

{
  int pix = buf[nc*ir+ic];
  cl.AddPixelSum(ic,ir,pix-thr);
  buf[nc*ir+ic]=0;
 
  pix = 1;
  if(cl.GetArea() >50000) return pix;
  
  int xn[4] = { 1, -1, 0,  0 };    //pixel closest suburbs
  int yn[4] = { 0,  0, 1, -1 };
  unsigned char pp;
  int i,j;
 
  for(int in=0; in<4; in++) {
    i = ic+xn[in];
    j = ir+yn[in];
    pp = buf[nc*j+i];
    if( pp < thr ) continue;
    pix += BurnPix(buf,i,j, nc, thr, cl);
  }
  return pix;
}

Clusterize() [1/3]

int EdbIP::Clusterize ( EdbFrame *  f, unsigned char  thr, EdbView &  v  )

static

{
  // input:  frame; 
  // output: clusters added to a view
 
  TStopwatch sw;
  sw.Start();
 
  float z   = frame->GetZ();
  int   ifr = frame->GetID();
  EdbImage *img=frame->GetImage();
  int nc = img->Width();
  int nr = img->Height();
  printf("img: %d %d\n",nc,nr);
 
  unsigned char *buf = (unsigned char*)(img->GetBuffer());
  unsigned char pix;
  float wcl;
  int   ncl=0;
  EdbCluster *cl=0;
 
  for(int ir=2; ir<nr-3; ir++) {
    for(int ic=2; ic<nc-3; ic++) {
 
      pix = buf[nc*ir+ic];
      if( pix <= thr)   continue;
 
      cl = v.AddCluster(0,0,z, 0, 0, ifr, 0);
      wcl = BurnPix( buf, ic,ir, nc, thr, *cl);
      cl->Normalize();
      ncl++;
    }
  }
  printf("Clusterize2............ %15.8f\n",sw.CpuTime());
  printf("ncl=%d\n",ncl);
  return ncl;
}

Clusterize() [2/3]

int EdbIP::Clusterize	(	EdbFrame *	frame,
		TTree *	tree
	)

{
  TH2F *img = eFIR->ApplyTo(frame->GetImage());
  float z = frame->GetZ();
  int   ifr = frame->GetID();
  int ncl = Clusterize( img, eThr, tree, z, ifr );
  delete img;
  return ncl;
}

Clusterize() [3/3]

int EdbIP::Clusterize ( TH2F *  h, float  thr, TTree *  tree, float  z, int  ifr  )

static

{
  // c++ remake of my good old "Fire in steppe ;-)"
 
  int nc = h->GetNbinsX();
  int nr = h->GetNbinsY();
  float pix;
  float wcl;
  int   ncl=0;
  printf("hist: %d %d\n",nc,nr);
 
  tree->GetDirectory()->cd();
  EdbClustP *cl = 0;
  tree->SetBranchAddress("cl",&cl);
  cl = new EdbClustP();
 
  TStopwatch sw;
  sw.Start();
 
  for(int ic=2; ic<nc-3; ic++) {
    for(int ir=2; ir<nr-3; ir++) {
 
      pix = (float)(h->GetBinContent(ic,ir));
      if( pix <= thr)   continue;
 
      cl->Reset();
      wcl = BurnPix( h, ic,ir, thr, *cl);
      cl->SetZ(z);
      cl->SetFrame(ifr);
      tree->Fill();
      ncl++;
    }
  }
  printf("Clusterize2............ %15.8f\n",sw.CpuTime());
 
 
  tree->AutoSave();
 
  return ncl;
}

Clusterize2() [1/2]

int EdbIP::Clusterize2	(	EdbFrame *	frame,
		TTree *	tree
	)

{
  TH2F *img = eFIR->ApplyTo(frame->GetImage());
  float z = frame->GetZ();
  int   ifr = frame->GetID();
  int ncl = Clusterize2( img, eThr, tree, z, ifr );
  delete img;
  return ncl;
}

Clusterize2() [2/2]

int EdbIP::Clusterize2 ( TH2F *  h, float  thr, TTree *  tree, float  z, int  ifr  )

static

{
  // Should be faster...
  /*
  int nc = h->GetNbinsX();
  int nr = h->GetNbinsY();
  float pix;
  printf("hist: %d %d\n",nc,nr);
 
  tree->GetDirectory()->cd();
  EdbClustP *cl = 0;
  tree->SetBranchAddress("cl",&cl);
 
  TStopwatch sw;
  sw.Start();
  TList clusters;         // list of clusters
  EdbClustP *ptrup[nc];   // line of pointers (ToDo: check direction)
  for(int i=0; i<nc; i++) ptrup[i]=0;
 
  int i;
  for(int ir=1; ir<nr-3; ir++) {
    for(int ic=1; ic<nc-3; ic++) {
      
      i = ic;
      
      pix = (float)(h->GetBinContent(ic,ir));
      
      if( pix <= thr) {
    if(cl) {ptrup[i]=cl; cl=0;}
    else ptrup[i]=0;
    continue;
      }
      if(!cl) {
    if(!ptrup[i])   {cl = new EdbClustP(); clusters.Add(cl);
    }
    else cl = ptrup[i];
      }
    printf("ncl=%d\n",clusters.GetEntries());
      cl->AddPixelSum(ic-.5,ir-.5,pix-thr);
      cl->Print();
      if(!ptrup[i]) ptrup[i]=cl;
      else if( ptrup[i] != cl ) {
    cl->AddClusterSum(ptrup[i]);
    clusters.Remove(ptrup[i]);
    //delete ptrup[i];
    ptrup[i]=cl;
    for(int j=i-1; j>1; j--) {if(!ptrup[j]) break; ptrup[j]=cl;}
      }
    }
  }
  printf("Clusterize2............ %15.8f\n",sw.CpuTime());
 
  printf("ncl=%d\n",clusters.GetEntries());
 
  TListIter next(&clusters);
  int   ncl=0;
  while (  (cl = (EdbClustP*)next()) ) {
    cl->Normalize();        //if used AddPixelSum
    cl->SetZ(z);
    cl->SetFrame(ifr);
    tree->Fill();
    ncl++;
  }
  tree->AutoSave();
  printf("ncl=%d\n",ncl);
  return ncl;
  */
  return 0;
}

CutBG()

int EdbIP::CutBG

(

EdbFrame *

frame

)

{
  int npix = 0;
  TH2F *h = eFIR->ApplyTo(frame->GetImage());
  int nc = h->GetNbinsX();
  int nr = h->GetNbinsY();
  float pix;
  int ic,ir;
  for(ic=0; ic<nc; ic++) {
    for(ir=0; ir<nr; ir++) {
      pix = (float)(h->GetBinContent(ic,ir));
      if(pix<=eThr) h->SetBinContent(ic,ir,0);
      else h->SetBinContent(ic,ir,pix-eThr);
    }
  }
 
  float binmax = h->GetMaximum();
  printf("binmax = %f\n",binmax);
  unsigned char *buf = (unsigned char*)(frame->GetImage()->GetBuffer());
 
  for(ic=0; ic<nc; ic++) {
    for(ir=0; ir<nr; ir++) {
      pix = (float)(h->GetBinContent(ic,ir));
      if(pix>0)   {
    buf[nc*ir+ic] = (unsigned char)(255.*pix/binmax);
    npix++;
      }
      else buf[nc*ir+ic] =0;
    }
  }
  
  delete h;
  return npix;
}

InitTree()

TTree * EdbIP::InitTree

(

)

{
  TFile *f    = new TFile("clusters.root","RECREATE");
  f->cd();
  TTree *tree = new TTree("clust","clusters tree");  
 
  EdbClustP *cl = new EdbClustP();
  tree->Branch("cl","EdbClustP",&cl,32000,99);
 
  return tree;
  //  f.Close();
}

Peak12()

int EdbIP::Peak12 ( TH2F *  h, float  thr  )

static

{
  int xn[12] = { 1, -1, 0,  0, 1,  1, -1, -1, 2, 0,  0, -2 }; //pixel 12 suburbs
  int yn[12] = { 0,  0, 1, -1, 1, -1,  1, -1, 0, 2, -2,  0 };
 
  int nc = h->GetNbinsX();
  int nr = h->GetNbinsY();
  float pix,pp;
 
  float s4, s8;
  printf("hist: %d %d\n",nc,nr);
 
  int npeaks=0;
  for(int ic=2; ic<nc-3; ic++) {
    for(int ir=2; ir<nr-3; ir++) {
 
      pix = h->GetBinContent(ic,ir); 
      
      if( pix < thr) goto NEXTPIX;
      int in;
 
      s4=0;
      for(in=0; in<4; in++) {
    pp = h->GetBinContent( ic+xn[in], ir+yn[in] );
        if( pix < pp ) goto NEXTPIX;
    s4 += pp;
      }
 
      s8=0;
      for(in=4; in<12; in++) {
    pp = h->GetBinContent( ic+xn[in], ir+yn[in] );
        if( pix < pp ) goto NEXTPIX;
    s8 += pp;
      }
      s4 /= 4.;
      s8 /= 8.;
      if( s4  < s8+5 ) goto NEXTPIX;
      if( pix < s4+5 ) goto NEXTPIX;
 
      npeaks++;
      printf("peak12(%d,%d) =  %f \t %f\t %f\n",ic,ir,pix, s4,s8);
      h->SetBinContent(ic,ir,0,5000);
 
    NEXTPIX:
      continue;
    }
  }
 
  return npeaks;
}

Peak8()

int EdbIP::Peak8 ( TH2F *  h, float  thr  )

static

{
  int xn[8] = { 1, -1, 0,  0, 1,  1, -1, -1 }; //pixel 3x3 suburbs
  int yn[8] = { 0,  0, 1, -1, 1, -1,  1, -1 };
 
  int nc = h->GetNbinsX();
  int nr = h->GetNbinsY();
  float pix,pp;
 
  printf("hist: %d %d\n",nc,nr);
  int npeaks=0;
  int ic,ir,in;           // declare here to fix marazmatic eror messages of VC++
  for(ic=2; ic<nc-3; ic++) {
    for(ir=2; ir<nr-3; ir++) {
 
      pix = (float)(h->GetBinContent(ic,ir)); 
      if( pix < thr)   goto NEXTPIX;
 
      for(in=0; in<8; in++) {
    pp = (float)(h->GetBinContent( ic+xn[in], ir+yn[in] ));
        if( pix <= pp ) goto NEXTPIX;
      }
      printf("peak8(%d,%d) =  %f\n",ic,ir,pix); 
      npeaks++;
 
    NEXTPIX:
      continue;
    }
  }
 
  return npeaks;
}

SetFIR()

void EdbIP::SetFIR ( EdbFIRF *  fir )

inline

{eFIR = fir;}

SetThr()

void EdbIP::SetThr ( Float_t  thr )

inline

{eThr = thr;}

Member Data Documentation

eFIR

EdbFIRF* EdbIP::eFIR

private

eThr

Float_t EdbIP::eThr

private

---

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

• src/libEGA/EdbIP.h
• src/libEGA/EdbIP.cxx