CbmRichRingFinderHoughImpl.h

Go to the documentation of this file.

/* Copyright (C) 2008-2021 UGiessen/JINR-LIT, Giessen/Dubna
   SPDX-License-Identifier: GPL-3.0-only
   Authors: Semen Lebedev [committer] */
 
#ifndef CBM_RICH_RING_FINDER_HOUGH_IMPL
#define CBM_RICH_RING_FINDER_HOUGH_IMPL
 
#include "CbmRichRingFinderData.h"
#include "CbmRichRingLight.h"
 
#include <map>
#include <vector>
 
using std::vector;
 
class CbmRichRingFitterCOP;
class CbmRichRingSelectAnn;
 
 
class CbmRichRingFinderHoughImpl {
 
 protected:
  static const unsigned short MAX_NOF_HITS = 65000;  // maximum number of hits in RICH detector
 
  // parameters of the Hough Transform algorithm
  unsigned short fNofParts;  // number of groups of hits for HT
 
  float fMaxDistance;    // maximum distance between two hits
  float fMinDistance;    // minimum distance between two hits
  float fMinDistanceSq;  // = fMinDistance*fMinDistance
  float fMaxDistanceSq;  // = fMaxDistance*fMaxDistance
 
  float fMinRadius;  // minimum radius of the ring
  float fMaxRadius;  // maximum radius of the ring
 
  float fDx;                  // x bin width of the ring center histogram
  float fDy;                  // y bin width of the ring center histogram
  float fDr;                  // width of the ring radius histogram
  unsigned short fNofBinsX;   // number of bins in X direction
  unsigned short fNofBinsY;   // number of bins in Y direction
  unsigned short fNofBinsXY;  // fNofBinsX*fNofBinsY
 
  unsigned short fHTCut;  // cut number of entries in maximum bin of XY histogram
 
  unsigned short fNofBinsR;  // number of bins in radius histogram
  unsigned short fHTCutR;    // cut number of entries in maximum bin of Radius histogram
 
  unsigned short fMinNofHitsInArea;  // minimum number of hits in the local area
 
  float fRmsCoeffEl;
  float fMaxCutEl;
  float fRmsCoeffCOP;
  float fMaxCutCOP;
 
  float fAnnCut;          //remove found hits only for good quality rings
  float fUsedHitsAllCut;  // percent of used hits
 
  double fTimeCut;
 
  float fCurMinX;  // current minimum X position of the local area
  float fCurMinY;  // current minimum Y position of the local area
 
  bool fUseAnnSelect;
 
  vector<CbmRichHoughHit> fData;          // Rich hits
  vector<unsigned short> fHist;           // XY histogram
  vector<unsigned short> fHistR;          // Radius histogram
  vector<vector<unsigned int>> fHitInd;   // store hit indexes for different group of hits
  vector<CbmRichRingLight*> fFoundRings;  // collect found rings
  CbmRichRingFitterCOP* fFitCOP;          // COP ring fitter
  CbmRichRingSelectAnn* fANNSelect;       // ANN selection criteria
 
  double fCurTime;
 
 public:
  CbmRichRingFinderHoughImpl();
 
  virtual ~CbmRichRingFinderHoughImpl();
 
  void SetParameters();
 
  void CalculateRingParameters(float x[], float y[], float* xc, float* yc, float* r);
 
  virtual void HoughTransformReconstruction();
 
  virtual void DefineLocalAreaAndHits(float x0, float y0, int* indmin, int* indmax);
 
  virtual void HoughTransform(unsigned int indmin, unsigned int indmax);
 
  virtual void HoughTransformGroup(unsigned int indmin, unsigned int indmax, int iPart);
 
  void FindPeak(int indmin, int indmax);
 
  void RingSelection();
 
  void ReAssignSharedHits(int ringInd1, int ringInd2);
 
  int GetHitIndexById(unsigned int hitId);
 
  void RemoveHitsAroundRing(int indmin, int indmax, CbmRichRingLight* ring);
 
  void Init();
 
  void DoFind();
 
  void SetData(const vector<CbmRichHoughHit>& data)
  {
    fData.clear();
    fData = data;
  }
 
  vector<CbmRichRingLight*>& GetFoundRings() { return fFoundRings; }
 
  void SetUseAnnSelect(bool use) { fUseAnnSelect = use; }
 
 private:
  CbmRichRingFinderHoughImpl(const CbmRichRingFinderHoughImpl&);
 
  CbmRichRingFinderHoughImpl& operator=(const CbmRichRingFinderHoughImpl&);
};
#endif