3 // Author: Anders Vestbo <mailto:vestbo@fi.uib.no>
4 //*-- Copyright © ALICE HLT Group
7 #include "AliL3StandardIncludes.h"
14 #include "AliL3Logging.h"
15 #include "AliL3HoughMaxFinder.h"
16 #include "AliL3Histogram.h"
17 #include "AliL3TrackArray.h"
18 #include "AliL3HoughTrack.h"
19 #include "AliL3Transform.h"
20 #include "AliL3HoughTransformerRow.h"
26 /** \class AliL3HoughMaxFinder
28 //_____________________________________________________________
29 // AliL3HoughMaxFinder
36 ClassImp(AliL3HoughMaxFinder)
39 AliL3HoughMaxFinder::AliL3HoughMaxFinder()
43 fCurrentEtaSlice = -1;
49 fN1PeaksPrevEtaSlice=0;
50 fN2PeaksPrevEtaSlice=0;
65 AliL3HoughMaxFinder::AliL3HoughMaxFinder(Char_t *histotype,Int_t nmax,AliL3Histogram *hist)
69 //fTracks = new AliL3TrackArray("AliL3HoughTrack");
70 if(strcmp(histotype,"KappaPhi")==0) fHistoType='c';
71 if(strcmp(histotype,"DPsi")==0) fHistoType='l';
73 fCurrentEtaSlice = -1;
81 fXPeaks = new Float_t[fNMax];
82 fYPeaks = new Float_t[fNMax];
83 fWeight = new Int_t[fNMax];
84 fSTARTXPeaks = new Int_t[fNMax];
85 fSTARTYPeaks = new Int_t[fNMax];
86 fENDXPeaks = new Int_t[fNMax];
87 fENDYPeaks = new Int_t[fNMax];
88 fSTARTETAPeaks = new Int_t[fNMax];
89 fENDETAPeaks = new Int_t[fNMax];
96 AliL3HoughMaxFinder::~AliL3HoughMaxFinder()
106 delete [] fSTARTXPeaks;
108 delete [] fSTARTYPeaks;
110 delete [] fENDXPeaks;
112 delete [] fENDYPeaks;
114 delete [] fSTARTETAPeaks;
116 delete [] fENDETAPeaks;
123 void AliL3HoughMaxFinder::Reset()
125 // Method to reinit the Peak Finder
126 for(Int_t i=0; i<fNMax; i++)
139 fN1PeaksPrevEtaSlice=0;
140 fN2PeaksPrevEtaSlice=0;
143 void AliL3HoughMaxFinder::CreateNtuppel()
145 // Fill a NTuple with the peak parameters
147 //content#; neighbouring bins of the peak.
148 fNtuppel = new TNtuple("ntuppel","Peak charateristics","kappa:phi0:weigth:content3:content5:content1:content7");
149 fNtuppel->SetDirectory(0);
153 void AliL3HoughMaxFinder::WriteNtuppel(Char_t *filename)
155 // Write the NTuple with the peak parameters
157 TFile *file = TFile::Open(filename,"RECREATE");
160 cerr<<"AliL3HoughMaxFinder::WriteNtuppel : Error opening file "<<filename<<endl;
168 void AliL3HoughMaxFinder::FindAbsMaxima()
170 // Simple Peak Finder in the Hough space
173 cerr<<"AliL3HoughMaxFinder::FindAbsMaxima : No histogram"<<endl;
176 AliL3Histogram *hist = fCurrentHisto;
178 if(hist->GetNEntries() == 0)
181 Int_t xmin = hist->GetFirstXbin();
182 Int_t xmax = hist->GetLastXbin();
183 Int_t ymin = hist->GetFirstYbin();
184 Int_t ymax = hist->GetLastYbin();
186 Double_t value,maxvalue=0;
188 Int_t maxxbin=0,maxybin=0;
189 for(Int_t xbin=xmin; xbin<=xmax; xbin++)
191 for(Int_t ybin=ymin; ybin<=ymax; ybin++)
193 bin = hist->GetBin(xbin,ybin);
194 value = hist->GetBinContent(bin);
209 cerr<<"AliL3HoughMaxFinder::FindAbsMaxima : Array out of range : "<<fNPeaks<<endl;
213 Double_t maxx = hist->GetBinCenterX(maxxbin);
214 Double_t maxy = hist->GetBinCenterY(maxybin);
215 fXPeaks[fNPeaks] = maxx;
216 fYPeaks[fNPeaks] = maxy;
217 fWeight[fNPeaks] = (Int_t)maxvalue;
223 Int_t bin3 = hist->GetBin(maxxbin-1,maxybin);
224 Int_t bin5 = hist->GetBin(maxxbin+1,maxybin);
225 Int_t bin1 = hist->GetBin(maxxbin,maxybin-1);
226 Int_t bin7 = hist->GetBin(maxxbin,maxybin+1);
228 fNtuppel->Fill(maxx,maxy,maxvalue,hist->GetBinContent(bin3),hist->GetBinContent(bin5),hist->GetBinContent(bin1),hist->GetBinContent(bin7));
233 void AliL3HoughMaxFinder::FindBigMaxima()
235 // Another Peak finder
236 AliL3Histogram *hist = fCurrentHisto;
238 if(hist->GetNEntries() == 0)
241 Int_t xmin = hist->GetFirstXbin();
242 Int_t xmax = hist->GetLastXbin();
243 Int_t ymin = hist->GetFirstYbin();
244 Int_t ymax = hist->GetLastYbin();
245 Int_t bin[25],binindex;
248 for(Int_t xbin=xmin+2; xbin<xmax-3; xbin++)
250 for(Int_t ybin=ymin+2; ybin<ymax-3; ybin++)
253 for(Int_t xb=xbin-2; xb<=xbin+2; xb++)
255 for(Int_t yb=ybin-2; yb<=ybin+2; yb++)
257 bin[binindex]=hist->GetBin(xb,yb);
258 value[binindex]=hist->GetBinContent(bin[binindex]);
262 if(value[12]==0) continue;
266 if(value[b] > value[12] || b==binindex) break;
268 //printf("b %d\n",b);
275 cerr<<"AliL3HoughMaxFinder::FindBigMaxima : Array out of range "<<fNPeaks<<endl;
279 Double_t maxx = hist->GetBinCenterX(xbin);
280 Double_t maxy = hist->GetBinCenterY(ybin);
281 fXPeaks[fNPeaks] = maxx;
282 fYPeaks[fNPeaks] = maxy;
289 void AliL3HoughMaxFinder::FindMaxima(Int_t threshold)
291 //Locate all the maxima in input histogram.
292 //Maxima is defined as bins with more entries than the
293 //immediately neighbouring bins.
295 if(fCurrentHisto->GetNEntries() == 0)
298 Int_t xmin = fCurrentHisto->GetFirstXbin();
299 Int_t xmax = fCurrentHisto->GetLastXbin();
300 Int_t ymin = fCurrentHisto->GetFirstYbin();
301 Int_t ymax = fCurrentHisto->GetLastYbin();
305 //Float_t max_kappa = 0.001;
306 //Float_t max_phi0 = 0.08;
308 for(Int_t xbin=xmin+1; xbin<=xmax-1; xbin++)
310 for(Int_t ybin=ymin+1; ybin<=ymax-1; ybin++)
312 bin[0] = fCurrentHisto->GetBin(xbin-1,ybin-1);
313 bin[1] = fCurrentHisto->GetBin(xbin,ybin-1);
314 bin[2] = fCurrentHisto->GetBin(xbin+1,ybin-1);
315 bin[3] = fCurrentHisto->GetBin(xbin-1,ybin);
316 bin[4] = fCurrentHisto->GetBin(xbin,ybin);
317 bin[5] = fCurrentHisto->GetBin(xbin+1,ybin);
318 bin[6] = fCurrentHisto->GetBin(xbin-1,ybin+1);
319 bin[7] = fCurrentHisto->GetBin(xbin,ybin+1);
320 bin[8] = fCurrentHisto->GetBin(xbin+1,ybin+1);
321 value[0] = fCurrentHisto->GetBinContent(bin[0]);
322 value[1] = fCurrentHisto->GetBinContent(bin[1]);
323 value[2] = fCurrentHisto->GetBinContent(bin[2]);
324 value[3] = fCurrentHisto->GetBinContent(bin[3]);
325 value[4] = fCurrentHisto->GetBinContent(bin[4]);
326 value[5] = fCurrentHisto->GetBinContent(bin[5]);
327 value[6] = fCurrentHisto->GetBinContent(bin[6]);
328 value[7] = fCurrentHisto->GetBinContent(bin[7]);
329 value[8] = fCurrentHisto->GetBinContent(bin[8]);
332 if(value[4]>value[0] && value[4]>value[1] && value[4]>value[2]
333 && value[4]>value[3] && value[4]>value[5] && value[4]>value[6]
334 && value[4]>value[7] && value[4]>value[8])
336 //Found a local maxima
337 Float_t maxx = fCurrentHisto->GetBinCenterX(xbin);
338 Float_t maxy = fCurrentHisto->GetBinCenterY(ybin);
340 if((Int_t)value[4] <= threshold) continue;//central bin below threshold
343 cout<<"AliL3HoughMaxFinder::FindMaxima : Array out of range "<<fNPeaks<<endl;
347 //Check the gradient:
348 if(value[3]/value[4] > fGradX && value[5]/value[4] > fGradX)
351 if(value[1]/value[4] > fGradY && value[7]/value[4] > fGradY)
354 fXPeaks[fNPeaks] = maxx;
355 fYPeaks[fNPeaks] = maxy;
356 fWeight[fNPeaks] = (Int_t)value[4];
360 //Check if the peak is overlapping with a previous:
361 Bool_t bigger = kFALSE;
362 for(Int_t p=0; p<fNPeaks; p++)
364 if(fabs(maxx - fXPeaks[p]) < max_kappa && fabs(maxy - fYPeaks[p]) < max_phi0)
367 if(value[4] > fWeight[p]) //this peak is bigger.
371 fWeight[p] = (Int_t)value[4];
374 continue; //previous peak is bigger.
377 if(!bigger) //there were no overlapping peaks.
379 fXPeaks[fNPeaks] = maxx;
380 fYPeaks[fNPeaks] = maxy;
381 fWeight[fNPeaks] = (Int_t)value[4];
393 Int_t fStart; // Start
397 void AliL3HoughMaxFinder::FindAdaptedPeaks(Int_t kappawindow,Float_t cutratio)
399 //Peak finder which looks for peaks with a certain shape.
400 //The first step involves a pre-peak finder, which looks for peaks
401 //in windows (size controlled by kappawindow) summing over each psi-bin.
402 //These pre-preaks are then matched between neighbouring kappa-bins to
403 //look for real 2D peaks exhbiting the typical cross-shape in the Hough circle transform.
404 //The maximum bin within this region is marked as the peak itself, and
405 //a few checks is performed to avoid the clear fake peaks (asymmetry check etc.)
408 AliL3Histogram *hist = fCurrentHisto;
412 cerr<<"AliL3HoughMaxFinder : No histogram!"<<endl;
416 if(hist->GetNEntries() == 0)
419 Int_t xmin = hist->GetFirstXbin();
420 Int_t xmax = hist->GetLastXbin();
421 Int_t ymin = hist->GetFirstYbin();
422 Int_t ymax = hist->GetLastYbin();
425 //Start by looking for pre-peaks:
427 AliL3Window **localmaxima = new AliL3Window*[hist->GetNbinsY()];
429 Short_t *nmaxs = new Short_t[hist->GetNbinsY()];
432 for(Int_t ybin=ymin; ybin<=ymax; ybin++)
434 localmaxima[ybin-ymin] = new AliL3Window[hist->GetNbinsX()];
435 nmaxs[ybin-ymin] = 0;
439 for(Int_t xbin=xmin; xbin<=xmax-kappawindow; xbin++)
442 for(Int_t lbin=xbin; lbin<xbin+kappawindow; lbin++)
443 sum += hist->GetBinContent(hist->GetBin(lbin,ybin));
448 if(sumwasrising)//Previous sum was a local maxima
450 localmaxima[ybin-ymin][nmaxs[ybin-ymin]].fStart = xbin-1;
451 localmaxima[ybin-ymin][nmaxs[ybin-ymin]].fSum = lastsum;
464 Int_t *starts = new Int_t[hist->GetNbinsY()+1];
465 Int_t *maxs = new Int_t[hist->GetNbinsY()+1];
467 for(Int_t ybin=ymax; ybin >= ymin+1; ybin--)
469 for(Int_t i=0; i<nmaxs[ybin-ymin]; i++)
471 Int_t lw = localmaxima[ybin-ymin][i].fSum;
474 continue; //already used
476 Int_t maxvalue=0,maxybin=0,maxxbin=0,maxwindow=0;
477 for(Int_t k=localmaxima[ybin-ymin][i].fStart; k<localmaxima[ybin-ymin][i].fStart + kappawindow; k++)
478 if(hist->GetBinContent(hist->GetBin(k,ybin)) > maxvalue)
480 maxvalue = hist->GetBinContent(hist->GetBin(k,ybin));
485 //start expanding in the psi-direction:
487 Int_t lb = localmaxima[ybin-ymin][i].fStart;
489 starts[ybin] = localmaxima[ybin-ymin][i].fStart;
490 maxs[ybin] = maxxbin;
491 Int_t yl=ybin-1,nybins=1;
493 //cout<<"Starting search at ybin "<<ybin<<" start "<<lb<<" with sum "<<localmaxima[ybin-ymin][i].sum<<endl;
497 for(Int_t j=0; j<nmaxs[yl-ymin]; j++)
499 if( localmaxima[yl-ymin][j].fStart - lb < 0) continue;
500 if( localmaxima[yl-ymin][j].fStart < lb + kappawindow + match &&
501 localmaxima[yl-ymin][j].fStart >= lb && localmaxima[yl-ymin][j].fSum > 0)
504 //cout<<"match at ybin "<<yl<<" yvalue "<<hist->GetBinCenterY(yl)<<" start "<<localmaxima[yl-ymin][j].start<<" sum "<<localmaxima[yl-ymin][j].sum<<endl;
506 Int_t lmaxvalue=0,lmaxxbin=0;
507 for(Int_t k=localmaxima[yl-ymin][j].fStart; k<localmaxima[yl-ymin][j].fStart + kappawindow; k++)
509 if(hist->GetBinContent(hist->GetBin(k,yl)) > maxvalue)
511 maxvalue = hist->GetBinContent(hist->GetBin(k,yl));
516 if(hist->GetBinContent(hist->GetBin(k,yl)) > lmaxvalue)//local maxima value
518 lmaxvalue=hist->GetBinContent(hist->GetBin(k,yl));
523 starts[yl] = localmaxima[yl-ymin][j].fStart;
525 localmaxima[yl-ymin][j].fSum=-1; //Mark as used
527 lb = localmaxima[yl-ymin][j].fStart;
528 break;//Since we found a match in this bin, we dont have to search it anymore, goto next bin.
531 if(!found || yl == ymin)//no more local maximas to be matched, so write the final peak and break the expansion:
535 //cout<<"ystart "<<ystart<<" and nybins "<<nybins<<endl;
537 Bool_t truepeak=kTRUE;
539 //cout<<"Maxima found at xbin "<<maxxbin<<" ybin "<<maxybin<<" value "<<maxvalue<<endl;
540 //cout<<"Starting to sum at xbin "<<starts[maxybin-ymin]<<endl;
543 //Look in a window on both sides to probe the asymmetry
544 Float_t right=0,left=0;
545 for(Int_t w=maxxbin+1; w<=maxxbin+3; w++)
547 for(Int_t r=maxybin+1; r<=maxybin+3; r++)
549 right += (Float_t)hist->GetBinContent(hist->GetBin(w,r));
553 for(Int_t w=maxxbin-1; w>=maxxbin-3; w--)
555 for(Int_t r=maxybin+1; r<=maxybin+3; r++)
557 left += (Float_t)hist->GetBinContent(hist->GetBin(w,r));
561 //cout<<"ratio "<<right/left<<endl;
563 Float_t upperratio=1,lowerratio=1;
565 upperratio = right/left;
568 for(Int_t w=maxxbin+1; w<=maxxbin+3; w++)
570 for(Int_t r=maxybin-1; r>=maxybin-3; r--)
572 right += (Float_t)hist->GetBinContent(hist->GetBin(w,r));
576 for(Int_t w=maxxbin-1; w>=maxxbin-3; w--)
578 for(Int_t r=maxybin-1; r>=maxybin-3; r--)
580 left += (Float_t)hist->GetBinContent(hist->GetBin(w,r));
584 //cout<<"ratio "<<left/right<<endl;
587 lowerratio = left/right;
589 if(upperratio > cutratio || lowerratio > cutratio)
595 fXPeaks[fNPeaks] = hist->GetBinCenterX(maxxbin);
596 fYPeaks[fNPeaks] = hist->GetBinCenterY(maxybin);
597 fWeight[fNPeaks] = maxvalue;
601 //Calculate the peak using weigthed means:
604 for(Int_t k=maxybin-1; k<=maxybin+1; k++)
607 for(Int_t l=starts[k]; l<starts[k]+kappawindow; l++)
609 lsum += (Float_t)hist->GetBinContent(hist->GetBin(l,k));
610 sum += (Float_t)hist->GetBinContent(hist->GetBin(l,k));
612 fYPeaks[fNPeaks] += lsum*hist->GetBinCenterY(k);
614 fYPeaks[fNPeaks] /= sum;
616 if(fYPeaks[fNPeaks] < hist->GetBinCenterY(hist->FindYbin(fYPeaks[fNPeaks])))
618 ybin1 = hist->FindYbin(fYPeaks[fNPeaks])-1;
623 ybin1 = hist->FindYbin(fYPeaks[fNPeaks]);
627 Float_t kappa1=0,kappa2=0;
629 for(Int_t k=starts[ybin1]; k<starts[ybin1] + kappawindow; k++)
631 kappa1 += hist->GetBinCenterX(k)*hist->GetBinContent(hist->GetBin(k,ybin1));
632 sum += (Float_t)hist->GetBinContent(hist->GetBin(k,ybin1));
636 for(Int_t k=starts[ybin2]; k<starts[ybin2] + kappawindow; k++)
638 kappa2 += hist->GetBinCenterX(k)*hist->GetBinContent(hist->GetBin(k,ybin2));
639 sum += (Float_t)hist->GetBinContent(hist->GetBin(k,ybin2));
643 fXPeaks[fNPeaks] = ( kappa1*( hist->GetBinCenterY(ybin2) - fYPeaks[fNPeaks] ) +
644 kappa2*( fYPeaks[fNPeaks] - hist->GetBinCenterY(ybin1) ) ) /
645 (hist->GetBinCenterY(ybin2) - hist->GetBinCenterY(ybin1));
654 yl--;//Search continues...
659 for(Int_t i=0; i<hist->GetNbinsY(); i++)
660 delete localmaxima[i];
662 delete [] localmaxima;
670 Int_t fStartPosition; // Start position in X
671 Int_t fEndPosition; // End position in X
672 Int_t fMinValue; // Minimum value inside the prepeak
673 Int_t fMaxValue; // Maximum value inside the prepeak
674 Int_t fPrevValue; // Neighbour values
675 Int_t fLeftValue; // Neighbour values
676 Int_t fRightValue; // Neighbour values
679 void AliL3HoughMaxFinder::FindAdaptedRowPeaks(Int_t kappawindow,Int_t xsize,Int_t ysize)
681 // Peak finder which is working over the Hough Space provided by the AliL3HoughTransformerRow class
682 AliL3Histogram *hist = fCurrentHisto;
686 cerr<<"AliL3HoughMaxFinder : No histogram!"<<endl;
690 if(hist->GetNEntries() == 0)
693 Int_t xmin = hist->GetFirstXbin();
694 Int_t xmax = hist->GetLastXbin();
695 Int_t ymin = hist->GetFirstYbin();
696 Int_t ymax = hist->GetLastYbin();
697 Int_t nxbins = hist->GetNbinsX()+2;
698 Int_t *content = hist->GetContentArray();
700 //Start by looking for pre-peaks:
702 AliL3PreYPeak **localmaxima = new AliL3PreYPeak*[hist->GetNbinsY()];
704 Short_t *nmaxs = new Short_t[hist->GetNbinsY()];
705 memset(nmaxs,0,hist->GetNbinsY()*sizeof(Short_t));
706 Int_t lastvalue=0,value=0;
707 for(Int_t ybin=fNextRow[ymin]; ybin<=ymax; ybin = fNextRow[ybin+1])
709 localmaxima[ybin-ymin] = new AliL3PreYPeak[nxbins-2];
712 for(Int_t xbin=xmin; xbin<=xmax; xbin++)
714 value = content[xbin + nxbins*ybin]; //value = hist->GetBinContent(xbin + nxbins*ybin); //value = hist->GetBinContent(hist->GetBin(xbin,ybin));
717 if((value - lastvalue) > 1)
719 localmaxima[ybin-ymin][nmaxs[ybin-ymin]].fStartPosition = xbin;
720 localmaxima[ybin-ymin][nmaxs[ybin-ymin]].fEndPosition = xbin;
721 localmaxima[ybin-ymin][nmaxs[ybin-ymin]].fMinValue = value;
722 localmaxima[ybin-ymin][nmaxs[ybin-ymin]].fMaxValue = value;
723 localmaxima[ybin-ymin][nmaxs[ybin-ymin]].fPrevValue = 0;
724 localmaxima[ybin-ymin][nmaxs[ybin-ymin]].fLeftValue = lastvalue;
727 if(abs(value - lastvalue) <= 1)
730 localmaxima[ybin-ymin][nmaxs[ybin-ymin]].fEndPosition = xbin;
731 if(value>localmaxima[ybin-ymin][nmaxs[ybin-ymin]].fMaxValue)
732 localmaxima[ybin-ymin][nmaxs[ybin-ymin]].fMaxValue = value;
733 if(value<localmaxima[ybin-ymin][nmaxs[ybin-ymin]].fMinValue)
734 localmaxima[ybin-ymin][nmaxs[ybin-ymin]].fMinValue = value;
737 if((value - lastvalue) < -1)
740 localmaxima[ybin-ymin][nmaxs[ybin-ymin]].fRightValue = value;
749 localmaxima[ybin-ymin][nmaxs[ybin-ymin]].fRightValue = value;
758 localmaxima[ybin-ymin][nmaxs[ybin-ymin]].fRightValue = 0;
763 AliL3Pre2DPeak maxima[500];
766 for(Int_t ybin=ymax; ybin >= ymin; ybin--)
768 for(Int_t i=0; i<nmaxs[ybin-ymin]; i++)
770 Int_t localminvalue = localmaxima[ybin-ymin][i].fMinValue;
771 Int_t localmaxvalue = localmaxima[ybin-ymin][i].fMaxValue;
772 Int_t localprevvalue = localmaxima[ybin-ymin][i].fPrevValue;
773 Int_t localnextvalue = 0;
774 Int_t localleftvalue = localmaxima[ybin-ymin][i].fLeftValue;
775 Int_t localrightvalue = localmaxima[ybin-ymin][i].fRightValue;
778 continue; //already used
780 //start expanding in the psi-direction:
782 Int_t localxstart = localmaxima[ybin-ymin][i].fStartPosition;
783 Int_t localxend = localmaxima[ybin-ymin][i].fEndPosition;
784 Int_t tempxstart = localmaxima[ybin-ymin][i].fStartPosition;
785 Int_t tempxend = localmaxima[ybin-ymin][i].fEndPosition;
787 Int_t localy=ybin-1,nybins=1;
789 while(localy >= ymin)
792 for(Int_t j=0; j<nmaxs[localy-ymin]; j++)
794 if( (localmaxima[localy-ymin][j].fStartPosition <= (tempxend + kappawindow)) && (localmaxima[localy-ymin][j].fEndPosition >= (tempxstart - kappawindow)))
796 if((localmaxima[localy-ymin][j].fMinValue <= localmaxvalue) && (localmaxima[localy-ymin][j].fMaxValue >= localminvalue))
798 if(localmaxima[localy-ymin][j].fEndPosition > localxend)
799 localxend = localmaxima[localy-ymin][j].fEndPosition;
800 if(localmaxima[localy-ymin][j].fStartPosition < localxstart)
801 localxstart = localmaxima[localy-ymin][j].fStartPosition;
802 tempxstart = localmaxima[localy-ymin][j].fStartPosition;
803 tempxend = localmaxima[localy-ymin][j].fEndPosition;
804 if(localmaxima[localy-ymin][j].fMinValue < localminvalue)
805 localminvalue = localmaxima[localy-ymin][j].fMinValue;
806 if(localmaxima[localy-ymin][j].fMaxValue > localmaxvalue)
807 localmaxvalue = localmaxima[localy-ymin][j].fMaxValue;
808 if(localmaxima[localy-ymin][j].fRightValue > localrightvalue)
809 localrightvalue = localmaxima[localy-ymin][j].fRightValue;
810 if(localmaxima[localy-ymin][j].fLeftValue > localleftvalue)
811 localleftvalue = localmaxima[localy-ymin][j].fLeftValue;
812 localmaxima[localy-ymin][j].fMinValue = -1;
819 if(localmaxvalue > localmaxima[localy-ymin][j].fPrevValue)
820 localmaxima[localy-ymin][j].fPrevValue = localmaxvalue;
821 if(localmaxima[localy-ymin][j].fMaxValue > localnextvalue)
822 localnextvalue = localmaxima[localy-ymin][j].fMaxValue;
826 if(!found || localy == ymin)//no more local maximas to be matched, so write the final peak and break the expansion:
828 if((nybins > ysize) && ((localxend-localxstart+1) > xsize) && (localmaxvalue > localprevvalue) && (localmaxvalue > localnextvalue) && (localmaxvalue > localleftvalue) && (localmaxvalue > localrightvalue))
829 // if((nybins > ysize) && ((localxend-localxstart+1) > xsize))
831 maxima[nmaxima].fX = ((Float_t)localxstart+(Float_t)localxend)/2.0;
832 maxima[nmaxima].fY = ((Float_t)ybin+(Float_t)(localy+1))/2.0;
833 maxima[nmaxima].fSizeX = localxend-localxstart+1;
834 maxima[nmaxima].fSizeY = nybins;
835 maxima[nmaxima].fWeight = (localminvalue+localmaxvalue)/2;
836 maxima[nmaxima].fStartX = localxstart;
837 maxima[nmaxima].fEndX = localxend;
838 maxima[nmaxima].fStartY = localy +1;
839 maxima[nmaxima].fEndY = ybin;
841 // cout<<"Peak found at: "<<((Float_t)localxstart+(Float_t)localxend)/2.0<<" "<<((Float_t)ybin+(Float_t)(localy+1))/2.0<<" "<<localminvalue<<" "<<localmaxvalue<<" "<<" with weight "<<(localminvalue+localmaxvalue)/2<<" and size "<<localxend-localxstart+1<<" by "<<nybins<<endl;
848 localy--;//Search continues...
855 for(Int_t i = 0; i < (nmaxima - 1); i++)
857 // if(maxima[i].fWeight < 0) continue;
858 for(Int_t j = i + 1; j < nmaxima; j++)
860 // if(maxima[j].fWeight < 0) continue;
861 MergeRowPeaks(&maxima[i],&maxima[j],5.0);
865 //merge tracks in neighbour eta slices
866 Int_t currentnpeaks = fNPeaks;
867 for(Int_t i = 0; i < nmaxima; i++) {
868 if(maxima[i].fWeight < 0) continue;
869 Bool_t merged = kFALSE;
870 for(Int_t j = fN1PeaksPrevEtaSlice; j < fN2PeaksPrevEtaSlice; j++) {
871 // if(fWeight[j] < 0) continue;
872 // Merge only peaks with limited size in eta
873 if((fENDETAPeaks[j]-fSTARTETAPeaks[j]) >= 2) continue;
874 if((maxima[i].fStartX <= fENDXPeaks[j]+1) && (maxima[i].fEndX >= fSTARTXPeaks[j]-1) && (maxima[i].fStartY <= fENDYPeaks[j]+1) && (maxima[i].fEndY >= fSTARTYPeaks[j]-1)){
878 fXPeaks[fNPeaks] = (hist->GetPreciseBinCenterX(maxima[i].fX)+(fENDETAPeaks[j]-fSTARTETAPeaks[j]+1)*fXPeaks[j])/(fENDETAPeaks[j]-fSTARTETAPeaks[j]+2);
879 fYPeaks[fNPeaks] = (hist->GetPreciseBinCenterY(maxima[i].fY)+(fENDETAPeaks[j]-fSTARTETAPeaks[j]+1)*fYPeaks[j])/(fENDETAPeaks[j]-fSTARTETAPeaks[j]+2);
880 fSTARTXPeaks[fNPeaks] = maxima[i].fStartX;
881 fSTARTYPeaks[fNPeaks] = maxima[i].fStartY;
882 fENDXPeaks[fNPeaks] = maxima[i].fEndX;
883 fENDYPeaks[fNPeaks] = maxima[i].fEndY;
885 fWeight[fNPeaks] = abs((Int_t)maxima[i].fWeight) + abs(fWeight[j]);
886 fSTARTETAPeaks[fNPeaks] = fSTARTETAPeaks[j];
887 fENDETAPeaks[fNPeaks] = fCurrentEtaSlice;
890 fWeight[j] = -abs(fWeight[j]);
893 fXPeaks[fNPeaks] = hist->GetPreciseBinCenterX(maxima[i].fX);
894 fYPeaks[fNPeaks] = hist->GetPreciseBinCenterY(maxima[i].fY);
896 fWeight[fNPeaks] = abs((Int_t)maxima[i].fWeight);
898 fWeight[fNPeaks] = -abs((Int_t)maxima[i].fWeight);
899 fSTARTXPeaks[fNPeaks] = maxima[i].fStartX;
900 fSTARTYPeaks[fNPeaks] = maxima[i].fStartY;
901 fENDXPeaks[fNPeaks] = maxima[i].fEndX;
902 fENDYPeaks[fNPeaks] = maxima[i].fEndY;
903 fSTARTETAPeaks[fNPeaks] = fCurrentEtaSlice;
904 fENDETAPeaks[fNPeaks] = fCurrentEtaSlice;
908 fN1PeaksPrevEtaSlice = currentnpeaks;
909 fN2PeaksPrevEtaSlice = fNPeaks;
911 for(Int_t ybin=fNextRow[ymin]; ybin<=ymax; ybin = fNextRow[ybin+1])
912 delete [] localmaxima[ybin-ymin];
914 delete [] localmaxima;
918 void AliL3HoughMaxFinder::FindPeak1(Int_t ywindow,Int_t xbinsides)
920 //Testing mutliple peakfinding.
921 //The algorithm searches the histogram for prepreaks by looking in windows
922 //for each bin on the xaxis. The size of these windows is controlled by ywindow.
923 //Then the prepreaks are sorted according to their weight (sum inside window),
924 //and the peak positions are calculated by taking the weighted mean in both
925 //x and y direction. The size of the peak in x-direction is controlled by xbinsides.
929 printf("AliL3HoughMaxFinder::FindPeak1 : No input histogram\n");
932 if(fCurrentHisto->GetNEntries()==0)
938 //Float_t max_kappa = 0.001;
939 //Float_t max_phi0 = 0.08;
943 Int_t xmin = fCurrentHisto->GetFirstXbin();
944 Int_t xmax = fCurrentHisto->GetLastXbin();
945 Int_t ymin = fCurrentHisto->GetFirstYbin();
946 Int_t ymax = fCurrentHisto->GetLastYbin();
947 Int_t nbinsx = fCurrentHisto->GetNbinsX()+1;
949 AliL3AxisWindow **windowPt = new AliL3AxisWindow*[nbinsx];
950 AliL3AxisWindow **anotherPt = new AliL3AxisWindow*[nbinsx];
952 for(Int_t i=0; i<nbinsx; i++)
954 windowPt[i] = new AliL3AxisWindow;
955 #if defined(__DECCXX)
956 bzero((char *)windowPt[i],sizeof(AliL3AxisWindow));
958 bzero((void*)windowPt[i],sizeof(AliL3AxisWindow));
960 anotherPt[i] = windowPt[i];
963 for(Int_t xbin=xmin; xbin<=xmax; xbin++)
966 for(Int_t ybin=ymin; ybin<=ymax-ywindow; ybin++)
969 for(Int_t b=ybin; b<ybin+ywindow; b++)
972 Int_t bin = fCurrentHisto->GetBin(xbin,b);
973 suminwindow += (Int_t)fCurrentHisto->GetBinContent(bin);
976 if(suminwindow > maxsum)
978 maxsum = suminwindow;
979 windowPt[xbin]->fYmin = ybin;
980 windowPt[xbin]->fYmax = ybin + ywindow;
981 windowPt[xbin]->fWeight = suminwindow;
982 windowPt[xbin]->fXbin = xbin;
987 //Sort the windows according to the weight
988 SortPeaks(windowPt,0,nbinsx);
991 for(Int_t i=0; i<nbinsx; i++)
994 Int_t xbin = windowPt[i]->fXbin;
996 if(xbin<xmin || xbin > xmax-1) continue;
998 //Check if this is really a local maxima
999 if(anotherPt[xbin-1]->fWeight > anotherPt[xbin]->fWeight ||
1000 anotherPt[xbin+1]->fWeight > anotherPt[xbin]->fWeight)
1003 for(Int_t j=windowPt[i]->fYmin; j<windowPt[i]->fYmax; j++)
1005 //Calculate the mean in y direction:
1006 Int_t bin = fCurrentHisto->GetBin(windowPt[i]->fXbin,j);
1007 top += (fCurrentHisto->GetBinCenterY(j))*(fCurrentHisto->GetBinContent(bin));
1008 butt += fCurrentHisto->GetBinContent(bin);
1011 if(butt < fThreshold)
1014 fXPeaks[fNPeaks] = fCurrentHisto->GetBinCenterX(windowPt[i]->fXbin);
1015 fYPeaks[fNPeaks] = top/butt;
1016 fWeight[fNPeaks] = (Int_t)butt;
1017 //cout<<"mean in y "<<ypeaks[n]<<" on x "<<windowPt[i]->xbin<<" content "<<butt<<endl;
1021 cerr<<"AliL3HoughMaxFinder::FindPeak1 : Peak array out of range!!!"<<endl;
1027 //Improve the peaks by including the region around in x.
1031 for(Int_t i=0; i<fNPeaks; i++)
1033 Int_t xbin = fCurrentHisto->FindXbin(fXPeaks[i]);
1034 if(xbin - xbinsides < xmin || xbin + xbinsides > xmax) continue;
1038 prev = xbin - xbinsides+1;
1039 for(Int_t j=xbin-xbinsides; j<=xbin+xbinsides; j++)
1042 //Check if the windows are overlapping:
1043 if(anotherPt[j]->ymin > anotherPt[prev]->ymax) {prev=j; continue;}
1044 if(anotherPt[j]->ymax < anotherPt[prev]->ymin) {prev=j; continue;}
1048 top += fCurrentHisto->GetBinCenterX(j)*anotherPt[j]->fWeight;
1049 butt += anotherPt[j]->fWeight;
1051 for(Int_t k=anotherPt[j]->fYmin; k<anotherPt[j]->fYmax; k++)
1053 Int_t bin = fCurrentHisto->GetBin(j,k);
1054 ytop += (fCurrentHisto->GetBinCenterY(k))*(fCurrentHisto->GetBinContent(bin));
1055 ybutt += fCurrentHisto->GetBinContent(bin);
1056 w+=(Int_t)fCurrentHisto->GetBinContent(bin);
1060 fXPeaks[i] = top/butt;
1061 fYPeaks[i] = ytop/ybutt;
1063 //cout<<"Setting weight "<<w<<" kappa "<<fXPeaks[i]<<" phi0 "<<fYPeaks[i]<<endl;
1066 //Check if this peak is overlapping with a previous:
1067 for(Int_t p=0; p<i; p++)
1069 //cout<<fabs(fXPeaks[p] - fXPeaks[i])<<" "<<fabs(fYPeaks[p] - fYPeaks[i])<<endl;
1070 if(fabs(fXPeaks[p] - fXPeaks[i]) < max_kappa &&
1071 fabs(fYPeaks[p] - fYPeaks[i]) < max_phi0)
1080 for(Int_t i=0; i<nbinsx; i++)
1083 delete [] anotherPt;
1086 void AliL3HoughMaxFinder::SortPeaks(struct AliL3AxisWindow **a,Int_t first,Int_t last)
1088 //General sorting routine
1089 //Sort according to PeakCompare()
1091 static struct AliL3AxisWindow *tmp;
1092 static int i; // "static" to save stack space
1095 while (last - first > 1) {
1099 while (++i < last && PeakCompare(a[i], a[first]) < 0)
1101 while (--j > first && PeakCompare(a[j], a[first]) > 0)
1117 if (j - first < last - (j + 1)) {
1118 SortPeaks(a, first, j);
1119 first = j + 1; // QSort(j + 1, last);
1121 SortPeaks(a, j + 1, last);
1122 last = j; // QSort(first, j);
1128 Int_t AliL3HoughMaxFinder::PeakCompare(struct AliL3AxisWindow *a,struct AliL3AxisWindow *b) const
1130 // Peak comparison based on peaks weight
1131 if(a->fWeight < b->fWeight) return 1;
1132 if(a->fWeight > b->fWeight) return -1;
1136 void AliL3HoughMaxFinder::FindPeak(Int_t t1,Double_t t2,Int_t t3)
1138 //Attempt of a more sophisticated peak finder.
1139 //Finds the best peak in the histogram, and returns the corresponding
1144 printf("AliL3HoughMaxFinder::FindPeak : No histogram!!\n");
1147 AliL3Histogram *hist = fCurrentHisto;
1148 if(hist->GetNEntries()==0)
1151 Int_t xmin = hist->GetFirstXbin();
1152 Int_t xmax = hist->GetLastXbin();
1153 Int_t ymin = hist->GetFirstYbin();
1154 Int_t ymax = hist->GetLastYbin();
1155 Int_t nbinsx = hist->GetNbinsX()+1;
1157 Int_t *m = new Int_t[nbinsx];
1158 Int_t *mlow = new Int_t[nbinsx];
1159 Int_t *mup = new Int_t[nbinsx];
1162 recompute: //this is a goto.
1164 for(Int_t i=0; i<nbinsx; i++)
1171 Int_t maxx=0,sum=0,maxxbin=0,bin=0;
1173 for(Int_t xbin=xmin; xbin<=xmax; xbin++)
1175 for(Int_t ybin=ymin; ybin <= ymax - t1; ybin++)
1178 for(Int_t y=ybin; y <= ybin+t1; y++)
1182 bin = hist->GetBin(xbin,y);
1183 sum += (Int_t)hist->GetBinContent(bin);
1186 if(sum > m[xbin]) //Max value locally in this xbin
1190 mup[xbin]=ybin + t1;
1195 if(m[xbin] > maxx) //Max value globally in x-direction
1198 maxx = m[xbin];//sum;
1201 //printf("maxxbin %d maxx %d mlow %d mup %d\n",maxxbin,maxx,mlow[maxxbin],mup[maxxbin]);
1202 //printf("ylow %f yup %f\n",hist->GetBinCenterY(mlow[maxxbin]),hist->GetBinCenterY(mup[maxxbin]));
1204 //Determine a width in the x-direction
1207 for(Int_t xbin=maxxbin-1; xbin >= xmin; xbin--)
1209 if(m[xbin] < maxx*t2)
1215 for(Int_t xbin = maxxbin+1; xbin <=xmax; xbin++)
1217 if(m[xbin] < maxx*t2)
1224 Double_t top=0,butt=0,value,xpeak;
1225 if(xup - xlow + 1 > t3)
1228 printf("\nxrange out if limit xup %d xlow %d t1 %d\n\n",xlow,xup,t1);
1233 xpeak = hist->GetBinCenterX(maxxbin);
1238 //printf("xlow %f xup %f\n",hist->GetBinCenterX(xlow),hist->GetBinCenterX(xup));
1239 //printf("Spread in x %d\n",xup-xlow +1);
1241 //Now, calculate the center of mass in x-direction
1242 for(Int_t xbin=xlow; xbin <= xup; xbin++)
1244 value = hist->GetBinCenterX(xbin);
1245 top += value*m[xbin];
1252 //Find the peak in y direction:
1253 Int_t xl = hist->FindXbin(xpeak);
1254 if(hist->GetBinCenterX(xl) > xpeak)
1259 if(hist->GetBinCenterX(xl) > xpeak || hist->GetBinCenterX(xu) <= xpeak)
1260 printf("\nAliL3HoughMaxFinder::FindPeak : Wrong xrange %f %f %f\n\n",hist->GetBinCenterX(xl),xpeak,hist->GetBinCenterX(xu));
1262 //printf("\nxlow %f xup %f\n",hist->GetBinCenterX(xl),hist->GetBinCenterX(xu));
1266 //printf("ylow %f yup %f\n",hist->GetBinCenterY(mlow[xl]),hist->GetBinCenterY(mup[xl]));
1267 //printf("ylow %f yup %f\n",hist->GetBinCenterY(mlow[xu]),hist->GetBinCenterY(mup[xu]));
1269 for(Int_t ybin=mlow[xl]; ybin <= mup[xl]; ybin++)
1271 value = hist->GetBinCenterY(ybin);
1272 bin = hist->GetBin(xl,ybin);
1273 top += value*hist->GetBinContent(bin);
1274 butt += hist->GetBinContent(bin);
1276 Double_t ypeaklow = top/butt;
1278 //printf("ypeaklow %f\n",ypeaklow);
1281 for(Int_t ybin=mlow[xu]; ybin <= mup[xu]; ybin++)
1283 value = hist->GetBinCenterY(ybin);
1284 bin = hist->GetBin(xu,ybin);
1285 top += value*hist->GetBinContent(bin);
1286 butt += hist->GetBinContent(bin);
1288 Double_t ypeakup = top/butt;
1290 //printf("ypeakup %f\n",ypeakup);
1292 Double_t xvalueup = hist->GetBinCenterX(xu);
1293 Double_t xvaluelow = hist->GetBinCenterX(xl);
1295 Double_t ypeak = (ypeaklow*(xvalueup - xpeak) + ypeakup*(xpeak - xvaluelow))/(xvalueup - xvaluelow);
1299 //bin = hist->FindBin(xpeak,ypeak);
1300 //Int_t weight = (Int_t)hist->GetBinContent(bin);
1302 //AliL3HoughTrack *track = new AliL3HoughTrack();
1303 //track->SetTrackParameters(xpeak,ypeak,weight);
1304 fXPeaks[fNPeaks]=xpeak;
1305 fYPeaks[fNPeaks]=ypeak;
1306 fWeight[fNPeaks]=(Int_t)hist->GetBinContent(bin);
1316 Float_t AliL3HoughMaxFinder::GetXPeakSize(Int_t i) const
1318 // Get X size of a peak
1321 STDCERR<<"AliL3HoughMaxFinder::GetXPeakSize : Invalid index "<<i<<STDENDL;
1324 Float_t binwidth = fCurrentHisto->GetBinWidthX();
1325 return binwidth*(fENDXPeaks[i]-fSTARTXPeaks[i]+1);
1328 Float_t AliL3HoughMaxFinder::GetYPeakSize(Int_t i) const
1330 // Get Y size of a peak
1333 STDCERR<<"AliL3HoughMaxFinder::GetYPeak : Invalid index "<<i<<STDENDL;
1336 Float_t binwidth = fCurrentHisto->GetBinWidthY();
1337 return binwidth*(fENDYPeaks[i]-fSTARTYPeaks[i]+1);
1340 Bool_t AliL3HoughMaxFinder::MergeRowPeaks(AliL3Pre2DPeak *maxima1, AliL3Pre2DPeak *maxima2, Float_t distance)
1342 // Check the distance between tracks corresponding to given Hough space peaks and if the
1343 // distance is smaller than some threshold value marks the smaller peak as fake
1344 AliL3Histogram *hist = fCurrentHisto;
1345 Int_t nxbins = hist->GetNbinsX()+2;
1347 Int_t xtrack1=0,xtrack2=0,ytrack1=0,ytrack2=0;
1348 Int_t deltax = 9999;
1349 for(Int_t ix1 = maxima1->fStartX; ix1 <= maxima1->fEndX; ix1++) {
1350 for(Int_t ix2 = maxima2->fStartX; ix2 <= maxima2->fEndX; ix2++) {
1351 if(abs(ix1 - ix2) < deltax) {
1352 deltax = abs(ix1 - ix2);
1358 Int_t deltay = 9999;
1359 for(Int_t iy1 = maxima1->fStartY; iy1 <= maxima1->fEndY; iy1++) {
1360 for(Int_t iy2 = maxima2->fStartY; iy2 <= maxima2->fEndY; iy2++) {
1361 if(abs(iy1 - iy2) < deltay) {
1362 deltay = abs(iy1 - iy2);
1368 Int_t firstrow1 = fTrackFirstRow[xtrack1 + nxbins*ytrack1];
1369 Int_t lastrow1 = fTrackLastRow[xtrack1 + nxbins*ytrack1];
1370 Int_t firstrow2 = fTrackFirstRow[xtrack1 + nxbins*ytrack1];
1371 Int_t lastrow2 = fTrackLastRow[xtrack1 + nxbins*ytrack1];
1372 Int_t firstrow,lastrow;
1373 if(firstrow1 < firstrow2)
1374 firstrow = firstrow2;
1376 firstrow = firstrow1;
1378 if(lastrow1 > lastrow2)
1383 AliL3HoughTrack track1;
1384 Float_t x1 = hist->GetPreciseBinCenterX(xtrack1);
1385 Float_t y1 = hist->GetPreciseBinCenterY(ytrack1);
1386 Float_t psi1 = atan((x1-y1)/(AliL3HoughTransformerRow::GetBeta1()-AliL3HoughTransformerRow::GetBeta2()));
1387 Float_t kappa1 = 2.0*(x1*cos(psi1)-AliL3HoughTransformerRow::GetBeta1()*sin(psi1));
1388 track1.SetTrackParameters(kappa1,psi1,1);
1389 Float_t firsthit1[3];
1390 if(!track1.GetCrossingPoint(firstrow,firsthit1)) return kFALSE;
1391 Float_t lasthit1[3];
1392 if(!track1.GetCrossingPoint(lastrow,lasthit1)) return kFALSE;
1394 AliL3HoughTrack track2;
1395 Float_t x2 = hist->GetPreciseBinCenterX(xtrack2);
1396 Float_t y2 = hist->GetPreciseBinCenterY(ytrack2);
1397 Float_t psi2 = atan((x2-y2)/(AliL3HoughTransformerRow::GetBeta1()-AliL3HoughTransformerRow::GetBeta2()));
1398 Float_t kappa2 = 2.0*(x2*cos(psi2)-AliL3HoughTransformerRow::GetBeta1()*sin(psi2));
1399 track2.SetTrackParameters(kappa2,psi2,1);
1400 Float_t firsthit2[3];
1401 if(!track2.GetCrossingPoint(firstrow,firsthit2)) return kFALSE;
1402 Float_t lasthit2[3];
1403 if(!track2.GetCrossingPoint(lastrow,lasthit2)) return kFALSE;
1405 Float_t padpitchlow = AliL3Transform::GetPadPitchWidth(AliL3Transform::GetPatch(firstrow));
1406 Float_t padpitchup = AliL3Transform::GetPadPitchWidth(AliL3Transform::GetPatch(lastrow));
1407 // check the distance between tracks at the edges
1408 // cout<<"Check "<<firsthit1[1]<<" "<<firsthit2[1]<<" "<<padpitchlow<<" "<<lasthit1[1]<<" "<<lasthit2[1]<<" "<<padpitchup<<" "<<xtrack1<<" "<<ytrack1<<" "<<xtrack2<<" "<<ytrack2<<endl;
1409 if((fabs(firsthit1[1]-firsthit2[1])/padpitchlow + fabs(lasthit1[1]-lasthit2[1])/padpitchup) < distance) {
1410 if(maxima1->fSizeX*maxima1->fSizeY > maxima2->fSizeX*maxima2->fSizeY)
1411 maxima2->fWeight = -fabs(maxima2->fWeight);
1412 if(maxima1->fSizeX*maxima1->fSizeY < maxima2->fSizeX*maxima2->fSizeY)
1413 maxima1->fWeight = -fabs(maxima1->fWeight);
1414 if(maxima1->fSizeX*maxima1->fSizeY == maxima2->fSizeX*maxima2->fSizeY) {
1415 if(maxima1->fStartX > maxima2->fStartX)
1416 maxima1->fStartX = maxima2->fStartX;
1417 if(maxima1->fStartY > maxima2->fStartY)
1418 maxima1->fStartY = maxima2->fStartY;
1419 if(maxima1->fEndX < maxima2->fEndX)
1420 maxima1->fEndX = maxima2->fEndX;
1421 if(maxima1->fEndY < maxima2->fEndY)
1422 maxima1->fEndY = maxima2->fEndY;
1423 maxima1->fX = ((Float_t)maxima1->fStartX + (Float_t)maxima1->fEndX)/2.0;
1424 maxima1->fY = ((Float_t)maxima1->fStartY + (Float_t)maxima1->fEndY)/2.0;
1425 maxima1->fSizeX = (maxima1->fEndX - maxima1->fStartX + 1);
1426 maxima1->fSizeY = (maxima1->fEndY - maxima1->fStartY + 1);
1427 maxima2->fWeight = -fabs(maxima2->fWeight);