--- /dev/null
+/**************************************************************************
+ * Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *
+ * *
+ * Author: The ALICE Off-line Project. *
+ * Contributors are mentioned in the code where appropriate. *
+ * *
+ * Permission to use, copy, modify and distribute this software and its *
+ * documentation strictly for non-commercial purposes is hereby granted *
+ * without fee, provided that the above copyright notice appears in all *
+ * copies and that both the copyright notice and this permission notice *
+ * appear in the supporting documentation. The authors make no claims *
+ * about the suitability of this software for any purpose. It is *
+ * provided "as is" without express or implied warranty. *
+ **************************************************************************/
+
+/* $Id$ */
+
+/// \class AliMUONClusterFinderMLEM
+///
+/// Clusterizer class based on the Expectation-Maximization algorithm
+///
+/// Pre-clustering is handled by AliMUONPreClusterFinder
+/// From a precluster a pixel array is built, and from this pixel array
+/// a list of clusters is output (using AliMUONClusterSplitterMLEM).
+///
+/// \author Laurent Aphecetche (for the "new" C++ structure) and
+/// Alexander Zinchenko, JINR Dubna, for the hardcore of it ;-)
+
+#include "AliMUONClusterFinderMLEM.h"
+
+#include "AliLog.h"
+#include "AliMUONCluster.h"
+#include "AliMUONClusterSplitterMLEM.h"
+#include "AliMUONDigit.h"
+#include "AliMUONPad.h"
+#include "AliMUONPreClusterFinder.h"
+#include "AliMpPad.h"
+#include "AliMpVPadIterator.h"
+#include "AliMpVSegmentation.h"
+#include "AliRunLoader.h"
+#include <Riostream.h>
+#include <TH2.h>
+#include <TMinuit.h>
+#include "TCanvas.h"
+#include "TStopwatch.h"
+
+/// \cond CLASSIMP
+ClassImp(AliMUONClusterFinderMLEM)
+/// \endcond
+
+const Double_t AliMUONClusterFinderMLEM::fgkZeroSuppression = 6; // average zero suppression value
+const Double_t AliMUONClusterFinderMLEM::fgkSaturation = 3000; // average saturation level
+const Double_t AliMUONClusterFinderMLEM::fgkDistancePrecision = 1e-6; // (cm) used to check overlaps and so on
+const TVector2 AliMUONClusterFinderMLEM::fgkIncreaseSize(-AliMUONClusterFinderMLEM::fgkDistancePrecision,-AliMUONClusterFinderMLEM::fgkDistancePrecision);
+const TVector2 AliMUONClusterFinderMLEM::fgkDecreaseSize(AliMUONClusterFinderMLEM::fgkDistancePrecision,AliMUONClusterFinderMLEM::fgkDistancePrecision);
+
+ TMinuit* AliMUONClusterFinderMLEM::fgMinuit = 0x0;
+
+//_____________________________________________________________________________
+AliMUONClusterFinderMLEM::AliMUONClusterFinderMLEM(Bool_t plot)
+ : AliMUONVClusterFinder(),
+fPreClusterFinder(new AliMUONPreClusterFinder),
+fPreCluster(0x0),
+fClusterList(),
+fEventNumber(0),
+fDetElemId(-1),
+fClusterNumber(0),
+fZpad(0.0),
+fReco(1),
+fCathBeg(0),
+fPixArray(new TObjArray(20)),
+fDebug(1),
+fPlot(plot),
+fTimers(new TObjArray(kLast)),
+fSplitter(0x0),
+fNClusters(0),
+fNAddVirtualPads(0)
+{
+ /// Constructor
+
+ fSegmentation[1] = fSegmentation[0] = 0x0;
+
+ fPadBeg[0] = fPadBeg[1] = fCathBeg;
+
+ if (!fgMinuit) fgMinuit = new TMinuit(8);
+
+ fTimers->SetOwner(kTRUE);
+
+ for ( Int_t i = 0; i < kLast; ++i )
+ {
+ TStopwatch* t = new TStopwatch;
+ fTimers->AddLast(new TStopwatch);
+ t->Start(kTRUE);
+ t->Stop();
+ }
+}
+
+//_____________________________________________________________________________
+AliMUONClusterFinderMLEM::~AliMUONClusterFinderMLEM()
+{
+/// Destructor
+ delete fgMinuit; fgMinuit = 0; delete fPixArray; fPixArray = 0;
+// delete fDraw;
+ delete fPreClusterFinder;
+ for ( Int_t i = 0; i < kLast; ++i )
+ {
+ AliInfo(Form("Timer %d",i));
+ Timer(i)->Print();
+ }
+ delete fTimers;
+ delete fSplitter;
+ AliInfo(Form("Total clusters %d AddVirtualPad needed %d",
+ fNClusters,fNAddVirtualPads));
+}
+
+//_____________________________________________________________________________
+Bool_t
+AliMUONClusterFinderMLEM::Prepare(const AliMpVSegmentation* segmentations[2],
+ TClonesArray* digits[2])
+{
+ /// Prepare for clustering
+
+ for ( Int_t i = 0; i < 2; ++i )
+ {
+ fSegmentation[i] = segmentations[i];
+ }
+
+ // Find out the DetElemId
+ fDetElemId = -1;
+
+ for ( Int_t i = 0; i < 2; ++i )
+ {
+ AliMUONDigit* d = static_cast<AliMUONDigit*>(digits[i]->First());
+ if (d)
+ {
+ fDetElemId = d->DetElemId();
+ break;
+ }
+ }
+
+ if ( fDetElemId < 0 )
+ {
+ AliWarning("Could not find DE. Probably no digits at all ?");
+ return kFALSE;
+ }
+
+ delete fSplitter;
+ fSplitter = new AliMUONClusterSplitterMLEM(fDetElemId,fPixArray);
+
+ // find out current event number, and reset the cluster number
+ fEventNumber = AliRunLoader::GetRunLoader()->GetEventNumber();
+ fClusterNumber = -1;
+ fClusterList.Delete();
+
+// AliDebug(3,Form("EVT %d DE %d",fEventNumber,fDetElemId));
+
+ return fPreClusterFinder->Prepare(segmentations,digits);
+}
+
+//_____________________________________________________________________________
+AliMUONCluster*
+AliMUONClusterFinderMLEM::NextCluster()
+{
+ /// Return next cluster
+
+ ++fClusterNumber;
+
+ // if the list of clusters is not void, pick one from there
+ if ( fClusterList.GetLast() >= 0 )
+ {
+ TObject* o = fClusterList.At(0);
+ fClusterList.RemoveAt(0);
+ return static_cast<AliMUONCluster*>(o);
+ }
+
+ //FIXME : at this point, must check whether we've used all the digits
+ //from precluster : if not, let the preclustering know about those unused
+ //digits, so it can reuse them
+
+ // if the cluster list is exhausted, we need to go to the next
+ // pre-cluster and treat it
+
+ fPreCluster = fPreClusterFinder->NextCluster();
+
+ if (!fPreCluster)
+ {
+ // we are done
+ return 0x0;
+ }
+
+ fClusterList.Delete(); // reset the list of clusters for this pre-cluster
+
+ WorkOnPreCluster();
+
+ // WorkOnPreCluster may have used only part of the pads, so we check that
+ // now, and let the unused pads be reused by the preclustering...
+
+ for ( Int_t i = 0; i < fPreCluster->Multiplicity(); ++i )
+ {
+ AliMUONPad* pad = fPreCluster->Pad(i);
+ if ( !pad->IsUsed() )
+ {
+ fPreClusterFinder->UsePad(*pad);
+ }
+ }
+
+ return NextCluster();
+}
+
+//_____________________________________________________________________________
+Bool_t
+AliMUONClusterFinderMLEM::WorkOnPreCluster()
+{
+ /// Starting from a precluster, builds a pixel array, and then
+ /// extract clusters from this array
+
+ AliMUONCluster* cluster = CheckPrecluster(*fPreCluster);
+
+ if (!cluster) return kFALSE;
+
+ BuildPixArray(*cluster);
+
+ if ( fPixArray->GetLast() < 0 )
+ {
+ AliDebug(1,"No pixel for the above cluster");
+ delete cluster;
+ return kFALSE;
+ }
+
+ // Use MLEM for cluster finder
+ Int_t nMax = 1, localMax[100], maxPos[100];
+ Double_t maxVal[100];
+
+ if (cluster->Multiplicity() > 50)
+ {
+ nMax = FindLocalMaxima(fPixArray, localMax, maxVal);
+ }
+
+ if (nMax > 1)
+ {
+ TMath::Sort(nMax, maxVal, maxPos, kTRUE); // in decreasing order
+ }
+
+ Int_t iSimple = 0, nInX = -1, nInY;
+
+ PadsInXandY(*cluster,nInX, nInY);
+
+ if (nMax == 1 && nInX < 4 && nInY < 4)
+ {
+ iSimple = 1; //1; // simple cluster
+ }
+
+ for (Int_t i=0; i<nMax; ++i)
+ {
+ if (nMax > 1)
+ {
+ FindCluster(*cluster,localMax, maxPos[i]);
+ }
+ Timer(kMainLoop)->Start(kFALSE);
+ MainLoop(*cluster,iSimple);
+ Timer(kMainLoop)->Stop();
+ if (i < nMax-1)
+ {
+ for (Int_t j=0; j<cluster->Multiplicity(); ++j)
+ {
+ AliMUONPad* pad = cluster->Pad(j);
+ if ( pad->Status() == 0 ) continue; // pad charge was not modified
+ pad->SetStatus(0);
+ pad->RevertCharge(); // use backup charge value
+ }
+ }
+ } // for (Int_t i=0; i<nMax;
+ if (nMax > 1) ((TH2D*) gROOT->FindObject("anode"))->Delete();
+ TH2D *mlem = (TH2D*) gROOT->FindObject("mlem");
+ if (mlem) mlem->Delete();
+ delete cluster;
+ return kTRUE;
+}
+
+//_____________________________________________________________________________
+Bool_t
+AliMUONClusterFinderMLEM::Overlap(const AliMUONPad& pad, const AliMUONPad& pixel)
+{
+ /// Check if the pad and the pixel overlaps
+
+ // make a fake pad from the pixel
+ AliMUONPad tmp(pad.DetElemId(),pad.Cathode(),pad.Ix(),pad.Iy(),
+ pixel.Coord(0),pixel.Coord(1),
+ pixel.Size(0),pixel.Size(1),0);
+
+ return AliMUONPad::AreOverlapping(pad,tmp,fgkDecreaseSize);
+}
+
+//_____________________________________________________________________________
+AliMUONCluster*
+AliMUONClusterFinderMLEM::CheckPrecluster(const AliMUONCluster& origCluster)
+{
+ /// Check precluster in order to attempt to simplify it (mostly for
+ /// two-cathode preclusters)
+
+ if (origCluster.Multiplicity()==1)
+ {
+ // Disregard one-pad clusters (leftovers from splitting)
+ return 0x0;
+ }
+
+ Timer(kCheckPreCluster)->Start(kFALSE);
+
+
+ AliMUONCluster* cluster = static_cast<AliMUONCluster*>(origCluster.Clone());
+
+ cluster->Sort();
+
+ AliDebug(2,"Start of CheckPreCluster=");
+ StdoutToAliDebug(2,cluster->Print("full"));
+
+ // Check if one-cathode precluster
+ Int_t i1 = cluster->Multiplicity(0) ? 0 : 1;
+ Int_t i2 = cluster->Multiplicity(1) ? 1 : 0;
+
+ AliMUONCluster* rv(0x0);
+
+ if (i1 != i2)
+ {
+ rv = CheckPreclusterTwoCathodes(cluster);
+ }
+ else
+ {
+ rv = CheckPreclusterOneCathode(cluster);
+ }
+ Timer(kCheckPreCluster)->Stop();
+ return rv;
+}
+
+//_____________________________________________________________________________
+AliMUONCluster*
+AliMUONClusterFinderMLEM::CheckPreclusterOneCathode(AliMUONCluster* cluster)
+{
+ /// Check single-cathode precluster
+ AliWarning("Reimplement me!");
+ AliDebug(2,"End of CheckPreClusterOneCathode=");
+ StdoutToAliDebug(2,cluster->Print("full"));
+
+ return cluster;
+}
+
+//_____________________________________________________________________________
+AliMUONCluster*
+AliMUONClusterFinderMLEM::CheckPreclusterTwoCathodes(AliMUONCluster* cluster)
+{
+ // Check two-cathode cluster
+
+ Int_t i1 = cluster->Multiplicity(0) ? 0 : 1;
+ Int_t i2 = cluster->Multiplicity(1) ? 1 : 0;
+
+ Int_t npad = cluster->Multiplicity();
+ Int_t* flags = new Int_t[npad];
+ memset(flags,0,npad*sizeof(Int_t));
+
+ // Check pad overlaps
+ for ( Int_t i=0; i<npad; ++i)
+ {
+ AliMUONPad* padi = cluster->Pad(i);
+ if ( padi->Cathode() != i1 ) continue;
+ for (Int_t j=i+1; j<npad; ++j)
+ {
+ AliMUONPad* padj = cluster->Pad(j);
+ if ( padj->Cathode() != i2 ) continue;
+ if ( !AliMUONPad::AreOverlapping(*padi,*padj,fgkDecreaseSize) ) continue;
+ flags[i] = flags[j] = 1; // mark overlapped pads
+ }
+ }
+
+ // Check if all pads overlap
+ Int_t nFlags=0;
+ for (Int_t i=0; i<npad; ++i)
+ {
+ if (flags[i]) continue;
+ ++nFlags;
+ }
+
+ if (nFlags > 0)
+ {
+ // not all pads overlap.
+ for (Int_t i=0; i<npad; ++i)
+ {
+ AliMUONPad* pad = cluster->Pad(i);
+ if (flags[i]) continue;
+ Int_t cath = pad->Cathode();
+ Int_t cath1 = TMath::Even(cath);
+ // Check for edge effect (missing pads on the _other_ cathode)
+ AliMpPad mpPad = fSegmentation[cath1]->PadByPosition(pad->Position(),kFALSE);
+ if (!mpPad.IsValid()) continue;
+ AliDebug(2,Form("Releasing the following pad : de,cath,ix,iy %d,%d,%d,%d charge %e",
+ fDetElemId,pad->Cathode(),pad->Ix(),pad->Iy(),pad->Charge()));
+ cluster->RemovePad(pad);
+ fPreCluster->Pad(i)->Release();
+ --npad;
+ }
+ }
+
+ // Check correlations of cathode charges
+ if ( !cluster->IsSaturated() && cluster->ChargeAsymmetry()*2 > 1 )
+ {
+ // big difference
+ Int_t cathode = cluster->MaxRawChargeCathode();
+ Int_t imin(0);
+ Int_t imax(0);
+ Double_t cmax(0);
+ Double_t cmin(1E9);
+
+ // get min and max pad charges on the cathode opposite to the
+ // max pad (given by MaxRawChargeCathode())
+ //
+ for ( Int_t i = 0; i < cluster->Multiplicity(); ++i )
+ {
+ AliMUONPad* pad = cluster->Pad(i);
+ if ( pad->Cathode() != cathode || !pad->IsReal() )
+ {
+ // only consider pads in the opposite cathode, and
+ // onyl consider real pads (i.e. exclude the virtual ones)
+ continue;
+ }
+ if ( pad->Charge() < cmin )
+ {
+ cmin = pad->Charge();
+ imin = i;
+ }
+ if ( pad->Charge() > cmax )
+ {
+ cmax = pad->Charge();
+ imax = i;
+ }
+ }
+ AliDebug(2,Form("Pad imin,imax %d,%d cmin,cmax %e,%e",
+ imin,imax,cmin,cmax));
+ //
+ // arrange pads according to their distance to the max, normalized
+ // to the pad size
+ Double_t* dist = new Double_t[cluster->Multiplicity()];
+ Double_t dxMin(1E9);
+ Double_t dyMin(1E9);
+ Double_t dmin(0);
+
+ AliMUONPad* padmax = cluster->Pad(imax);
+
+ for ( Int_t i = 0; i < cluster->Multiplicity(); ++i )
+ {
+ dist[i] = 0.0;
+ if ( i == imax) continue;
+ AliMUONPad* pad = cluster->Pad(i);
+ if ( pad->Cathode() != cathode || !pad->IsReal() ) continue;
+ Double_t dx = (pad->X()-padmax->X())/padmax->DX()/2.0;
+ Double_t dy = (pad->Y()-padmax->Y())/padmax->DY()/2.0;
+ dist[i] = TMath::Sqrt(dx*dx+dy*dy);
+ if ( i == imin )
+ {
+ dmin = dist[i] + 1E-3; // distance to the pad with minimum charge
+ dxMin = dx;
+ dyMin = dy;
+ }
+ }
+
+ TMath::Sort(cluster->Multiplicity(),dist,flags,kFALSE); // in ascending order
+ Double_t xmax(-1);
+ TObjArray toBeRemoved;
+
+ for ( Int_t i = 0; i < cluster->Multiplicity(); ++i )
+ {
+ Int_t indx = flags[i];
+ AliMUONPad* pad = cluster->Pad(indx);
+ if ( pad->Cathode() != cathode || !pad->IsReal() ) continue;
+ if ( dist[indx] > dmin )
+ {
+ // farther than the minimum pad
+ Double_t dx = (pad->X()-padmax->X())/padmax->DX()/2.0;
+ Double_t dy = (pad->Y()-padmax->Y())/padmax->DY()/2.0;
+ dx *= dxMin;
+ dy *= dyMin;
+ if (dx >= 0 && dy >= 0) continue;
+ if (TMath::Abs(dx) > TMath::Abs(dy) && dx >= 0) continue;
+ if (TMath::Abs(dy) > TMath::Abs(dx) && dy >= 0) continue;
+ }
+ if ( pad->Charge() <= cmax || TMath::Abs(dist[indx]-xmax) < 1E-3 )
+ {
+ // release pad
+ if (TMath::Abs(dist[indx]-xmax) < 1.e-3)
+ {
+ cmax = TMath::Max(pad->Charge(),cmax);
+ }
+ else
+ {
+ cmax = pad->Charge();
+ }
+ xmax = dist[indx];
+ AliDebug(2,Form("Releasing the following pad : de,cath,ix,iy %d,%d,%d,%d charge %e",
+ fDetElemId,pad->Cathode(),pad->Ix(),pad->Iy(),
+ pad->Charge()));
+
+ toBeRemoved.AddLast(pad);
+ fPreCluster->Pad(indx)->Release();
+ }
+ }
+ for ( Int_t i = 0; i <= toBeRemoved.GetLast(); ++i )
+ {
+ cluster->RemovePad(static_cast<AliMUONPad*>(toBeRemoved.At(i)));
+ }
+ delete[] dist;
+ }
+
+ delete[] flags;
+
+ AliDebug(2,"End of CheckPreClusterTwoCathodes=");
+ StdoutToAliDebug(2,cluster->Print("full"));
+
+ return cluster;
+}
+
+//_____________________________________________________________________________
+void
+AliMUONClusterFinderMLEM::CheckOverlaps()
+{
+ /// For debug only : check if some pixels overlap...
+
+ Int_t nPix = fPixArray->GetLast()+1;
+ Int_t dummy(0);
+
+ for ( Int_t i = 0; i < nPix; ++i )
+ {
+ AliMUONPad* pixelI = Pixel(i);
+ AliMUONPad pi(dummy,dummy,dummy,dummy,
+ pixelI->Coord(0),pixelI->Coord(1),
+ pixelI->Size(0),pixelI->Size(1),0.0);
+
+ for ( Int_t j = i+1; j < nPix; ++j )
+ {
+ AliMUONPad* pixelJ = Pixel(j);
+ AliMUONPad pj(dummy,dummy,dummy,dummy,
+ pixelJ->Coord(0),pixelJ->Coord(1),
+ pixelJ->Size(0),pixelJ->Size(1),0.0);
+ AliMpArea area;
+
+ if ( AliMUONPad::AreOverlapping(pi,pj,fgkDecreaseSize,area) )
+ {
+ AliInfo(Form("The following 2 pixels (%d and %d) overlap !",i,j));
+ StdoutToAliInfo(pixelI->Print();
+ cout << " Surface = " << pixelI->Size(0)*pixelI->Size(1)*4 << endl;
+ pixelJ->Print();
+ cout << " Surface = " << pixelJ->Size(0)*pixelJ->Size(1)*4 << endl;
+ cout << " Area surface = " << area.Dimensions().X()*area.Dimensions().Y()*4 << endl;
+ cout << "-------" << endl;
+ );
+
+ }
+ }
+ }
+}
+
+//_____________________________________________________________________________
+void AliMUONClusterFinderMLEM::BuildPixArray(AliMUONCluster& cluster)
+{
+ /// Build pixel array for MLEM method
+
+ Int_t npad = cluster.Multiplicity();
+ if (npad<=0)
+ {
+ AliWarning("Got no pad at all ?!");
+ }
+
+ fPixArray->Delete();
+
+ if ( !cluster.Multiplicity(0) || !cluster.Multiplicity(1) )
+ {
+ BuildPixArrayOneCathode(cluster);
+ }
+ else
+ {
+ BuildPixArrayTwoCathodes(cluster);
+ }
+
+ fPixArray->Sort(); // FIXME : not really needed, only to compare with ClusterFinderAZ
+
+ Int_t nPix = fPixArray->GetLast()+1;
+
+// AliDebug(2,Form("nPix after BuildPixArray=%d",nPix));
+
+ Double_t xPadMin(1E9);
+ Double_t yPadMin(1E9);
+
+ for ( Int_t i = 0; i < cluster.Multiplicity(); ++i )
+ {
+ AliMUONPad* pad = cluster.Pad(i);
+ xPadMin = TMath::Min (xPadMin, pad->DX());
+ yPadMin = TMath::Min (yPadMin, pad->DY());
+ }
+
+ Double_t wxmin(1E9);
+ Double_t wymin(1E9);
+
+ for ( Int_t i = 0; i < nPix; ++i )
+ {
+ AliMUONPad* pixPtr = Pixel(i);
+ wxmin = TMath::Min(wxmin, pixPtr->Size(0));
+ wymin = TMath::Min(wymin, pixPtr->Size(1));
+ }
+
+ wxmin = TMath::Abs (wxmin - xPadMin/2) > 0.001 ? xPadMin : xPadMin / 2;
+ wymin = TMath::Abs (wymin - yPadMin/2) > 0.001 ? yPadMin : yPadMin / 2;
+
+ // Check if small pixel X-size
+ AdjustPixel(cluster,wxmin, 0);
+ // Check if small pixel Y-size
+ AdjustPixel(cluster,wymin, 1);
+ // Check if large pixel size
+ AdjustPixel(wxmin, wymin);
+
+ // Remove discarded pixels
+ for (Int_t i=0; i<nPix; ++i)
+ {
+ AliMUONPad* pixPtr = Pixel(i);
+ if (pixPtr->Charge() < 1)
+ {
+ AliDebug(2,Form("Removing pixel %d with charge<1 : ",i));
+ StdoutToAliDebug(2,pixPtr->Print());
+ RemovePixel(i);
+ }
+ }
+
+ fPixArray->Compress();
+ nPix = fPixArray->GetEntriesFast();
+
+// AliDebug(2,Form("nPix after AdjustPixel=%d",nPix));
+
+ if ( nPix > cluster.Multiplicity() )
+ {
+// AliDebug(2,Form("Will trim number of pixels to number of pads"));
+
+ // Too many pixels - sort and remove pixels with the lowest signal
+ fPixArray->Sort();
+ for ( Int_t i = cluster.Multiplicity(); i<nPix; ++i )
+ {
+ RemovePixel(i);
+ }
+ fPixArray->Compress();
+ nPix = fPixArray->GetEntriesFast();
+ } // if (nPix > npad)
+
+// StdoutToAliDebug(2,cout << "End of BuildPixelArray:" << endl;
+// fPixArray->Print(););
+ CheckOverlaps();//FIXME : this is for debug only. Remove it.
+}
+
+//_____________________________________________________________________________
+void AliMUONClusterFinderMLEM::BuildPixArrayOneCathode(AliMUONCluster& cluster)
+{
+ /// From a single-cathode cluster, build the pixel array
+
+// AliDebug(2,Form("cluster.Multiplicity=%d",cluster.Multiplicity()));
+
+ for ( Int_t j=0; j<cluster.Multiplicity(); ++j)
+ {
+ AliMUONPad* pad = cluster.Pad(j);
+ AliMUONPad* pixPtr = new AliMUONPad(pad->Position(),pad->Dimensions(),
+ pad->Charge());
+ fPixArray->Add(pixPtr);
+ }
+}
+
+//_____________________________________________________________________________
+void AliMUONClusterFinderMLEM::BuildPixArrayTwoCathodes(AliMUONCluster& cluster)
+{
+ /// From a two-cathodes cluster, build the pixel array
+
+// AliDebug(2,Form("cluster.Multiplicity=%d",cluster.Multiplicity()));
+
+ Int_t i1 = cluster.Pad(0)->Cathode();
+ Int_t i2 = TMath::Even(i1);
+
+ for ( Int_t i = 0; i < cluster.Multiplicity(); ++i)
+ {
+ AliMUONPad* padi = cluster.Pad(i);
+ if (padi->Cathode() != i1) continue;
+
+ for ( Int_t j = 1; j < cluster.Multiplicity(); ++j)
+ {
+ AliMUONPad* padj = cluster.Pad(j);
+ if (padj->Cathode() != i2) continue;
+
+ AliMpArea overlap;
+
+ if ( AliMUONPad::AreOverlapping(*padi,*padj,fgkDecreaseSize,overlap) )
+ {
+ AliMUONPad* pixPtr = new AliMUONPad(overlap.Position(),
+ overlap.Dimensions(),
+ TMath::Min(padi->Charge(),padj->Charge()));
+ if ( ( padi->Charge() <= padj->Charge() && padi->IsSaturated() ) ||
+ ( padj->Charge() < padi->Charge() && padj->IsSaturated() ) )
+ {
+ // if smallest charge of the 2 pads is already above saturation, then
+ // the pixel is saturated...
+ pixPtr->SetSaturated(kTRUE);
+ }
+ pixPtr->SetReal(kFALSE);
+ fPixArray->Add(pixPtr);
+ }
+ }
+ }
+}
+
+//_____________________________________________________________________________
+void AliMUONClusterFinderMLEM::AdjustPixel(AliMUONCluster& cluster,
+ Float_t width, Int_t ixy)
+{
+ /// Check if some pixels have small size (adjust if necessary)
+
+ AliDebug(2,Form("width=%e ixy=%d",width,ixy));
+
+ AliMUONPad *pixPtr, *pixPtr1 = 0;
+ Int_t ixy1 = TMath::Even(ixy);
+ Int_t nPix = fPixArray->GetEntriesFast();
+
+ for (Int_t i=0; i<nPix; i++)
+ {
+ pixPtr = Pixel(i);
+ if (pixPtr->Charge() < 1) continue; // discarded pixel
+ if (pixPtr->Size(ixy)-width < -1.e-4)
+ {
+ // try to merge
+ for (Int_t j=i+1; j<nPix; j++)
+ {
+ pixPtr1 = Pixel(j);
+ if (pixPtr1->Charge() < 1) continue; // discarded pixel
+ if (TMath::Abs(pixPtr1->Size(ixy)-width) < fgkDistancePrecision) continue; // right size
+ if (TMath::Abs(pixPtr1->Coord(ixy1)-pixPtr->Coord(ixy1)) > fgkDistancePrecision) continue; // different rows/columns
+ if (TMath::Abs(pixPtr1->Coord(ixy)-pixPtr->Coord(ixy)) < 2*width)
+ {
+ // merge
+ Double_t tmp = pixPtr->Coord(ixy) + pixPtr1->Size(ixy)*
+ TMath::Sign (1., pixPtr1->Coord(ixy) - pixPtr->Coord(ixy));
+ pixPtr->SetCoord(ixy, tmp);
+ pixPtr->SetSize(ixy, width);
+ pixPtr->SetCharge(TMath::Min (pixPtr->Charge(),pixPtr1->Charge()));
+ pixPtr1->SetCharge(0);
+ pixPtr1 = 0;
+ break;
+ }
+ } // for (Int_t j=i+1;
+ if (pixPtr1 || i == nPix-1)
+ {
+ // edge pixel - just increase its size
+ for (Int_t j=0; j<cluster.Multiplicity(); ++j)
+ {
+ AliMUONPad* pad = cluster.Pad(j);
+ Double_t d = ( ixy == 0 ) ? pad->X() : ( ixy == 1 ) ? pad->Y() : -1E9;
+
+ if (pixPtr->Coord(ixy) < d)
+ {
+ pixPtr->Shift(ixy, pixPtr->Size(ixy)-width);
+ }
+ else
+ {
+ pixPtr->Shift(ixy, -pixPtr->Size(ixy)+width);
+ }
+ pixPtr->SetSize(ixy, width);
+ break;
+ }
+ }
+ } // if (pixPtr->Size(ixy)-width < -1.e-4)
+ } // for (Int_t i=0; i<nPix;
+}
+
+//_____________________________________________________________________________
+void AliMUONClusterFinderMLEM::AdjustPixel(Double_t wxmin, Double_t wymin)
+{
+/// Check if some pixels have large size (adjust if necessary)
+
+ AliDebug(2,Form("wxmin=%e wymin=%e",wxmin,wymin));
+
+ Int_t n1[2], n2[2], iOK = 1, nPix = fPixArray->GetEntriesFast();
+ AliMUONPad *pixPtr, pix;
+ Double_t xy0[2] = {9999, 9999}, wxy[2], dist[2] = {0};
+
+ // Check if large pixel size
+ for (Int_t i = 0; i < nPix; i++) {
+ pixPtr = (AliMUONPad*) fPixArray->UncheckedAt(i);
+ if (pixPtr->Charge() < 1) continue; // discarded pixel
+ if (pixPtr->Size(0) - wxmin < 1.e-4) {
+ if (xy0[0] > 9998) xy0[0] = pixPtr->Coord(0); // position of a "normal" pixel
+ if (pixPtr->Size(1) - wymin < 1.e-4) {
+ if (xy0[1] > 9998) xy0[1] = pixPtr->Coord(1); // position of a "normal" pixel
+ continue;
+ } else iOK = 0; // large pixel
+ } else {
+ iOK = 0; // large pixel
+ if (xy0[1] > 9998 && pixPtr->Size(1) - wymin < 1.e-4) xy0[1] = pixPtr->Coord(1); // "normal" pixel
+ }
+ if (xy0[0] < 9998 && xy0[1] < 9998) break;
+ }
+ if (iOK) return;
+
+ wxy[0] = wxmin;
+ wxy[1] = wymin;
+ //cout << xy0[0] << " " << xy0[1] << endl;
+ for (Int_t i = 0; i < nPix; i++) {
+ pixPtr = (AliMUONPad*) fPixArray->UncheckedAt(i);
+ if (pixPtr->Charge() < 1) continue; // discarded pixel
+ n1[0] = n1[1] = 999;
+ n2[0] = n2[1] = 1;
+ for (Int_t j = 0; j < 2; j++) {
+ if (pixPtr->Size(j) - wxy[j] < 1.e-4) continue;
+ dist[j] = (pixPtr->Coord(j) - xy0[j]) / wxy[j] / 2; // normalized distance to "normal" pixel
+ n2[j] = TMath::Nint (pixPtr->Size(j) / wxy[j]);
+ n1[j] = n2[j] == 1 ? TMath::Nint(dist[j]) : (Int_t)dist[j];
+ }
+ if (n1[0] > 998 && n1[1] > 998) continue;
+ if (fDebug) cout << " Different " << pixPtr->Size(0) << " " << wxy[0] << " "
+ << pixPtr->Size(1) << " " << wxy[1] <<endl;
+
+ if (n2[0] > 2 || n2[1] > 2) {
+ //cout << n2[0] << " " << n2[1] << endl;
+ if (n2[0] > 2 && n1[0] < 999) n1[0]--;
+ if (n2[1] > 2 && n1[1] < 999) n1[1]--;
+ }
+ //cout << n1[0] << " " << n2[0] << " " << n1[1] << " " << n2[1] << endl;
+ pix = *pixPtr;
+ pix.SetSize(0, wxy[0]); pix.SetSize(1, wxy[1]);
+ //pixPtr->Print();
+ for (Int_t ii = 0; ii < n2[0]; ii++) {
+ if (n1[0] < 999) pix.SetCoord(0, xy0[0] + (n1[0] + TMath::Sign(1.,dist[0]) * ii) * 2 * wxy[0]);
+ for (Int_t jj = 0; jj < n2[1]; jj++) {
+ if (n1[1] < 999) pix.SetCoord(1, xy0[1] + (n1[1] + TMath::Sign(1.,dist[1]) * jj) * 2 * wxy[1]);
+ fPixArray->Add(new AliMUONPad(pix));
+ //pix.Print();
+ }
+ }
+ pixPtr->SetCharge(0);
+ } // for (Int_t i = 0; i < nPix;
+}
+
+//_____________________________________________________________________________
+void
+AliMUONClusterFinderMLEM::Plot(const char* basename)
+{
+ /// Make a plot and save it as png
+
+ if (!fPlot) return;
+
+ TCanvas* c = new TCanvas("MLEM","MLEM",800,600);
+ c->Draw();
+ Draw();
+ c->Modified();
+ c->Update();
+ c->Print(Form("%s.EVT%d.DE%d.CLU%d.png",basename,fEventNumber,
+ fDetElemId,fClusterNumber));
+}
+
+//_____________________________________________________________________________
+void
+AliMUONClusterFinderMLEM::ComputeCoefficients(AliMUONCluster& cluster,
+ Double_t* coef,
+ Double_t* probi)
+{
+ /// Compute coefficients needed for MLEM algorithm
+
+ Int_t nPix = fPixArray->GetLast()+1;
+
+ memset(probi,0,nPix*sizeof(Double_t));
+
+ for ( Int_t j=0; j<cluster.Multiplicity(); ++j )
+ {
+ AliMUONPad* pad = cluster.Pad(j);
+ Int_t indx = j*nPix;
+
+ for ( Int_t ipix=0; ipix<nPix; ++ipix )
+ {
+ Int_t indx1 = indx + ipix;
+ if (pad->Status() < 0)
+ {
+ coef[indx1] = 0;
+ continue;
+ }
+ AliMUONPad* pixPtr = Pixel(ipix);
+ // coef is the charge (given by Mathieson integral) on pad, assuming
+ // the Mathieson is center at pixel.
+ coef[indx1] = fSplitter->ChargeIntegration(pixPtr->Coord(0), pixPtr->Coord(1), *pad);
+// AliDebug(2,Form("pad=(%d,%d,%e,%e,%e,%e) pix=(%e,%e,%e,%e) coef %e",
+// pad->Ix(),pad->Iy(),
+// pad->X(),pad->Y(),
+// pad->DX(),pad->DY(),
+// pixPtr->Coord(0),pixPtr->Coord(1),
+// pixPtr->Size(0),pixPtr->Size(1),
+// coef[indx1]));
+
+ probi[ipix] += coef[indx1];
+ }
+ }
+}
+
+//_____________________________________________________________________________
+Bool_t AliMUONClusterFinderMLEM::MainLoop(AliMUONCluster& cluster, Int_t iSimple)
+{
+ /// Repeat MLEM algorithm until pixel size becomes sufficiently small
+
+ Int_t nPix = fPixArray->GetLast()+1;
+
+ AliDebug(2,Form("nPix=%d iSimple=%d, precluster=",nPix,iSimple));
+ StdoutToAliDebug(2,cluster.Print("full"););
+
+ if ( nPix < 0 )
+ {
+ AliDebug(1,"No pixels, why am I here then ?");
+ }
+
+ AddVirtualPad(cluster); // add virtual pads if necessary
+
+ Int_t npadTot = cluster.Multiplicity();
+ Int_t npadOK = 0;
+ for (Int_t i = 0; i < npadTot; ++i)
+ {
+ if (cluster.Pad(i)->Status() == 0) ++npadOK;
+ }
+
+ TH2D* mlem(0x0);
+ Double_t* coef(0x0);
+ Double_t* probi(0x0);
+ Int_t lc(0); // loop counter (for debug)
+
+ Plot("mlem.start");
+
+ while (1)
+ {
+ ++lc;
+ mlem = (TH2D*) gROOT->FindObject("mlem");
+ delete mlem;
+
+ AliDebug(2,Form("lc %d nPix %d(%d) npadTot %d npadOK %d",lc,nPix,fPixArray->GetLast()+1,npadTot,npadOK));
+ AliDebug(2,Form("EVT%d PixArray=",fEventNumber));
+ StdoutToAliDebug(2,fPixArray->Print("","full"));
+
+ coef = new Double_t [npadTot*nPix];
+ probi = new Double_t [nPix];
+
+ // Calculate coefficients and pixel visibilities
+ ComputeCoefficients(cluster,coef,probi);
+
+ for (Int_t ipix=0; ipix<nPix; ++ipix)
+ {
+ if (probi[ipix] < 0.01)
+ {
+ AliMUONPad* pixel = Pixel(ipix);
+ AliDebug(2,Form("Setting the following pixel to invisible as its probi<0.01:"));
+ StdoutToAliDebug(2,cout << Form(" -- ipix %3d --- "); pixel->Print(););
+ pixel->SetCharge(0); // "invisible" pixel
+ }
+ }
+
+ // MLEM algorithm
+ Mlem(cluster,coef, probi, 15);
+
+ Double_t xylim[4] = {999, 999, 999, 999};
+ AliMUONPad* pixPtr(0x0);
+
+ for ( Int_t ipix=0; ipix<nPix; ++ipix )
+ {
+ pixPtr = Pixel(ipix);
+ for ( Int_t i=0; i<4; ++i )
+ {
+ xylim[i] = TMath::Min (xylim[i], (i%2 ? -1 : 1)*pixPtr->Coord(i/2));
+ }
+ }
+ for (Int_t i=0; i<4; i++)
+ {
+ xylim[i] -= pixPtr->Size(i/2);
+ }
+
+
+ Int_t nx = TMath::Nint ((-xylim[1]-xylim[0])/pixPtr->Size(0)/2);
+ Int_t ny = TMath::Nint ((-xylim[3]-xylim[2])/pixPtr->Size(1)/2);
+
+// StdoutToAliDebug(2,cout << "pixel used for nx,ny computation : "; pixPtr->Print(););
+ AliDebug(2,Form("lc %d pixPtr size = %e,%e nx,ny=%d,%d xylim=%e,%e,%e,%e",
+ lc,pixPtr->Size(0),pixPtr->Size(1),nx,ny,
+ xylim[0],-xylim[1],xylim[2],-xylim[3]
+ ));
+
+ mlem = new TH2D("mlem","mlem",nx,xylim[0],-xylim[1],ny,xylim[2],-xylim[3]);
+
+ for (Int_t ipix=0; ipix<nPix; ++ipix)
+ {
+ AliMUONPad* pixPtr = Pixel(ipix);
+ mlem->Fill(pixPtr->Coord(0),pixPtr->Coord(1),pixPtr->Charge());
+ }
+
+ // Check if the total charge of pixels is too low
+ Double_t qTot = 0;
+ for ( Int_t i=0; i<nPix; ++i)
+ {
+ qTot += Pixel(i)->Charge();
+ }
+
+ if ( qTot < 1.e-4 || ( npadOK < 3 && qTot < 7 ) )
+ {
+ AliDebug(1,Form("Deleting the above cluster (charge %e too low, npadOK=%d)",qTot,npadOK));
+ delete [] coef;
+ delete [] probi;
+ coef = 0;
+ probi = 0;
+ fPixArray->Delete();
+ for ( Int_t i=0; i<npadTot; ++i)
+ {
+ AliMUONPad* pad = cluster.Pad(i);
+ if ( pad->Status() == 0) pad->SetStatus(-1);
+ }
+ return kFALSE;
+ }
+
+ if (iSimple)
+ {
+ // Simple cluster - skip further passes thru EM-procedure
+ Simple(cluster);
+ delete [] coef;
+ delete [] probi;
+ coef = 0;
+ probi = 0;
+ fPixArray->Delete();
+ return kTRUE;
+ }
+
+ // Calculate position of the center-of-gravity around the maximum pixel
+ Double_t xyCOG[2];
+ FindCOG(mlem, xyCOG);
+
+ if (TMath::Min(pixPtr->Size(0),pixPtr->Size(1)) < 0.07 &&
+ pixPtr->Size(0) > pixPtr->Size(1)) break;
+
+ // Sort pixels according to the charge
+ fPixArray->Sort();
+ Double_t pixMin = 0.01*Pixel(0)->Charge();
+ pixMin = TMath::Min(pixMin,50.);
+
+ // Decrease pixel size and shift pixels to make them centered at
+ // the maximum one
+ Int_t indx = (pixPtr->Size(0)>pixPtr->Size(1)) ? 0 : 1;
+ Int_t ix(1);
+ Double_t width = 0;
+ Double_t shift[2] = { 0.0, 0.0 };
+ for (Int_t i=0; i<4; i++) xylim[i] = 999;
+ Int_t nPix1 = nPix;
+ nPix = 0;
+ for (Int_t ipix=0; ipix<nPix1; ++ipix)
+ {
+ AliMUONPad* pixPtr = Pixel(ipix);
+ if ( nPix >= npadOK // too many pixels already
+ ||
+ pixPtr->Charge() < pixMin // too low charge
+ )
+ {
+ RemovePixel(ipix);
+ continue;
+ }
+ for (Int_t i=0; i<2; ++i)
+ {
+ if (!i)
+ {
+ pixPtr->SetCharge(10);
+ pixPtr->SetSize(indx, pixPtr->Size(indx)/2);
+ width = -pixPtr->Size(indx);
+ pixPtr->Shift(indx, width);
+ // Shift pixel position
+ if (ix)
+ {
+ ix = 0;
+ for (Int_t j=0; j<2; ++j)
+ {
+ shift[j] = pixPtr->Coord(j) - xyCOG[j];
+ shift[j] -= ((Int_t)(shift[j]/pixPtr->Size(j)/2))*pixPtr->Size(j)*2;
+ }
+ } // if (ix)
+ pixPtr->Shift(0, -shift[0]);
+ pixPtr->Shift(1, -shift[1]);
+ }
+ else
+ {
+ pixPtr = new AliMUONPad(*pixPtr);
+ pixPtr->Shift(indx, -2*width);
+ fPixArray->Add(pixPtr);
+ }
+ for (Int_t i=0; i<4; ++i)
+ {
+ xylim[i] = TMath::Min (xylim[i], (i%2 ? -1 : 1)*pixPtr->Coord(i/2));
+ }
+ } // for (Int_t i=0; i<2;
+ nPix += 2;
+ } // for (Int_t ipix=0;
+
+ fPixArray->Compress();
+ nPix = fPixArray->GetEntriesFast();
+
+ AliDebug(2,Form("After shift:"));
+ StdoutToAliDebug(2,fPixArray->Print("","full"););
+ Plot(Form("mlem.lc%d",lc+1));
+
+ AliDebug(2,Form(" xyCOG=%9.6f %9.6f xylim=%9.6f,%9.6f,%9.6f,%9.6f",
+ xyCOG[0],xyCOG[1],
+ xylim[0],xylim[1],
+ xylim[2],xylim[3]));
+
+ // Remove excessive pixels
+ if (nPix > npadOK)
+ {
+ for (Int_t ipix=npadOK; ipix<nPix; ++ipix)
+ {
+ RemovePixel(ipix);
+ }
+ }
+ else
+ {
+ AliMUONPad* pixPtr = Pixel(0);
+ // add pixels if the maximum is at the limit of pixel area
+ // start from Y-direction
+ Int_t j = 0;
+ for (Int_t i=3; i>-1; --i)
+ {
+ if (nPix < npadOK &&
+ TMath::Abs((i%2 ? -1 : 1)*xylim[i]-xyCOG[i/2]) < pixPtr->Size(i/2))
+ {
+ AliMUONPad* p = static_cast<AliMUONPad*>(pixPtr->Clone());
+ p->SetCoord(i/2, xyCOG[i/2]+(i%2 ? 2:-2)*pixPtr->Size(i/2));
+ j = TMath::Even (i/2);
+ p->SetCoord(j, xyCOG[j]);
+ AliDebug(2,Form("Adding pixel on the edge (i=%d) ",i));
+ StdoutToAliDebug(2,cout << " ---- ";
+ p->Print("corners"););
+ fPixArray->Add(p);
+ ++nPix;
+ }
+ }
+ }
+ fPixArray->Compress();
+ nPix = fPixArray->GetEntriesFast();
+ delete [] coef;
+ delete [] probi;
+ coef = 0;
+ probi = 0;
+ } // while (1)
+
+ AliDebug(2,Form("At the end of while loop nPix=%d : ",fPixArray->GetLast()+1));
+ StdoutToAliDebug(2,fPixArray->Print("","full"););
+
+ // remove pixels with low signal or low visibility
+ // Cuts are empirical !!!
+ Double_t thresh = TMath::Max (mlem->GetMaximum()/100.,1.);
+ thresh = TMath::Min (thresh,50.);
+ Double_t cmax = -1;
+ Double_t charge = 0;
+
+ for ( Int_t i=0; i<nPix; ++i)
+ {
+ cmax = TMath::Max (cmax,probi[i]);
+ }
+
+ // Mark pixels which should be removed
+ for (Int_t i=0; i<nPix; ++i)
+ {
+ AliMUONPad* pixPtr = Pixel(i);
+ charge = pixPtr->Charge();
+ if (charge < thresh)
+ {
+ pixPtr->SetCharge(-charge);
+ }
+ }
+
+ // Move charge of removed pixels to their nearest neighbour (to keep total charge the same)
+ Int_t near = 0;
+ for (Int_t i=0; i<nPix; ++i)
+ {
+ AliMUONPad* pixPtr = Pixel(i);
+ charge = pixPtr->Charge();
+ if (charge > 0) continue;
+ near = FindNearest(pixPtr);
+ pixPtr->SetCharge(0);
+ probi[i] = 0; // make it "invisible"
+ AliMUONPad* pnear = Pixel(near);
+ pnear->SetCharge(pnear->Charge() + (-charge));
+ }
+ Mlem(cluster,coef,probi,2);
+
+ AliDebug(2,Form("Before splitting nPix=%d EVT %d DE %d",fPixArray->GetLast()+1,fEventNumber,fDetElemId));
+ StdoutToAliDebug(2,fPixArray->Print("","full"););
+ Plot("mlem.beforesplit");
+
+ // Update histogram
+ for (Int_t i=0; i<nPix; ++i)
+ {
+ AliMUONPad* pixPtr = Pixel(i);
+ Int_t ix = mlem->GetXaxis()->FindBin(pixPtr->Coord(0));
+ Int_t iy = mlem->GetYaxis()->FindBin(pixPtr->Coord(1));
+ mlem->SetBinContent(ix, iy, pixPtr->Charge());
+ }
+
+ // Try to split into clusters
+ Bool_t ok = kTRUE;
+ if (mlem->GetSum() < 1)
+ {
+ ok = kFALSE;
+ }
+ else
+ {
+ fSplitter->Split(cluster,mlem,coef,fClusterList);
+ }
+
+ delete [] coef;
+ delete [] probi;
+ coef = 0;
+ probi = 0;
+ fPixArray->Delete();
+
+ return ok;
+}
+
+//_____________________________________________________________________________
+void AliMUONClusterFinderMLEM::Mlem(AliMUONCluster& cluster,
+ Double_t* coef, Double_t* probi,
+ Int_t nIter)
+{
+ /// Use MLEM to find pixel charges
+
+ Int_t nPix = fPixArray->GetEntriesFast();
+
+ Int_t npad = cluster.Multiplicity();
+
+ Double_t* probi1 = new Double_t[nPix];
+ Double_t probMax = 0;
+ Double_t tmp = TMath::MaxElement(nPix,probi);
+
+ for (Int_t ipix=0; ipix<nPix; ++ipix)
+ {
+ probMax = TMath::Max(probMax,probi[ipix]);
+ }
+
+ if (probMax!=tmp) { AliWarning(Form("probMax=%e tmp=%e",probMax,tmp)); }
+
+ for (Int_t iter=0; iter<nIter; ++iter)
+ {
+ // Do iterations
+ for (Int_t ipix=0; ipix<nPix; ++ipix)
+ {
+ // Correct each pixel
+ if (probi[ipix] < 0.01) continue; // skip "invisible" pixel
+ Double_t sum = 0;
+ probi1[ipix] = probMax;
+ for (Int_t j=0; j<npad; j++)
+ {
+ AliMUONPad* pad = cluster.Pad(j);
+ if (pad->Status() < 0) continue;
+ Double_t sum1 = 0;
+ Int_t indx1 = j*nPix;
+ Int_t indx = indx1 + ipix;
+ // Calculate expectation
+ for (Int_t i=0; i<nPix; i++)
+ {
+ sum1 += Pixel(i)->Charge()*coef[indx1+i];
+ }
+ if ( pad->Charge() > fgkSaturation-1 && sum1 > pad->Charge() ) //FIXME : remove usage of fgkSaturation
+ {
+ if ( !pad->IsSaturated() )
+ {
+ AliWarning("Got a pad charge above saturation not backed-up by pad->IsSaturated() function : ");
+ StdoutToAliWarning(pad->Print("full"));
+ }
+ // correct for pad charge overflows
+ probi1[ipix] -= coef[indx];
+ continue;
+ }
+
+ if (coef[indx] > 1.e-6)
+ {
+ sum += pad->Charge()*coef[indx]/sum1;
+ }
+ } // for (Int_t j=0;
+ AliMUONPad* pixPtr = Pixel(ipix);
+ if (probi1[ipix] > 1.e-6)
+ {
+ pixPtr->SetCharge(pixPtr->Charge()*sum/probi1[ipix]);
+ }
+ } // for (Int_t ipix=0;
+ } // for (Int_t iter=0;
+ delete [] probi1;
+}
+
+//_____________________________________________________________________________
+void AliMUONClusterFinderMLEM::FindCOG(TH2D *mlem, Double_t *xyc)
+{
+ /// Calculate position of the center-of-gravity around the maximum pixel
+
+ Int_t ixmax, iymax, ix, nsumx=0, nsumy=0, nsum=0;
+ Int_t i1 = -9, j1 = -9;
+ mlem->GetMaximumBin(ixmax,iymax,ix);
+ Int_t nx = mlem->GetNbinsX();
+ Int_t ny = mlem->GetNbinsY();
+ Double_t thresh = mlem->GetMaximum()/10;
+ Double_t x, y, cont, xq=0, yq=0, qq=0;
+
+ for (Int_t i=TMath::Max(1,iymax-1); i<=TMath::Min(ny,iymax+1); i++) {
+ y = mlem->GetYaxis()->GetBinCenter(i);
+ for (Int_t j=TMath::Max(1,ixmax-1); j<=TMath::Min(nx,ixmax+1); j++) {
+ cont = mlem->GetCellContent(j,i);
+ if (cont < thresh) continue;
+ if (i != i1) {i1 = i; nsumy++;}
+ if (j != j1) {j1 = j; nsumx++;}
+ x = mlem->GetXaxis()->GetBinCenter(j);
+ xq += x*cont;
+ yq += y*cont;
+ qq += cont;
+ nsum++;
+ }
+ }
+
+ Double_t cmax = 0;
+ Int_t i2 = 0, j2 = 0;
+ x = y = 0;
+ if (nsumy == 1) {
+ // one bin in Y - add one more (with the largest signal)
+ for (Int_t i=TMath::Max(1,iymax-1); i<=TMath::Min(ny,iymax+1); i++) {
+ if (i == iymax) continue;
+ for (Int_t j=TMath::Max(1,ixmax-1); j<=TMath::Min(nx,ixmax+1); j++) {
+ cont = mlem->GetCellContent(j,i);
+ if (cont > cmax) {
+ cmax = cont;
+ x = mlem->GetXaxis()->GetBinCenter(j);
+ y = mlem->GetYaxis()->GetBinCenter(i);
+ i2 = i;
+ j2 = j;
+ }
+ }
+ }
+ xq += x*cmax;
+ yq += y*cmax;
+ qq += cmax;
+ if (i2 != i1) nsumy++;
+ if (j2 != j1) nsumx++;
+ nsum++;
+ } // if (nsumy == 1)
+
+ if (nsumx == 1) {
+ // one bin in X - add one more (with the largest signal)
+ cmax = x = y = 0;
+ for (Int_t j=TMath::Max(1,ixmax-1); j<=TMath::Min(nx,ixmax+1); j++) {
+ if (j == ixmax) continue;
+ for (Int_t i=TMath::Max(1,iymax-1); i<=TMath::Min(ny,iymax+1); i++) {
+ cont = mlem->GetCellContent(j,i);
+ if (cont > cmax) {
+ cmax = cont;
+ x = mlem->GetXaxis()->GetBinCenter(j);
+ y = mlem->GetYaxis()->GetBinCenter(i);
+ i2 = i;
+ j2 = j;
+ }
+ }
+ }
+ xq += x*cmax;
+ yq += y*cmax;
+ qq += cmax;
+ if (i2 != i1) nsumy++;
+ if (j2 != j1) nsumx++;
+ nsum++;
+ } // if (nsumx == 1)
+
+ xyc[0] = xq/qq; xyc[1] = yq/qq;
+ AliDebug(2,Form("x,y COG = %e,%e",xyc[0],xyc[1]));
+}
+
+//_____________________________________________________________________________
+Int_t AliMUONClusterFinderMLEM::FindNearest(AliMUONPad *pixPtr0)
+{
+/// Find the pixel nearest to the given one
+/// (algorithm may be not very efficient)
+
+ Int_t nPix = fPixArray->GetEntriesFast(), imin = 0;
+ Double_t rmin = 99999, dx = 0, dy = 0, r = 0;
+ Double_t xc = pixPtr0->Coord(0), yc = pixPtr0->Coord(1);
+ AliMUONPad *pixPtr;
+
+ for (Int_t i=0; i<nPix; i++) {
+ pixPtr = (AliMUONPad*) fPixArray->UncheckedAt(i);
+ if (pixPtr->Charge() < 0.5) continue;
+ dx = (xc - pixPtr->Coord(0)) / pixPtr->Size(0);
+ dy = (yc - pixPtr->Coord(1)) / pixPtr->Size(1);
+ r = dx *dx + dy * dy;
+ if (r < rmin) { rmin = r; imin = i; }
+ }
+ return imin;
+}
+
+
+//_____________________________________________________________________________
+TStopwatch*
+AliMUONClusterFinderMLEM::Timer(Int_t i) const
+{
+ /// Return timer at index i
+ return static_cast<TStopwatch*>(fTimers->At(i));
+}
+
+//_____________________________________________________________________________
+void
+AliMUONClusterFinderMLEM::Paint(Option_t*)
+{
+ /// Paint cluster and pixels
+
+ AliMpArea area(fPreCluster->Area());
+
+ gPad->Range(area.LeftBorder(),area.DownBorder(),area.RightBorder(),area.UpBorder());
+
+ gVirtualX->SetFillStyle(1001);
+ gVirtualX->SetFillColor(3);
+ gVirtualX->SetLineColor(3);
+
+ Double_t s(1.0);
+
+ for ( Int_t i = 0; i <= fPixArray->GetLast(); ++i)
+ {
+ AliMUONPad* pixel = Pixel(i);
+
+ gPad->PaintBox(pixel->Coord(0)-pixel->Size(0)*s,
+ pixel->Coord(1)-pixel->Size(1)*s,
+ pixel->Coord(0)+pixel->Size(0)*s,
+ pixel->Coord(1)+pixel->Size(1)*s);
+
+// for ( Int_t sign = -1; sign < 2; sign +=2 )
+// {
+// gPad->PaintLine(pixel->Coord(0) - pixel->Size(0),
+// pixel->Coord(1) + sign*pixel->Size(1),
+// pixel->Coord(0) + pixel->Size(0),
+// pixel->Coord(1) - sign*pixel->Size(1)
+// );
+// }
+ }
+
+
+ gVirtualX->SetFillStyle(0);
+
+ fPreCluster->Paint();
+
+ gVirtualX->SetLineColor(1);
+ gVirtualX->SetLineWidth(2);
+ gVirtualX->SetFillStyle(0);
+ gVirtualX->SetTextColor(1);
+ gVirtualX->SetTextAlign(22);
+
+ for ( Int_t i = 0; i <= fPixArray->GetLast(); ++i)
+ {
+ AliMUONPad* pixel = Pixel(i);
+ gPad->PaintBox(pixel->Coord(0)-pixel->Size(0),
+ pixel->Coord(1)-pixel->Size(1),
+ pixel->Coord(0)+pixel->Size(0),
+ pixel->Coord(1)+pixel->Size(1));
+ gVirtualX->SetTextSize(pixel->Size(0)*60);
+
+ gPad->PaintText(pixel->Coord(0),pixel->Coord(1),Form("%d",(Int_t)(pixel->Charge())));
+ }
+}
+
+//_____________________________________________________________________________
+Int_t AliMUONClusterFinderMLEM::FindLocalMaxima(TObjArray *pixArray, Int_t *localMax, Double_t *maxVal)
+{
+/// Find local maxima in pixel space for large preclusters in order to
+/// try to split them into smaller pieces (to speed up the MLEM procedure)
+/// or to find additional fitting seeds if clusters were not completely resolved
+
+ AliDebug(1,Form("nPix=%d",pixArray->GetLast()+1));
+
+ TH2D *hist = NULL;
+ //if (pixArray == fPixArray) hist = (TH2D*) gROOT->FindObject("anode");
+ //else { hist = (TH2D*) gROOT->FindObject("anode1"); cout << hist << endl; }
+ //if (hist) hist->Delete();
+
+ Double_t xylim[4] = {999, 999, 999, 999};
+
+ Int_t nPix = pixArray->GetEntriesFast();
+ AliMUONPad *pixPtr = 0;
+ for (Int_t ipix=0; ipix<nPix; ipix++) {
+ pixPtr = (AliMUONPad*) pixArray->UncheckedAt(ipix);
+ for (Int_t i=0; i<4; i++)
+ xylim[i] = TMath::Min (xylim[i], (i%2 ? -1 : 1)*pixPtr->Coord(i/2));
+ }
+ for (Int_t i=0; i<4; i++) xylim[i] -= pixPtr->Size(i/2);
+
+ Int_t nx = TMath::Nint ((-xylim[1]-xylim[0])/pixPtr->Size(0)/2);
+ Int_t ny = TMath::Nint ((-xylim[3]-xylim[2])/pixPtr->Size(1)/2);
+ if (pixArray == fPixArray) hist = new TH2D("anode","anode",nx,xylim[0],-xylim[1],ny,xylim[2],-xylim[3]);
+ else hist = new TH2D("anode1","anode1",nx,xylim[0],-xylim[1],ny,xylim[2],-xylim[3]);
+ for (Int_t ipix=0; ipix<nPix; ipix++) {
+ pixPtr = (AliMUONPad*) pixArray->UncheckedAt(ipix);
+ hist->Fill(pixPtr->Coord(0), pixPtr->Coord(1), pixPtr->Charge());
+ }
+// if (fDraw && pixArray == fPixArray) fDraw->DrawHist("c2", hist);
+
+ Int_t nMax = 0, indx;
+ Int_t *isLocalMax = new Int_t[ny*nx];
+ for (Int_t i=0; i<ny*nx; i++) isLocalMax[i] = 0;
+
+ for (Int_t i=1; i<=ny; i++) {
+ indx = (i-1) * nx;
+ for (Int_t j=1; j<=nx; j++) {
+ if (hist->GetCellContent(j,i) < 0.5) continue;
+ //if (isLocalMax[indx+j-1] < 0) continue;
+ if (isLocalMax[indx+j-1] != 0) continue;
+ FlagLocalMax(hist, i, j, isLocalMax);
+ }
+ }
+
+ for (Int_t i=1; i<=ny; i++) {
+ indx = (i-1) * nx;
+ for (Int_t j=1; j<=nx; j++) {
+ if (isLocalMax[indx+j-1] > 0) {
+ localMax[nMax] = indx + j - 1;
+ maxVal[nMax++] = hist->GetCellContent(j,i);
+ if (nMax > 99) AliFatal(" Too many local maxima !!!");
+ }
+ }
+ }
+ if (fDebug) cout << " Local max: " << nMax << endl;
+ delete [] isLocalMax; isLocalMax = 0;
+ return nMax;
+}
+
+//_____________________________________________________________________________
+void AliMUONClusterFinderMLEM::FlagLocalMax(TH2D *hist, Int_t i, Int_t j, Int_t *isLocalMax)
+{
+/// Flag pixels (whether or not local maxima)
+
+ Int_t nx = hist->GetNbinsX();
+ Int_t ny = hist->GetNbinsY();
+ Int_t cont = TMath::Nint (hist->GetCellContent(j,i));
+ Int_t cont1 = 0, indx = (i-1)*nx+j-1, indx1 = 0, indx2 = 0;
+
+ for (Int_t i1=i-1; i1<i+2; i1++) {
+ if (i1 < 1 || i1 > ny) continue;
+ indx1 = (i1 - 1) * nx;
+ for (Int_t j1=j-1; j1<j+2; j1++) {
+ if (j1 < 1 || j1 > nx) continue;
+ if (i == i1 && j == j1) continue;
+ indx2 = indx1 + j1 - 1;
+ cont1 = TMath::Nint (hist->GetCellContent(j1,i1));
+ if (cont < cont1) { isLocalMax[indx] = -1; return; }
+ else if (cont > cont1) isLocalMax[indx2] = -1;
+ else { // the same charge
+ isLocalMax[indx] = 1;
+ if (isLocalMax[indx2] == 0) {
+ FlagLocalMax(hist, i1, j1, isLocalMax);
+ if (isLocalMax[indx2] < 0) { isLocalMax[indx] = -1; return; }
+ else isLocalMax[indx2] = -1;
+ }
+ }
+ }
+ }
+ isLocalMax[indx] = 1; // local maximum
+}
+
+//_____________________________________________________________________________
+void AliMUONClusterFinderMLEM::FindCluster(AliMUONCluster& cluster,
+ Int_t *localMax, Int_t iMax)
+{
+/// Find pixel cluster around local maximum \a iMax and pick up pads
+/// overlapping with it
+
+ TH2D *hist = (TH2D*) gROOT->FindObject("anode");
+ Int_t nx = hist->GetNbinsX();
+ Int_t ny = hist->GetNbinsY();
+ Int_t ic = localMax[iMax] / nx + 1;
+ Int_t jc = localMax[iMax] % nx + 1;
+ Bool_t *used = new Bool_t[ny*nx];
+ for (Int_t i=0; i<ny*nx; i++) used[i] = kFALSE;
+
+ // Drop all pixels from the array - pick up only the ones from the cluster
+ fPixArray->Delete();
+
+ Double_t wx = hist->GetXaxis()->GetBinWidth(1)/2;
+ Double_t wy = hist->GetYaxis()->GetBinWidth(1)/2;
+ Double_t yc = hist->GetYaxis()->GetBinCenter(ic);
+ Double_t xc = hist->GetXaxis()->GetBinCenter(jc);
+ Double_t cont = hist->GetCellContent(jc,ic);
+ fPixArray->Add(new AliMUONPad (xc, yc, wx, wy, cont));
+ used[(ic-1)*nx+jc-1] = kTRUE;
+ fSplitter->AddBin(hist, ic, jc, 1, used, (TObjArray*)0); // recursive call
+
+ Int_t nPix = fPixArray->GetEntriesFast();
+ Int_t npad = cluster.Multiplicity();
+
+ for (Int_t i=0; i<nPix; ++i)
+ {
+ AliMUONPad* pixPtr = Pixel(i);
+ pixPtr->SetSize(0,wx);
+ pixPtr->SetSize(1,wy);
+ }
+
+ // Pick up pads which overlap with found pixels
+ for (Int_t i=0; i<npad; i++)
+ {
+ cluster.Pad(i)->SetStatus(-1);
+ }
+
+ for (Int_t i=0; i<nPix; i++)
+ {
+ AliMUONPad* pixPtr = Pixel(i);
+ for (Int_t j=0; j<npad; ++j)
+ {
+ AliMUONPad* pad = cluster.Pad(j);
+ if ( Overlap(*pad,*pixPtr) )
+ {
+ pad->SetStatus(0);
+ }
+ }
+ }
+
+ delete [] used; used = 0;
+}
+
+//_____________________________________________________________________________
+AliMUONClusterFinderMLEM&
+AliMUONClusterFinderMLEM::operator=(const AliMUONClusterFinderMLEM& rhs)
+{
+/// Protected assignement operator
+
+ if (this == &rhs) return *this;
+
+ AliFatal("Not implemented.");
+
+ return *this;
+}
+
+//_____________________________________________________________________________
+void
+AliMUONClusterFinderMLEM::Neighbours(Int_t cathode, Int_t ix, Int_t iy,
+ Int_t& n, Int_t* xList, Int_t* yList)
+{
+ /// Get the list of neighbours of pad at (cathode,ix,iy)
+ n = 0;
+
+ const AliMpVSegmentation* seg = fSegmentation[cathode];
+
+ AliMpPad pad = seg->PadByIndices(AliMpIntPair(ix,iy),kTRUE);
+
+ // Define the region to look into : a region slightly bigger
+ // than the pad itself (5% bigger), in order to catch first neighbours.
+
+ AliMpArea area(pad.Position(),pad.Dimensions()*1.05);
+
+ AliMpVPadIterator* it = seg->CreateIterator(area);
+ it->First();
+ while ( !it->IsDone() && n < 10 )
+ {
+ AliMpPad p = it->CurrentItem();
+ if ( p != pad ) // skip self
+ {
+ xList[n] = p.GetIndices().GetFirst();
+ yList[n] = p.GetIndices().GetSecond();
+ ++n;
+ }
+ it->Next();
+ }
+ delete it;
+}
+
+//_____________________________________________________________________________
+void AliMUONClusterFinderMLEM::AddVirtualPad(AliMUONCluster& cluster)
+{
+ /// Add virtual pad (with small charge) to improve fit for some
+ /// clusters (when pad with max charge is at the extreme of the cluster)
+
+ // Get number of pads in X and Y-directions
+ Int_t nInX = -1, nInY;
+ PadsInXandY(cluster,nInX, nInY);
+ ++fNClusters;
+ if (fDebug) cout << " Chamber: " << fDetElemId / 100 - 1 << " " << nInX << " " << nInY << endl;
+
+ // Add virtual pad only if number of pads per direction == 2
+ if (nInX != 2 && nInY != 2) return;
+
+ ++fNAddVirtualPads;
+
+ // Find pads with max charge
+ Int_t maxpad[2][2] = {{-1, -1}, {-1, -1}}, cath;
+ Double_t sigmax[2] = {0}, aamax[2] = {0};
+ for (Int_t j=0; j<cluster.Multiplicity(); ++j)
+ {
+ AliMUONPad* pad = cluster.Pad(j);
+ if (pad->Status() != 0) continue;
+ cath = pad->Cathode();
+ if (pad->Charge() > sigmax[cath])
+ {
+ maxpad[cath][1] = maxpad[cath][0];
+ aamax[cath] = sigmax[cath];
+ sigmax[cath] = pad->Charge();
+ maxpad[cath][0] = j;
+ }
+ }
+
+ if (maxpad[0][0] >= 0 && maxpad[0][1] < 0 || maxpad[1][0] >= 0 && maxpad[1][1] < 0)
+ {
+ for (Int_t j=0; j<cluster.Multiplicity(); ++j)
+ {
+ AliMUONPad* pad = cluster.Pad(j);
+ if (pad->Status() != 0) continue;
+ cath = pad->Cathode();
+ if (j == maxpad[cath][0] || j == maxpad[cath][1]) continue;
+ if ( pad->Charge() > aamax[cath])
+ {
+ aamax[cath] = pad->Charge();
+ maxpad[cath][1] = j;
+ }
+ }
+ }
+
+ // cout << "-------AddVirtualPad" << endl;
+// cout << Form("nInX %2d nInY %2d",nInX,nInY) << endl;
+//
+// cluster.Print("full");
+//
+// for ( Int_t i = 0; i < 2; ++i )
+// {
+// for ( Int_t j = 0; j < 2; ++j )
+// {
+// cout << Form("maxpad[%d][%d]=%d",i,j,maxpad[i][j]) << endl;
+// }
+// }
+
+ // Check for mirrors (side X on cathode 0)
+ Bool_t mirror = kFALSE;
+ if (maxpad[0][0] >= 0 && maxpad[1][0] >= 0)
+ {
+ AliMUONPad* maxPadCath[] = { cluster.Pad(maxpad[0][0]), cluster.Pad(maxpad[1][0]) };
+ mirror = maxPadCath[0]->DX() < maxPadCath[0]->DY();
+ if (!mirror && TMath::Abs( maxPadCath[0]->DX() - maxPadCath[1]->DX()) < 0.001)
+ {
+ // Special case when pads on both cathodes have the same size
+ Int_t yud[2] = {0};
+ for (Int_t j = 0; j < cluster.Multiplicity(); ++j)
+ {
+ AliMUONPad* pad = cluster.Pad(j);
+ cath = pad->Cathode();
+ if (j == maxpad[cath][0]) continue;
+ if ( pad->Ix() != maxPadCath[cath]->Ix() ) continue;
+ if ( TMath::Abs(pad->Iy() - maxPadCath[cath]->Iy()) == 1 )
+ {
+ yud[cath]++;
+ }
+ }
+ if (!yud[0]) mirror = kTRUE; // take the other cathode
+ } // if (!mirror &&...
+ } // if (maxpad[0][0] >= 0 && maxpad[1][0] >= 0)
+
+// // Find neughbours of pads with max charges
+ Int_t nn, xList[10], yList[10], ix0, iy0, ix, iy, neighb;
+ for (cath=0; cath<2; cath++)
+ {
+ if (!cath && maxpad[0][0] < 0) continue; // one-sided cluster - cathode 1
+ if (cath && maxpad[1][0] < 0) break; // one-sided cluster - cathode 0
+ if (maxpad[1][0] >= 0)
+ {
+ if (!mirror)
+ {
+ if (!cath && nInY != 2) continue;
+ if (cath && nInX != 2 && (maxpad[0][0] >= 0 || nInY != 2)) continue;
+ }
+ else
+ {
+ if (!cath && nInX != 2) continue;
+ if (cath && nInY != 2 && (maxpad[0][0] >= 0 || nInX != 2)) continue;
+ }
+ }
+
+ Int_t iAddX = 0, iAddY = 0, ix1 = 0, iy1 = 0, iPad = 0;
+ if (maxpad[0][0] < 0) iPad = 1;
+
+ for (iPad=0; iPad<2; iPad++)
+ {
+ if (maxpad[cath][iPad] < 0) continue;
+ if (iPad && !iAddX && !iAddY) break;
+ if (iPad && cluster.Pad(maxpad[cath][1])->Charge() / sigmax[cath] < 0.5) break;
+
+ Int_t neighbx = 0, neighby = 0;
+ ix0 = cluster.Pad(maxpad[cath][iPad])->Ix();
+ iy0 = cluster.Pad(maxpad[cath][iPad])->Iy();
+ Neighbours(cath,ix0,iy0,nn,xList,yList);
+ //Float_t zpad;
+ for (Int_t j=0; j<nn; j++) {
+ if (TMath::Abs(xList[j]-ix0) == 1 || xList[j]*ix0 == -1) neighbx++;
+ if (TMath::Abs(yList[j]-iy0) == 1 || yList[j]*iy0 == -1) neighby++;
+ }
+ if (!mirror) {
+ if (cath) neighb = neighbx;
+ else neighb = neighby;
+ if (maxpad[0][0] < 0) neighb += neighby;
+ else if (maxpad[1][0] < 0) neighb += neighbx;
+ } else {
+ if (!cath) neighb = neighbx;
+ else neighb = neighby;
+ if (maxpad[0][0] < 0) neighb += neighbx;
+ else if (maxpad[1][0] < 0) neighb += neighby;
+ }
+
+ for (Int_t j=0; j< cluster.Multiplicity(); ++j)
+ {
+ AliMUONPad* pad = cluster.Pad(j);
+ if ( pad->Cathode() != cath) continue;
+ ix = pad->Ix();
+ iy = pad->Iy();
+ if (iy == iy0 && ix == ix0) continue;
+ for (Int_t k=0; k<nn; ++k)
+ {
+ if (xList[k] != ix || yList[k] != iy) continue;
+ if (!mirror)
+ {
+ if ((!cath || maxpad[0][0] < 0) &&
+ (TMath::Abs(iy-iy0) == 1 || iy*iy0 == -1)) {
+ if (!iPad && TMath::Abs(ix-ix0) == 1 || ix*ix0 == -1) ix1 = xList[k]; //19-12-05
+ xList[k] = yList[k] = 0;
+ neighb--;
+ break;
+ }
+ if ((cath || maxpad[1][0] < 0) &&
+ (TMath::Abs(ix-ix0) == 1 || ix*ix0 == -1)) {
+ if (!iPad) ix1 = xList[k]; //19-12-05
+ xList[k] = yList[k] = 0;
+ neighb--;
+ }
+ } else {
+ if ((!cath || maxpad[0][0] < 0) &&
+ (TMath::Abs(ix-ix0) == 1 || ix*ix0 == -1)) {
+ if (!iPad) ix1 = xList[k]; //19-12-05
+ xList[k] = yList[k] = 0;
+ neighb--;
+ break;
+ }
+ if ((cath || maxpad[1][0] < 0) &&
+ (TMath::Abs(iy-iy0) == 1 || iy*iy0 == -1)) {
+ xList[k] = yList[k] = 0;
+ neighb--;
+ }
+ }
+ break;
+ } // for (Int_t k=0; k<nn;
+ if (!neighb) break;
+ } // for (Int_t j=0; j< cluster.Multiplicity();
+ if (!neighb) continue;
+
+ // Add virtual pad
+ Int_t npads, isec;
+ isec = npads = 0;
+ for (Int_t j=0; j<nn; j++)
+ {
+ if (xList[j] == 0 && yList[j] == 0) continue;
+ // npads = fnPads[0] + fnPads[1];
+ // fPadIJ[0][npads] = cath;
+ // fPadIJ[1][npads] = 0;
+ ix = xList[j];
+ iy = yList[j];
+ if (TMath::Abs(ix-ix0) == 1 || ix*ix0 == -1) {
+ if (iy != iy0) continue; // new segmentation - check
+ if (nInX != 2) continue; // new
+ if (!mirror) {
+ if (!cath && maxpad[1][0] >= 0) continue;
+ } else {
+ if (cath && maxpad[0][0] >= 0) continue;
+ }
+ if (iPad && !iAddX) continue;
+ AliMpPad pad = fSegmentation[cath]->PadByIndices(AliMpIntPair(ix,iy),kTRUE);
+ // fXyq[0][npads] = pad.Position().X();
+ // fXyq[1][npads] = pad.Position().Y();
+ AliMUONPad muonPad(fDetElemId, cath, ix, iy, pad.Position().X(), pad.Position().Y(), 0, 0, 0);
+ // fSegmentation[cath]->GetPadC(ix, iy, fXyq[0][npads], fXyq[1][npads], zpad);
+ // if (fXyq[0][npads] > 1.e+5) continue; // temporary fix
+ if (muonPad.Coord(0) > 1.e+5) continue; // temporary fix
+ if (ix == ix1) continue; //19-12-05
+ if (ix1 == ix0) continue;
+ if (maxpad[1][0] < 0 || mirror && maxpad[0][0] >= 0) {
+ // if (!iPad) fXyq[2][npads] = TMath::Min (sigmax[0]/100, 5.);
+ // else fXyq[2][npads] = TMath::Min (aamax[0]/100, 5.);
+ if (!iPad) muonPad.SetCharge(TMath::Min (sigmax[0]/100, 5.));
+ else muonPad.SetCharge(TMath::Min (aamax[0]/100, 5.));
+ }
+ else {
+ // if (!iPad) fXyq[2][npads] = TMath::Min (sigmax[1]/100, 5.);
+ // else fXyq[2][npads] = TMath::Min (aamax[1]/100, 5.);
+ if (!iPad) muonPad.SetCharge(TMath::Min (sigmax[1]/100, 5.));
+ else muonPad.SetCharge(TMath::Min (aamax[1]/100, 5.));
+ }
+ // fXyq[2][npads] = TMath::Max (fXyq[2][npads], (float)1);
+ if (muonPad.Charge() < 1.) muonPad.SetCharge(1.);
+ // fXyq[3][npads] = -2; // flag
+ // fPadIJ[2][npads] = ix;
+ // fPadIJ[3][npads] = iy;
+ muonPad.SetSize(0,-2.); //flag
+ // fnPads[1]++;
+ // iAddX = npads;
+ iAddX = 1;
+ //AliDebug(1,Form("Add virtual pad in X %f %f %f %3d %3d \n",
+ // fXyq[2][npads], fXyq[0][npads], fXyq[1][npads], ix, iy));
+ //muonPad.Charge(), muonPad.Coord(0), muonPad.Coord(1), ix, iy));
+ if (fDebug) printf(" ***** Add virtual pad in X ***** %f %f %f %3d %3d \n",
+ muonPad.Charge(), muonPad.Coord(0), muonPad.Coord(1), ix, iy);
+ cluster.AddPad(muonPad); // add pad to the cluster
+ ix1 = ix0;
+ continue;
+ }
+ if (nInY != 2) continue;
+ if (!mirror && cath && maxpad[0][0] >= 0) continue;
+ if (mirror && !cath && maxpad[1][0] >= 0) continue;
+ if (TMath::Abs(iy-iy0) == 1 || TMath::Abs(iy*iy0) == 1) {
+ if (ix != ix0) continue; // new segmentation - check
+ if (iPad && !iAddY) continue;
+ AliMpPad pad = fSegmentation[cath]->PadByIndices(AliMpIntPair(ix,iy),kTRUE);
+ // fXyq[0][npads] = pad.Position().X();
+ // fXyq[1][npads] = pad.Position().Y();
+ // fSegmentation[cath]->GetPadC(ix, iy, fXyq[0][npads], fXyq[1][npads], zpad);
+ AliMUONPad muonPad(fDetElemId, cath, ix, iy, pad.Position().X(), pad.Position().Y(), 0, 0, 0);
+ if (iy1 == iy0) continue;
+ //if (iPad && iy1 == iy0) continue;
+ if (maxpad[0][0] < 0 || mirror && maxpad[1][0] >= 0) {
+ // if (!iPad) fXyq[2][npads] = TMath::Min (sigmax[1]/15, fgkZeroSuppression);
+ // else fXyq[2][npads] = TMath::Min (aamax[1]/15, fgkZeroSuppression);
+ if (!iPad) muonPad.SetCharge(TMath::Min (sigmax[1]/15, fgkZeroSuppression));
+ else muonPad.SetCharge(TMath::Min (aamax[1]/15, fgkZeroSuppression));
+ }
+ else {
+ // if (!iPad) fXyq[2][npads] = TMath::Min (sigmax[0]/15, fgkZeroSuppression);
+ // else fXyq[2][npads] = TMath::Min (aamax[0]/15, fgkZeroSuppression);
+ if (!iPad) muonPad.SetCharge(TMath::Min (sigmax[0]/15, fgkZeroSuppression));
+ else muonPad.SetCharge(TMath::Min (aamax[0]/15, fgkZeroSuppression));
+ }
+ // fXyq[2][npads] = TMath::Max (fXyq[2][npads], (float)1);
+ if (muonPad.Charge() < 1.) muonPad.SetCharge(1.);
+ // fXyq[3][npads] = -2; // flag
+ // fPadIJ[2][npads] = ix;
+ // fPadIJ[3][npads] = iy;
+ muonPad.SetSize(0,-2.); //flag
+ // fnPads[1]++;
+ // iAddY = npads;
+ iAddY = 1;
+ if (fDebug) printf(" ***** Add virtual pad in Y ***** %f %f %f %3d %3d \n",
+ muonPad.Charge(), muonPad.Coord(0), muonPad.Coord(1), ix, iy);
+ cluster.AddPad(muonPad); // add pad to the cluster
+ iy1 = iy0;
+ }
+ } // for (Int_t j=0; j<nn;
+ } // for (Int_t iPad=0;
+ } // for (cath=0; cath<2;
+}
+
+//_____________________________________________________________________________
+void AliMUONClusterFinderMLEM::PadsInXandY(AliMUONCluster& cluster,
+ Int_t &nInX, Int_t &nInY) const
+{
+ /// Find number of pads in X and Y-directions (excluding virtual ones and
+ /// overflows)
+
+ Int_t statusToTest = 1;
+
+ if ( nInX < 0 ) statusToTest = 0;
+
+ Bool_t mustMatch(kTRUE);
+
+ AliMpIntPair cn = cluster.NofPads(statusToTest,mustMatch);
+
+ nInX = cn.GetFirst();
+ nInY = cn.GetSecond();
+}
+
+//_____________________________________________________________________________
+void AliMUONClusterFinderMLEM::RemovePixel(Int_t i)
+{
+ /// Remove pixel at index i
+ AliMUONPad* pixPtr = Pixel(i);
+ fPixArray->RemoveAt(i);
+ delete pixPtr;
+}
+
+//_____________________________________________________________________________
+void AliMUONClusterFinderMLEM::Simple(AliMUONCluster& cluster)
+{
+/// Process simple cluster (small number of pads) without EM-procedure
+
+ Int_t nForFit = 1, clustFit[1] = {0}, nfit;
+ Double_t parOk[3] = {0.};
+ TObjArray *clusters[1];
+ clusters[0] = fPixArray;
+
+ AliDebug(1,Form("nPix=%d",fPixArray->GetLast()+1));
+
+ for (Int_t i = 0; i < cluster.Multiplicity(); ++i)
+ {
+ AliMUONPad* pad = cluster.Pad(i);
+ if ( pad->Charge() > fgkSaturation-1) //FIXME : remove usage of fgkSaturation
+ {
+ pad->SetStatus(-9);
+ }
+ else
+ {
+ pad->SetStatus(1);
+ }
+ }
+ nfit = fSplitter->Fit(cluster,1, nForFit, clustFit, clusters, parOk, fClusterList);
+}
+
+//_____________________________________________________________________________
+AliMUONPad*
+AliMUONClusterFinderMLEM::Pixel(Int_t i) const
+{
+ /// Returns pixel at index i
+ return static_cast<AliMUONPad*>(fPixArray->UncheckedAt(i));
+}
+
+//_____________________________________________________________________________
+void
+AliMUONClusterFinderMLEM::Print(Option_t* what) const
+{
+ /// printout
+ TString swhat(what);
+ swhat.ToLower();
+ if ( swhat.Contains("precluster") )
+ {
+ if ( fPreCluster) fPreCluster->Print();
+ }
+}
+
+
--- /dev/null
+/**************************************************************************
+* Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *
+* *
+* Author: The ALICE Off-line Project. *
+* Contributors are mentioned in the code where appropriate. *
+* *
+* Permission to use, copy, modify and distribute this software and its *
+* documentation strictly for non-commercial purposes is hereby granted *
+* without fee, provided that the above copyright notice appears in all *
+* copies and that both the copyright notice and this permission notice *
+* appear in the supporting documentation. The authors make no claims *
+* about the suitability of this software for any purpose. It is *
+* provided "as is" without express or implied warranty. *
+**************************************************************************/
+
+// $Id$
+
+/// \class AliMUONClusterSplitterMLEM
+///
+/// Splitter class for the MLEM algorithm...
+///
+/// FIXME: describe it a little bit more here...
+///
+/// \author Laurent Aphecetche (for the "new" C++ structure) and
+/// Alexander Zinchenko, JINR Dubna, for the hardcore of it ;-)
+
+#include "AliMUONClusterSplitterMLEM.h"
+
+#include "AliLog.h"
+#include "AliMUONCluster.h"
+#include "AliMUONPad.h"
+#include "AliMUONPad.h"
+#include "AliMpStationType.h"
+#include "AliMUONConstants.h"
+#include "AliMpDEManager.h"
+#include "AliMUONMathieson.h"
+
+#include "TClonesArray.h"
+#include "TH2.h"
+#include "TMath.h"
+#include "TObjArray.h"
+#include "TMatrixD.h"
+#include "TRandom.h"
+
+ClassImp(AliMUONClusterSplitterMLEM)
+
+const Double_t AliMUONClusterSplitterMLEM::fgkCouplMin = 1.e-3; // threshold on coupling
+
+//_____________________________________________________________________________
+AliMUONClusterSplitterMLEM::AliMUONClusterSplitterMLEM(Int_t detElemId,
+ TObjArray* fPixArray)
+: TObject(),
+fPixArray(fPixArray),
+fMathieson(0x0),
+fDetElemId(detElemId),
+fNpar(0),
+fQtot(0),
+fnCoupled(0)
+{
+ /// Constructor
+
+ AliMpStationType stationType = AliMpDEManager::GetStationType(fDetElemId);
+
+ Float_t kx3 = AliMUONConstants::SqrtKx3();
+ Float_t ky3 = AliMUONConstants::SqrtKy3();
+ Float_t pitch = AliMUONConstants::Pitch();
+
+ if ( stationType == kStation1 )
+ {
+ kx3 = AliMUONConstants::SqrtKx3St1();
+ ky3 = AliMUONConstants::SqrtKy3St1();
+ pitch = AliMUONConstants::PitchSt1();
+ }
+
+ fMathieson = new AliMUONMathieson;
+
+ fMathieson->SetPitch(pitch);
+ fMathieson->SetSqrtKx3AndDeriveKx2Kx4(kx3);
+ fMathieson->SetSqrtKy3AndDeriveKy2Ky4(ky3);
+
+}
+
+//_____________________________________________________________________________
+AliMUONClusterSplitterMLEM::~AliMUONClusterSplitterMLEM()
+{
+ delete fMathieson;
+}
+
+//_____________________________________________________________________________
+void
+AliMUONClusterSplitterMLEM::AddBin(TH2 *mlem,
+ Int_t ic, Int_t jc, Int_t mode,
+ Bool_t *used, TObjArray *pix)
+{
+ /// Add a bin to the cluster
+
+ Int_t nx = mlem->GetNbinsX();
+ Int_t ny = mlem->GetNbinsY();
+ Double_t cont1, cont = mlem->GetCellContent(jc,ic);
+ AliMUONPad *pixPtr = 0;
+
+ for (Int_t i=TMath::Max(ic-1,1); i<=TMath::Min(ic+1,ny); i++) {
+ for (Int_t j=TMath::Max(jc-1,1); j<=TMath::Min(jc+1,nx); j++) {
+ if (i != ic && j != jc) continue;
+ if (used[(i-1)*nx+j-1]) continue;
+ cont1 = mlem->GetCellContent(j,i);
+ if (mode && cont1 > cont) continue;
+ used[(i-1)*nx+j-1] = kTRUE;
+ if (cont1 < 0.5) continue;
+ if (pix) pix->Add(BinToPix(mlem,j,i));
+ else {
+ pixPtr = new AliMUONPad (mlem->GetXaxis()->GetBinCenter(j),
+ mlem->GetYaxis()->GetBinCenter(i), 0, 0, cont1);
+ fPixArray->Add((TObject*)pixPtr);
+ }
+ AddBin(mlem, i, j, mode, used, pix); // recursive call
+ }
+ }
+}
+
+//_____________________________________________________________________________
+void
+AliMUONClusterSplitterMLEM::AddCluster(Int_t ic, Int_t nclust,
+ TMatrixD& aijcluclu,
+ Bool_t *used, Int_t *clustNumb, Int_t &nCoupled)
+{
+ /// Add a cluster to the group of coupled clusters
+
+ for (Int_t i=0; i<nclust; i++) {
+ if (used[i]) continue;
+ if (aijcluclu(i,ic) < fgkCouplMin) continue;
+ used[i] = kTRUE;
+ clustNumb[nCoupled++] = i;
+ AddCluster(i, nclust, aijcluclu, used, clustNumb, nCoupled);
+ }
+}
+
+//_____________________________________________________________________________
+TObject*
+AliMUONClusterSplitterMLEM::BinToPix(TH2 *mlem,
+ Int_t jc, Int_t ic)
+{
+ /// Translate histogram bin to pixel
+
+ Double_t yc = mlem->GetYaxis()->GetBinCenter(ic);
+ Double_t xc = mlem->GetXaxis()->GetBinCenter(jc);
+
+ Int_t nPix = fPixArray->GetEntriesFast();
+ AliMUONPad *pixPtr = NULL;
+
+ // Compare pixel and bin positions
+ for (Int_t i=0; i<nPix; i++) {
+ pixPtr = (AliMUONPad*) fPixArray->UncheckedAt(i);
+ if (pixPtr->Charge() < 0.5) continue;
+ if (TMath::Abs(pixPtr->Coord(0)-xc)<1.e-4 && TMath::Abs(pixPtr->Coord(1)-yc)<1.e-4)
+ {
+ return (TObject*) pixPtr;
+ }
+ }
+ AliError(Form(" Something wrong ??? %f %f ", xc, yc));
+ return NULL;
+}
+
+//_____________________________________________________________________________
+Float_t
+AliMUONClusterSplitterMLEM::ChargeIntegration(Double_t x, Double_t y,
+ const AliMUONPad& pad)
+{
+ /// Compute the Mathieson integral on pad area, assuming the center
+ /// of the Mathieson is at (x,y)
+
+ TVector2 lowerLeft(TVector2(x,y)-pad.Position()-pad.Dimensions());
+ TVector2 upperRight(lowerLeft + pad.Dimensions()*2.0);
+
+ return fMathieson->IntXY(lowerLeft.X(),lowerLeft.Y(),
+ upperRight.X(),upperRight.Y());
+}
+
+//_____________________________________________________________________________
+void
+AliMUONClusterSplitterMLEM::Fcn1(const AliMUONCluster& cluster,
+ Int_t & /*fNpar*/, Double_t * /*gin*/,
+ Double_t &f, Double_t *par, Int_t /*iflag*/)
+{
+ /// Fit for one track
+
+ Int_t indx, npads=0;
+ Double_t charge, delta, coef=0, chi2=0, qTot = 0;
+
+ for (Int_t j=0; j< cluster.Multiplicity(); ++j)
+ {
+ AliMUONPad* pad = cluster.Pad(j);
+ if ( pad->Status() != 1 ) continue;
+ if ( pad->DX() > 0 ) npads++; // exclude virtual pads
+ qTot += pad->Charge(); // c.fXyq[2][j];
+ charge = 0;
+ for (Int_t i=fNpar/3; i>=0; --i)
+ { // sum over tracks
+ indx = i<2 ? 2*i : 2*i+1;
+ if (fNpar == 2)
+ {
+ coef = 1;
+ }
+ else
+ {
+ coef = i==fNpar/3 ? par[indx+2] : 1-coef;
+ }
+ coef = TMath::Max (coef, 0.);
+ if ( fNpar == 8 && i < 2)
+ {
+ coef = i==1 ? coef*par[indx+2] : coef - par[7];
+ }
+ coef = TMath::Max (coef, 0.);
+ charge += ChargeIntegration(par[indx],par[indx+1],*pad);
+ }
+ charge *= fQtot;
+ delta = charge - pad->Charge(); //c.fXyq[2][j];
+ delta *= delta;
+ delta /= pad->Charge(); //c.fXyq[2][j];
+ chi2 += delta;
+ } // for (Int_t j=0;
+ f = chi2;
+ Double_t qAver = qTot/npads;
+ f = chi2/qAver;
+}
+
+//_____________________________________________________________________________
+Int_t
+AliMUONClusterSplitterMLEM::Fit(const AliMUONCluster& cluster,
+ Int_t iSimple, Int_t nfit,
+ Int_t *clustFit, TObjArray **clusters,
+ Double_t *parOk,
+ TObjArray& clusterList)
+{
+ /// Find selected clusters to selected pad charges
+
+ // AliDebug(2,Form("iSimple=%d nfit=%d",iSimple,nfit));
+
+ TH2D *mlem = (TH2D*) gROOT->FindObject("mlem");
+ Double_t xmin = mlem->GetXaxis()->GetXmin() - mlem->GetXaxis()->GetBinWidth(1);
+ Double_t xmax = mlem->GetXaxis()->GetXmax() + mlem->GetXaxis()->GetBinWidth(1);
+ Double_t ymin = mlem->GetYaxis()->GetXmin() - mlem->GetYaxis()->GetBinWidth(1);
+ Double_t ymax = mlem->GetYaxis()->GetXmax() + mlem->GetYaxis()->GetBinWidth(1);
+ Double_t step[3]={0.01,0.002,0.02}, xPad = 0, yPad = 99999;
+
+ // Number of pads to use and number of virtual pads
+ Int_t npads = 0, nVirtual = 0, nfit0 = nfit;
+ for (Int_t i=0; i<cluster.Multiplicity(); ++i )
+ {
+ AliMUONPad* pad = cluster.Pad(i);
+ if ( pad->DX() < 0 ) ++nVirtual;
+ if ( pad->Status() !=1 ) continue;
+ if ( pad->DX() > 0 )
+ {
+ ++npads;
+ if (yPad > 9999)
+ {
+ xPad = pad->X();//fXyq[0][i];
+ yPad = pad->Y();//fXyq[1][i];
+ }
+ else
+ {
+ if (pad->DY() < pad->DX() ) //fXyq[4][i] < fXyq[3][i])
+ {
+ yPad = pad->Y();//fXyq[1][i];
+ }
+ else
+ {
+ xPad = pad->X();//fXyq[0][i];
+ }
+ }
+ }
+ }
+
+ fNpar = 0;
+ fQtot = 0;
+
+ if (npads < 2) return 0;
+
+ // FIXME : AliWarning("Reconnect the following code for hit/track passing ?");
+
+ // Int_t tracks[3] = {-1, -1, -1};
+
+ /*
+ Int_t digit = 0;
+ AliMUONDigit *mdig = 0;
+ for (Int_t cath=0; cath<2; cath++) {
+ for (Int_t i=0; i<fnPads[0]+fnPads[1]; i++) {
+ if (fPadIJ[0][i] != cath) continue;
+ if (fPadIJ[1][i] != 1) continue;
+ if (fXyq[3][i] < 0) continue; // exclude virtual pads
+ digit = TMath::Nint (fXyq[5][i]);
+ if (digit >= 0) mdig = fInput->Digit(cath,digit);
+ else mdig = fInput->Digit(TMath::Even(cath),-digit-1);
+ //if (!mdig) mdig = fInput->Digit(TMath::Even(cath),digit);
+ if (!mdig) continue; // protection for cluster display
+ if (mdig->Hit() >= 0) {
+ if (tracks[0] < 0) {
+ tracks[0] = mdig->Hit();
+ tracks[1] = mdig->Track(0);
+ } else if (mdig->Track(0) < tracks[1]) {
+ tracks[0] = mdig->Hit();
+ tracks[1] = mdig->Track(0);
+ }
+ }
+ if (mdig->Track(1) >= 0 && mdig->Track(1) != tracks[1]) {
+ if (tracks[2] < 0) tracks[2] = mdig->Track(1);
+ else tracks[2] = TMath::Min (tracks[2], mdig->Track(1));
+ }
+ } // for (Int_t i=0;
+ } // for (Int_t cath=0;
+ */
+
+ // Get number of pads in X and Y
+// Int_t nInX = 0, nInY;
+// PadsInXandY(cluster,nInX, nInY);
+ const Int_t kStatusToTest(1);
+
+ AliMpIntPair nofPads = cluster.NofPads(kStatusToTest);
+ Int_t nInX = nofPads.GetFirst();
+ Int_t nInY = nofPads.GetSecond();
+ //cout << " nInX and Y: " << nInX << " " << nInY << endl;
+
+ Int_t nfitMax = 3;
+ nfitMax = TMath::Min (nfitMax, (npads + 1) / 3);
+ if (nfitMax > 1) {
+ if (nInX < 3 && nInY < 3 || nInX == 3 && nInY < 3 || nInX < 3 && nInY == 3) nfitMax = 1; // not enough pads in each direction
+ }
+ if (nfit > nfitMax) nfit = nfitMax;
+
+ // Take cluster maxima as fitting seeds
+ TObjArray *pix;
+ AliMUONPad *pixPtr;
+ Int_t npxclu;
+ Double_t cont, cmax = 0, xseed = 0, yseed = 0, errOk[8], qq = 0;
+ Double_t xyseed[3][2], qseed[3], xyCand[3][2] = {{0},{0}}, sigCand[3][2] = {{0},{0}};
+
+ for (Int_t ifit=1; ifit<=nfit0; ifit++)
+ {
+ cmax = 0;
+ pix = clusters[clustFit[ifit-1]];
+ npxclu = pix->GetEntriesFast();
+ //qq = 0;
+ for (Int_t clu=0; clu<npxclu; ++clu)
+ {
+ pixPtr = (AliMUONPad*) pix->UncheckedAt(clu);
+ cont = pixPtr->Charge();
+ fQtot += cont;
+ if (cont > cmax)
+ {
+ cmax = cont;
+ xseed = pixPtr->Coord(0);
+ yseed = pixPtr->Coord(1);
+ }
+ qq += cont;
+ xyCand[0][0] += pixPtr->Coord(0) * cont;
+ xyCand[0][1] += pixPtr->Coord(1) * cont;
+ sigCand[0][0] += pixPtr->Coord(0) * pixPtr->Coord(0) * cont;
+ sigCand[0][1] += pixPtr->Coord(1) * pixPtr->Coord(1) * cont;
+ }
+ xyseed[ifit-1][0] = xseed;
+ xyseed[ifit-1][1] = yseed;
+ qseed[ifit-1] = cmax;
+ } // for (Int_t ifit=1;
+
+ xyCand[0][0] /= qq; // <x>
+ xyCand[0][1] /= qq; // <y>
+ sigCand[0][0] = sigCand[0][0]/qq - xyCand[0][0]*xyCand[0][0]; // <x^2> - <x>^2
+ sigCand[0][0] = sigCand[0][0] > 0 ? TMath::Sqrt (sigCand[0][0]) : 0;
+ sigCand[0][1] = sigCand[0][1]/qq - xyCand[0][1]*xyCand[0][1]; // <y^2> - <y>^2
+ sigCand[0][1] = sigCand[0][1] > 0 ? TMath::Sqrt (sigCand[0][1]) : 0;
+// if (fDebug) cout << xyCand[0][0] << " " << xyCand[0][1] << " " << sigCand[0][0] << " " << sigCand[0][1] << endl;
+
+ Int_t nDof, maxSeed[3];//, nMax = 0;
+ Double_t fmin, chi2o = 9999, chi2n;
+
+ TMath::Sort(nfit0, qseed, maxSeed, kTRUE); // in decreasing order
+
+ Double_t *gin = 0, func0, func1, param[8], step0[8];
+ Double_t param0[2][8]={{0},{0}}, deriv[2][8]={{0},{0}};
+ Double_t shift[8], stepMax, derMax, parmin[8], parmax[8], func2[2], shift0;
+ Double_t delta[8], scMax, dder[8], estim, shiftSave = 0;
+ Int_t min, max, nCall = 0, memory[8] = {0}, nLoop, idMax = 0, iestMax = 0, nFail;
+ Double_t rad, dist[3] = {0};
+
+ // Try to fit with one-track hypothesis, then 2-track. If chi2/dof is
+ // lower, try 3-track (if number of pads is sufficient).
+ for (Int_t iseed=0; iseed<nfit; iseed++)
+ {
+
+ if (iseed)
+ {
+ for (Int_t j=0; j<fNpar; j++)
+ {
+ param[j] = parOk[j];
+ }
+ } // for bounded params
+
+ for (Int_t j=0; j<3; j++)
+ {
+ step0[fNpar+j] = shift[fNpar+j] = step[j];
+ }
+
+ if (nfit == 1)
+ {
+ param[fNpar] = xyCand[0][0]; // take COG
+ }
+ else
+ {
+ param[fNpar] = xyseed[maxSeed[iseed]][0];
+ }
+ parmin[fNpar] = xmin;
+ parmax[fNpar++] = xmax;
+ if (nfit == 1)
+ {
+ param[fNpar] = xyCand[0][1]; // take COG
+ }
+ else
+ {
+ param[fNpar] = xyseed[maxSeed[iseed]][1];
+ }
+ parmin[fNpar] = ymin;
+ parmax[fNpar++] = ymax;
+ if (fNpar > 2)
+ {
+ param[fNpar] = fNpar == 4 ? 0.5 : 0.3;
+ parmin[fNpar] = 0;
+ parmax[fNpar++] = 1;
+ }
+ if (iseed)
+ {
+ for (Int_t j=0; j<fNpar; j++)
+ {
+ param0[1][j] = 0;
+ }
+ }
+
+ // Try new algorithm
+ min = nLoop = 1; stepMax = func2[1] = derMax = 999999; nFail = 0;
+
+ while (1)
+ {
+ max = !min;
+ Fcn1(cluster,fNpar, gin, func0, param, 1); nCall++;
+ //cout << " Func: " << func0 << endl;
+
+ func2[max] = func0;
+ for (Int_t j=0; j<fNpar; j++)
+ {
+ param0[max][j] = param[j];
+ delta[j] = step0[j];
+ param[j] += delta[j] / 10;
+ if (j > 0) param[j-1] -= delta[j-1] / 10;
+ Fcn1(cluster,fNpar, gin, func1, param, 1); nCall++;
+ deriv[max][j] = (func1 - func0) / delta[j] * 10; // first derivative
+ //cout << j << " " << deriv[max][j] << endl;
+ dder[j] = param0[0][j] != param0[1][j] ? (deriv[0][j] - deriv[1][j]) /
+ (param0[0][j] - param0[1][j]) : 0; // second derivative
+ }
+ param[fNpar-1] -= delta[fNpar-1] / 10;
+ if (nCall > 2000) break;
+
+ min = func2[0] < func2[1] ? 0 : 1;
+ nFail = min == max ? 0 : nFail + 1;
+
+ stepMax = derMax = estim = 0;
+ for (Int_t j=0; j<fNpar; j++)
+ {
+ // Estimated distance to minimum
+ shift0 = shift[j];
+ if (nLoop == 1)
+ {
+ shift[j] = TMath::Sign (step0[j], -deriv[max][j]); // first step
+ }
+ else if (TMath::Abs(deriv[0][j]) < 1.e-3 && TMath::Abs(deriv[1][j]) < 1.e-3)
+ {
+ shift[j] = 0;
+ }
+ else if (deriv[min][j]*deriv[!min][j] > 0 && TMath::Abs(deriv[min][j]) > TMath::Abs(deriv[!min][j])
+ || TMath::Abs(deriv[0][j]-deriv[1][j]) < 1.e-3 || TMath::Abs(dder[j]) < 1.e-6)
+ {
+ shift[j] = -TMath::Sign (shift[j], (func2[0]-func2[1]) * (param0[0][j]-param0[1][j]));
+ }
+ if (min == max)
+ {
+ if (memory[j] > 1)
+ {
+ shift[j] *= 2;
+ }
+ memory[j]++;
+ }
+ else
+ {
+ shift[j] = dder[j] != 0 ? -deriv[min][j] / dder[j] : 0;
+ memory[j] = 0;
+ }
+
+ if (TMath::Abs(shift[j])/step0[j] > estim)
+ {
+ estim = TMath::Abs(shift[j])/step0[j];
+ iestMax = j;
+ }
+
+ // Too big step
+ if (TMath::Abs(shift[j])/step0[j] > 10) shift[j] = TMath::Sign(10.,shift[j]) * step0[j]; //
+
+ // Failed to improve minimum
+ if (min != max)
+ {
+ memory[j] = 0;
+ param[j] = param0[min][j];
+ if (TMath::Abs(shift[j]+shift0) > 0.1*step0[j])
+ {
+ shift[j] = (shift[j] + shift0) / 2;
+ }
+ else
+ {
+ shift[j] /= -2;
+ }
+ }
+
+ // Too big step
+ if (TMath::Abs(shift[j]*deriv[min][j]) > func2[min])
+ {
+ shift[j] = TMath::Sign (func2[min]/deriv[min][j], shift[j]);
+ }
+
+ // Introduce step relaxation factor
+ if (memory[j] < 3)
+ {
+ scMax = 1 + 4 / TMath::Max(nLoop/2.,1.);
+ if (TMath::Abs(shift0) > 0 && TMath::Abs(shift[j]/shift0) > scMax)
+ {
+ shift[j] = TMath::Sign (shift0*scMax, shift[j]);
+ }
+ }
+ param[j] += shift[j];
+ //MLEM Check parameter limits 27-12-2004
+ if (param[j] < parmin[j])
+ {
+ shift[j] = parmin[j] - param[j];
+ param[j] = parmin[j];
+ }
+ else if (param[j] > parmax[j])
+ {
+ shift[j] = parmax[j] - param[j];
+ param[j] = parmax[j];
+ }
+ //cout << " xxx " << j << " " << shift[j] << " " << param[j] << endl;
+ stepMax = TMath::Max (stepMax, TMath::Abs(shift[j]/step0[j]));
+ if (TMath::Abs(deriv[min][j]) > derMax)
+ {
+ idMax = j;
+ derMax = TMath::Abs (deriv[min][j]);
+ }
+ } // for (Int_t j=0; j<fNpar;
+
+ if (estim < 1 && derMax < 2 || nLoop > 150) break; // minimum was found
+
+ nLoop++;
+
+ // Check for small step
+ if (shift[idMax] == 0)
+ {
+ shift[idMax] = step0[idMax]/10;
+ param[idMax] += shift[idMax];
+ continue;
+ }
+
+ if (!memory[idMax] && derMax > 0.5 && nLoop > 10)
+ {
+ if (dder[idMax] != 0 && TMath::Abs(deriv[min][idMax]/dder[idMax]/shift[idMax]) > 10)
+ {
+ if (min == max) dder[idMax] = -dder[idMax];
+ shift[idMax] = -deriv[min][idMax] / dder[idMax] / 10;
+ param[idMax] += shift[idMax];
+ stepMax = TMath::Max (stepMax, TMath::Abs(shift[idMax])/step0[idMax]);
+ if (min == max) shiftSave = shift[idMax];
+ }
+ if (nFail > 10)
+ {
+ param[idMax] -= shift[idMax];
+ shift[idMax] = 4 * shiftSave * (gRandom->Rndm(0) - 0.5);
+ param[idMax] += shift[idMax];
+ }
+ }
+ } // while (1)
+
+ fmin = func2[min];
+
+ nDof = npads - fNpar + nVirtual;
+ if (!nDof) nDof++;
+ chi2n = fmin / nDof;
+// if (fDebug) cout << " Chi2 " << chi2n << " " << fNpar << endl;
+
+ if (chi2n*1.2+1.e-6 > chi2o ) { fNpar -= 3; break; }
+
+ // Save parameters and errors
+
+ if (nInX == 1) {
+ // One pad per direction
+ for (Int_t i=0; i<fNpar; i++) if (i == 0 || i == 2 || i == 5) param0[min][i] = xPad;
+ }
+ if (nInY == 1) {
+ // One pad per direction
+ for (Int_t i=0; i<fNpar; i++) if (i == 1 || i == 3 || i == 6) param0[min][i] = yPad;
+ }
+
+ /*
+ if (iseed > 0) {
+ // Find distance to the nearest neighbour
+ dist[0] = dist[1] = TMath::Sqrt ((param0[min][0]-param0[min][2])*
+ (param0[min][0]-param0[min][2])
+ +(param0[min][1]-param0[min][3])*
+ (param0[min][1]-param0[min][3]));
+ if (iseed > 1) {
+ dist[2] = TMath::Sqrt ((param0[min][0]-param0[min][5])*
+ (param0[min][0]-param0[min][5])
+ +(param0[min][1]-param0[min][6])*
+ (param0[min][1]-param0[min][6]));
+ rad = TMath::Sqrt ((param0[min][2]-param0[min][5])*
+ (param0[min][2]-param0[min][5])
+ +(param0[min][3]-param0[min][6])*
+ (param0[min][3]-param0[min][6]));
+ if (dist[2] < dist[0]) dist[0] = dist[2];
+ if (rad < dist[1]) dist[1] = rad;
+ if (rad < dist[2]) dist[2] = rad;
+ }
+ cout << dist[0] << " " << dist[1] << " " << dist[2] << endl;
+ if (dist[TMath::LocMin(iseed+1,dist)] < 1.) { fNpar -= 3; break; }
+ }
+ */
+
+ for (Int_t i=0; i<fNpar; i++) {
+ parOk[i] = param0[min][i];
+ //errOk[i] = fmin;
+ errOk[i] = chi2n;
+ // Bounded params
+ parOk[i] = TMath::Max (parOk[i], parmin[i]);
+ parOk[i] = TMath::Min (parOk[i], parmax[i]);
+ }
+
+ chi2o = chi2n;
+ if (fmin < 0.1) break; // !!!???
+ } // for (Int_t iseed=0;
+
+// if (fDebug) {
+// for (Int_t i=0; i<fNpar; i++) {
+// if (i == 4 || i == 7) {
+// if (i == 7 || i == 4 && fNpar < 7) cout << parOk[i] << endl;
+// else cout << parOk[i] * (1-parOk[7]) << endl;
+// continue;
+// }
+// cout << parOk[i] << " " << errOk[i] << endl;
+// }
+// }
+ nfit = (fNpar + 1) / 3;
+ dist[0] = dist[1] = dist[2] = 0;
+
+ if (nfit > 1) {
+ // Find distance to the nearest neighbour
+ dist[0] = dist[1] = TMath::Sqrt ((parOk[0]-parOk[2])*
+ (parOk[0]-parOk[2])
+ +(parOk[1]-parOk[3])*
+ (parOk[1]-parOk[3]));
+ if (nfit > 2) {
+ dist[2] = TMath::Sqrt ((parOk[0]-parOk[5])*
+ (parOk[0]-parOk[5])
+ +(parOk[1]-parOk[6])*
+ (parOk[1]-parOk[6]));
+ rad = TMath::Sqrt ((parOk[2]-parOk[5])*
+ (parOk[2]-parOk[5])
+ +(parOk[3]-parOk[6])*
+ (parOk[3]-parOk[6]));
+ if (dist[2] < dist[0]) dist[0] = dist[2];
+ if (rad < dist[1]) dist[1] = rad;
+ if (rad < dist[2]) dist[2] = rad;
+ }
+ }
+
+ Int_t indx;
+
+ //if (!fDraw) {
+
+ Double_t coef = 0;
+ if (iSimple) fnCoupled = 0;
+ //for (Int_t j=0; j<nfit; j++) {
+ for (Int_t j=nfit-1; j>=0; j--) {
+ indx = j<2 ? j*2 : j*2+1;
+ if (nfit == 1) coef = 1;
+ else coef = j==nfit-1 ? parOk[indx+2] : 1-coef;
+ coef = TMath::Max (coef, 0.);
+ if (nfit == 3 && j < 2) coef = j==1 ? coef*parOk[indx+2] : coef - parOk[7];
+ coef = TMath::Max (coef, 0.);
+
+ //void AliMUONClusterFinderMLEM::AddRawCluster(Double_t x, Double_t y,
+ // Double_t qTot, Double_t fmin,
+ // Int_t nfit, Int_t *tracks,
+ // Double_t /*sigx*/,
+ // Double_t /*sigy*/,
+ // Double_t /*dist*/)
+
+ if ( coef*fQtot >= 14 )
+ {
+ AliMUONCluster* cluster = new AliMUONCluster();
+
+ cluster->SetCharge(coef*fQtot,coef*fQtot);
+ cluster->SetPosition(TVector2(parOk[indx],parOk[indx+1]),TVector2(sigCand[0][0],sigCand[0][1]));
+ cluster->SetChi2(dist[TMath::LocMin(nfit,dist)]);
+
+ // FIXME: we miss some information in this cluster, as compared to
+ // the original AddRawCluster code.
+
+ AliDebug(2,Form("Adding RawCluster detElemId %4d mult %2d charge %5d (xl,yl)=(%9.6g,%9.6g)",
+ fDetElemId,cluster->Multiplicity(),(Int_t)cluster->Charge(),
+ cluster->Position().X(),cluster->Position().Y()));
+
+ clusterList.Add(cluster);
+ }
+ // AddRawCluster (parOk[indx], // double x
+ // parOk[indx+1], // double y
+ // coef*qTot, // double charge
+ // errOk[indx], // double fmin
+ // nfit0+10*nfit+100*nMax+10000*fnCoupled, // int nfit
+ // tracks, // int* tracks
+ // sigCand[0][0], // double sigx
+ // sigCand[0][1], // double sigy
+ // dist[TMath::LocMin(nfit,dist)] // double dist
+ // );
+ }
+ return nfit;
+ }
+
+
+//_____________________________________________________________________________
+void
+AliMUONClusterSplitterMLEM::Split(const AliMUONCluster& cluster,
+ TH2 *mlem,
+ Double_t *coef,
+ TObjArray& clusterList)
+{
+ /// The main steering function to work with clusters of pixels in anode
+ /// plane (find clusters, decouple them from each other, merge them (if
+ /// necessary), pick up coupled pads, call the fitting function)
+
+ Int_t nx = mlem->GetNbinsX();
+ Int_t ny = mlem->GetNbinsY();
+ Int_t nPix = fPixArray->GetEntriesFast();
+
+ Bool_t *used = new Bool_t[ny*nx];
+ Double_t cont;
+ Int_t nclust = 0, indx, indx1;
+
+ for (Int_t i=0; i<ny*nx; i++) used[i] = kFALSE;
+
+ TObjArray *clusters[200]={0};
+ TObjArray *pix;
+
+ // Find clusters of histogram bins (easier to work in 2-D space)
+ for (Int_t i=1; i<=ny; i++)
+ {
+ for (Int_t j=1; j<=nx; j++)
+ {
+ indx = (i-1)*nx + j - 1;
+ if (used[indx]) continue;
+ cont = mlem->GetCellContent(j,i);
+ if (cont < 0.5) continue;
+ pix = new TObjArray(20);
+ used[indx] = 1;
+ pix->Add(BinToPix(mlem,j,i));
+ AddBin(mlem, i, j, 0, used, pix); // recursive call
+ if (nclust >= 200) AliFatal(" Too many clusters !!!");
+ clusters[nclust++] = pix;
+ } // for (Int_t j=1; j<=nx; j++) {
+ } // for (Int_t i=1; i<=ny;
+// if (fDebug) cout << nclust << endl;
+ delete [] used; used = 0;
+
+ // Compute couplings between clusters and clusters to pads
+ Int_t npad = cluster.Multiplicity();
+
+ // Exclude pads with overflows
+ for (Int_t j=0; j<npad; ++j)
+ {
+ AliMUONPad* pad = cluster.Pad(j);
+ if ( pad->IsSaturated() )
+ {
+ pad->SetStatus(-5);
+ }
+ else
+ {
+ pad->SetStatus(0);
+ }
+ }
+
+ // Compute couplings of clusters to pads
+ TMatrixD aijclupad(nclust,npad);
+ aijclupad = 0;
+ Int_t npxclu;
+ for (Int_t iclust=0; iclust<nclust; ++iclust)
+ {
+ pix = clusters[iclust];
+ npxclu = pix->GetEntriesFast();
+ for (Int_t i=0; i<npxclu; ++i)
+ {
+ indx = fPixArray->IndexOf(pix->UncheckedAt(i));
+ for (Int_t j=0; j<npad; ++j)
+ {
+ AliMUONPad* pad = cluster.Pad(j);
+ if ( pad->Status() < 0 && pad->Status() != -5) continue;
+ if (coef[j*nPix+indx] < fgkCouplMin) continue;
+ aijclupad(iclust,j) += coef[j*nPix+indx];
+ }
+ }
+ }
+
+ // Compute couplings between clusters
+ TMatrixD aijcluclu(nclust,nclust);
+ aijcluclu = 0;
+ for (Int_t iclust=0; iclust<nclust; ++iclust)
+ {
+ for (Int_t j=0; j<npad; ++j)
+ {
+ // Exclude overflows
+ if ( cluster.Pad(j)->Status() < 0) continue;
+ if (aijclupad(iclust,j) < fgkCouplMin) continue;
+ for (Int_t iclust1=iclust+1; iclust1<nclust; iclust1++)
+ {
+ if (aijclupad(iclust1,j) < fgkCouplMin) continue;
+ aijcluclu(iclust,iclust1) +=
+ TMath::Sqrt (aijclupad(iclust,j)*aijclupad(iclust1,j));
+ }
+ }
+ }
+ for (Int_t iclust=0; iclust<nclust; ++iclust)
+ {
+ for (Int_t iclust1=iclust+1; iclust1<nclust; ++iclust1)
+ {
+ aijcluclu(iclust1,iclust) = aijcluclu(iclust,iclust1);
+ }
+ }
+
+ // Find groups of coupled clusters
+ used = new Bool_t[nclust];
+ for (Int_t i=0; i<nclust; i++) used[i] = kFALSE;
+ Int_t *clustNumb = new Int_t[nclust];
+ Int_t nCoupled, nForFit, minGroup[3], clustFit[3], nfit = 0;
+ Double_t parOk[8];
+
+ for (Int_t igroup=0; igroup<nclust; igroup++)
+ {
+ if (used[igroup]) continue;
+ used[igroup] = kTRUE;
+ clustNumb[0] = igroup;
+ nCoupled = 1;
+ // Find group of coupled clusters
+ AddCluster(igroup, nclust, aijcluclu, used, clustNumb, nCoupled); // recursive
+
+ // if (fDebug) {
+ // cout << " nCoupled: " << nCoupled << endl;
+ // for (Int_t i=0; i<nCoupled; i++) cout << clustNumb[i] << " "; cout << endl;
+ // }
+
+ fnCoupled = nCoupled;
+
+ while (nCoupled > 0)
+ {
+ if (nCoupled < 4)
+ {
+ nForFit = nCoupled;
+ for (Int_t i=0; i<nCoupled; i++) clustFit[i] = clustNumb[i];
+ }
+ else
+ {
+ // Too many coupled clusters to fit - try to decouple them
+ // Find the lowest coupling of 1, 2, min(3,nLinks/2) pixels with
+ // all the others in the group
+ for (Int_t j=0; j<3; j++) minGroup[j] = -1;
+ /*Double_t coupl =*/ MinGroupCoupl(nCoupled, clustNumb, aijcluclu, minGroup);
+
+ // Flag clusters for fit
+ nForFit = 0;
+ while (minGroup[nForFit] >= 0 && nForFit < 3)
+ {
+ clustFit[nForFit] = clustNumb[minGroup[nForFit]];
+ clustNumb[minGroup[nForFit]] -= 999;
+ nForFit++;
+ }
+ } // else
+
+ // Select pads for fit.
+ if (SelectPad(cluster,nCoupled, nForFit, clustNumb, clustFit, aijclupad) < 3 && nCoupled > 1)
+ {
+ // Deselect pads
+ for (Int_t j=0; j<npad; ++j)
+ {
+ AliMUONPad* pad = cluster.Pad(j);
+ if ( pad->Status()==1 ) pad->SetStatus(0);
+ if ( pad->Status()==-9) pad->SetStatus(-5);
+ }
+ // Merge the failed cluster candidates (with too few pads to fit) with
+ // the one with the strongest coupling
+ Merge(cluster,nForFit, nCoupled, clustNumb, clustFit, clusters, aijcluclu, aijclupad);
+ }
+ else
+ {
+ // Do the fit
+ nfit = Fit(cluster,0, nForFit, clustFit, clusters, parOk, clusterList);
+ }
+
+ // Subtract the fitted charges from pads with strong coupling and/or
+ // return pads for further use
+ UpdatePads(cluster,nfit, parOk);
+
+ // Mark used pads
+ for (Int_t j=0; j<npad; ++j)
+ {
+ AliMUONPad* pad = cluster.Pad(j);
+ if ( pad->Status()==1 ) pad->SetStatus(-1);
+ if ( pad->Status()==-9) pad->SetStatus(-5);
+ }
+
+ // Sort the clusters (move to the right the used ones)
+ Int_t beg = 0, end = nCoupled - 1;
+ while (beg < end)
+ {
+ if (clustNumb[beg] >= 0) { ++beg; continue; }
+ for (Int_t j=end; j>beg; --j)
+ {
+ if (clustNumb[j] < 0) continue;
+ end = j - 1;
+ indx = clustNumb[beg];
+ clustNumb[beg] = clustNumb[j];
+ clustNumb[j] = indx;
+ break;
+ }
+ ++beg;
+ }
+
+ nCoupled -= nForFit;
+ if (nCoupled > 3)
+ {
+ // Remove couplings of used clusters
+ for (Int_t iclust=nCoupled; iclust<nCoupled+nForFit;++ iclust)
+ {
+ indx = clustNumb[iclust] + 999;
+ for (Int_t iclust1=0; iclust1<nCoupled; ++iclust1)
+ {
+ indx1 = clustNumb[iclust1];
+ aijcluclu(indx,indx1) = aijcluclu(indx1,indx) = 0;
+ }
+ }
+
+ // Update the remaining clusters couplings (exclude couplings from
+ // the used pads)
+ for (Int_t j=0; j<npad; ++j)
+ {
+ AliMUONPad* pad = cluster.Pad(j);
+ if ( pad->Status() != -1) continue;
+ for (Int_t iclust=0; iclust<nCoupled; ++iclust)
+ {
+ indx = clustNumb[iclust];
+ if (aijclupad(indx,j) < fgkCouplMin) continue;
+ for (Int_t iclust1=iclust+1; iclust1<nCoupled; ++iclust1)
+ {
+ indx1 = clustNumb[iclust1];
+ if (aijclupad(indx1,j) < fgkCouplMin) continue;
+ // Check this
+ aijcluclu(indx,indx1) -=
+ TMath::Sqrt (aijclupad(indx,j)*aijclupad(indx1,j));
+ aijcluclu(indx1,indx) = aijcluclu(indx,indx1);
+ }
+ }
+ pad->SetStatus(-8);
+ } // for (Int_t j=0; j<npad;
+ } // if (nCoupled > 3)
+ } // while (nCoupled > 0)
+ } // for (Int_t igroup=0; igroup<nclust;
+
+ for (Int_t iclust=0; iclust<nclust; iclust++)
+ {
+ pix = clusters[iclust];
+ pix->Clear();
+ delete pix;
+ pix = 0;
+ }
+ delete [] clustNumb;
+ clustNumb = 0;
+ delete [] used;
+ used = 0;
+
+}
+
+//_____________________________________________________________________________
+void
+AliMUONClusterSplitterMLEM::Merge(const AliMUONCluster& cluster,
+ Int_t nForFit, Int_t nCoupled,
+ Int_t *clustNumb, Int_t *clustFit,
+ TObjArray **clusters,
+ TMatrixD& aijcluclu, TMatrixD& aijclupad)
+{
+ /// Merge the group of clusters with the one having the strongest coupling with them
+
+ Int_t indx, indx1, npxclu, npxclu1, imax=0;
+ TObjArray *pix, *pix1;
+ Double_t couplMax;
+
+ for (Int_t icl=0; icl<nForFit; ++icl)
+ {
+ indx = clustFit[icl];
+ pix = clusters[indx];
+ npxclu = pix->GetEntriesFast();
+ couplMax = -1;
+ for (Int_t icl1=0; icl1<nCoupled; ++icl1)
+ {
+ indx1 = clustNumb[icl1];
+ if (indx1 < 0) continue;
+ if ( aijcluclu(indx,indx1) > couplMax)
+ {
+ couplMax = aijcluclu(indx,indx1);
+ imax = indx1;
+ }
+ } // for (Int_t icl1=0;
+ // Add to it
+ pix1 = clusters[imax];
+ npxclu1 = pix1->GetEntriesFast();
+ // Add pixels
+ for (Int_t i=0; i<npxclu; ++i)
+ {
+ pix1->Add(pix->UncheckedAt(i));
+ pix->RemoveAt(i);
+ }
+
+ //Add cluster-to-cluster couplings
+ for (Int_t icl1=0; icl1<nCoupled; ++icl1)
+ {
+ indx1 = clustNumb[icl1];
+ if (indx1 < 0 || indx1 == imax) continue;
+ aijcluclu(indx1,imax) += aijcluclu(indx,indx1);
+ aijcluclu(imax,indx1) = aijcluclu(indx1,imax);
+ }
+ aijcluclu(indx,imax) = aijcluclu(imax,indx) = 0;
+
+ //Add cluster-to-pad couplings
+ for (Int_t j=0; j<cluster.Multiplicity(); ++j)
+ {
+ AliMUONPad* pad = cluster.Pad(j);
+ if ( pad->Status() < 0 && pad->Status() != -5 ) continue;// exclude used pads
+ aijclupad(imax,j) += aijclupad(indx,j);
+ aijclupad(indx,j) = 0;
+ }
+ } // for (Int_t icl=0; icl<nForFit;
+}
+
+
+//_____________________________________________________________________________
+Double_t
+AliMUONClusterSplitterMLEM::MinGroupCoupl(Int_t nCoupled, Int_t *clustNumb,
+ TMatrixD& aijcluclu, Int_t *minGroup)
+{
+ /// Find group of clusters with minimum coupling to all the others
+
+ Int_t i123max = TMath::Min(3,nCoupled/2);
+ Int_t indx, indx1, indx2, indx3, nTot = 0;
+ Double_t *coupl1 = 0, *coupl2 = 0, *coupl3 = 0;
+
+ for (Int_t i123=1; i123<=i123max; i123++) {
+
+ if (i123 == 1) {
+ coupl1 = new Double_t [nCoupled];
+ for (Int_t i=0; i<nCoupled; i++) coupl1[i] = 0;
+ }
+ else if (i123 == 2) {
+ nTot = nCoupled*nCoupled;
+ coupl2 = new Double_t [nTot];
+ for (Int_t i=0; i<nTot; i++) coupl2[i] = 9999;
+ } else {
+ nTot = nTot*nCoupled;
+ coupl3 = new Double_t [nTot];
+ for (Int_t i=0; i<nTot; i++) coupl3[i] = 9999;
+ } // else
+
+ for (Int_t i=0; i<nCoupled; i++) {
+ indx1 = clustNumb[i];
+ for (Int_t j=i+1; j<nCoupled; j++) {
+ indx2 = clustNumb[j];
+ if (i123 == 1) {
+ coupl1[i] += aijcluclu(indx1,indx2);
+ coupl1[j] += aijcluclu(indx1,indx2);
+ }
+ else if (i123 == 2) {
+ indx = i*nCoupled + j;
+ coupl2[indx] = coupl1[i] + coupl1[j];
+ coupl2[indx] -= 2 * (aijcluclu(indx1,indx2));
+ } else {
+ for (Int_t k=j+1; k<nCoupled; k++) {
+ indx3 = clustNumb[k];
+ indx = i*nCoupled*nCoupled + j*nCoupled + k;
+ coupl3[indx] = coupl2[i*nCoupled+j] + coupl1[k];
+ coupl3[indx] -= 2 * (aijcluclu(indx1,indx3)+aijcluclu(indx2,indx3));
+ }
+ } // else
+ } // for (Int_t j=i+1;
+ } // for (Int_t i=0;
+ } // for (Int_t i123=1;
+
+ // Find minimum coupling
+ Double_t couplMin = 9999;
+ Int_t locMin = 0;
+
+ for (Int_t i123=1; i123<=i123max; i123++) {
+ if (i123 == 1) {
+ locMin = TMath::LocMin(nCoupled, coupl1);
+ couplMin = coupl1[locMin];
+ minGroup[0] = locMin;
+ delete [] coupl1; coupl1 = 0;
+ }
+ else if (i123 == 2) {
+ locMin = TMath::LocMin(nCoupled*nCoupled, coupl2);
+ if (coupl2[locMin] < couplMin) {
+ couplMin = coupl2[locMin];
+ minGroup[0] = locMin/nCoupled;
+ minGroup[1] = locMin%nCoupled;
+ }
+ delete [] coupl2; coupl2 = 0;
+ } else {
+ locMin = TMath::LocMin(nTot, coupl3);
+ if (coupl3[locMin] < couplMin) {
+ couplMin = coupl3[locMin];
+ minGroup[0] = locMin/nCoupled/nCoupled;
+ minGroup[1] = locMin%(nCoupled*nCoupled)/nCoupled;
+ minGroup[2] = locMin%nCoupled;
+ }
+ delete [] coupl3; coupl3 = 0;
+ } // else
+ } // for (Int_t i123=1;
+ return couplMin;
+}
+
+//_____________________________________________________________________________
+Int_t
+AliMUONClusterSplitterMLEM::SelectPad(const AliMUONCluster& cluster,
+ Int_t nCoupled, Int_t nForFit,
+ Int_t *clustNumb, Int_t *clustFit,
+ TMatrixD& aijclupad)
+{
+ /// Select pads for fit. If too many coupled clusters, find pads giving
+ /// the strongest coupling with the rest of clusters and exclude them from the fit.
+
+ Int_t npad = cluster.Multiplicity();
+ Double_t *padpix = 0;
+
+ if (nCoupled > 3)
+ {
+ padpix = new Double_t[npad];
+ for (Int_t i=0; i<npad; i++) padpix[i] = 0;
+ }
+
+ Int_t nOK = 0, indx, indx1;
+ for (Int_t iclust=0; iclust<nForFit; ++iclust)
+ {
+ indx = clustFit[iclust];
+ for (Int_t j=0; j<npad; j++)
+ {
+ if ( aijclupad(indx,j) < fgkCouplMin) continue;
+ AliMUONPad* pad = cluster.Pad(j);
+ if ( pad->Status() == -5 ) pad->SetStatus(-0); // flag overflow
+ if ( pad->Status() < 0 ) continue; // exclude overflows and used pads
+ if ( !pad->Status() )
+ {
+ pad->SetStatus(1);
+ ++nOK; // pad to be used in fit
+ }
+ if (nCoupled > 3)
+ {
+ // Check other clusters
+ for (Int_t iclust1=0; iclust1<nCoupled; ++iclust1)
+ {
+ indx1 = clustNumb[iclust1];
+ if (indx1 < 0) continue;
+ if ( aijclupad(indx1,j) < fgkCouplMin ) continue;
+ padpix[j] += aijclupad(indx1,j);
+ }
+ } // if (nCoupled > 3)
+ } // for (Int_t j=0; j<npad;
+ } // for (Int_t iclust=0; iclust<nForFit
+ if (nCoupled < 4) return nOK;
+
+ Double_t aaa = 0;
+ for (Int_t j=0; j<npad; ++j)
+ {
+ if (padpix[j] < fgkCouplMin) continue;
+ aaa += padpix[j];
+ cluster.Pad(j)->SetStatus(-1); // exclude pads with strong coupling to the other clusters
+ nOK--;
+ }
+ delete [] padpix;
+ padpix = 0;
+ return nOK;
+}
+
+//_____________________________________________________________________________
+void
+AliMUONClusterSplitterMLEM::UpdatePads(const AliMUONCluster& cluster,
+ Int_t /*nfit*/, Double_t *par)
+{
+ /// Subtract the fitted charges from pads with strong coupling
+
+ Int_t indx;
+ Double_t charge, coef=0;
+
+ for (Int_t j=0; j<cluster.Multiplicity(); ++j)
+ {
+ AliMUONPad* pad = cluster.Pad(j);
+ if ( pad->Status() != 1 ) continue;
+ if (fNpar != 0)
+ {
+ charge = 0;
+ for (Int_t i=fNpar/3; i>=0; --i)
+ {
+ // sum over tracks
+ indx = i<2 ? 2*i : 2*i+1;
+ if (fNpar == 2)
+ {
+ coef = 1;
+ }
+ else
+ {
+ coef = i==fNpar/3 ? par[indx+2] : 1-coef;
+ }
+ coef = TMath::Max (coef, 0.);
+ if (fNpar == 8 && i < 2)
+ {
+ coef = i==1 ? coef*par[indx+2] : coef - par[7];
+ }
+ coef = TMath::Max (coef, 0.);
+ charge += ChargeIntegration(par[indx],par[indx+1],*pad);
+ }
+ charge *= fQtot;
+ pad->SetCharge(pad->Charge()-charge);
+ } // if (fNpar != 0)
+
+ if (pad->Charge() > 6 /*fgkZeroSuppression*/) pad->SetStatus(0);
+ // return pad for further using // FIXME: remove usage of zerosuppression here
+
+ } // for (Int_t j=0;
+}
+
+
git://git.uio.no / u / mrichter / AliRoot.git / commitdiff