SMS.cc

Go to the documentation of this file.

#ifdef PROJECT_NAME
#include "RecoVertex/VertexTools/interface/SMS.h"
#else
#include <vector>
#include <algorithm>
#include "RecoVertex/VertexTools/interface/SMS.h"
using namespace std;
#endif
 
namespace {
 
  typedef std::pair<float, const GlobalPoint*> MyPair;
  typedef std::pair<float, float> FloatPair;
  typedef std::pair<GlobalPoint, float> GlPtWt;
  typedef std::pair<float, const GlPtWt*> MyPairWt;
 
  struct Sorter {
    bool operator()(const MyPair& pair1, const MyPair& pair2) { return (pair1.first < pair2.first); };
 
    bool operator()(const FloatPair& pair1, const FloatPair& pair2) { return (pair1.first < pair2.first); };
 
    bool operator()(const MyPairWt& pair1, const MyPairWt& pair2) { return (pair1.first < pair2.first); };
  };
 
  bool debug() { return false; }
 
  inline GlobalPoint& operator+=(GlobalPoint& a, const GlobalPoint& b) {
    a = GlobalPoint(a.x() + b.x(), a.y() + b.y(), a.z() + b.z());
    return a;
  }
  inline GlobalPoint& operator/=(GlobalPoint& a, float b) {
    a = GlobalPoint(a.x() / b, a.y() / b, a.z() / b);
    return a;
  }
 
  GlobalPoint average(const std::vector<MyPair>& pairs, int nq) {
    GlobalPoint location(0, 0, 0);
    for (std::vector<MyPair>::const_iterator i = pairs.begin(); i != (pairs.begin() + nq); ++i)
      location += *(i->second);
    location /= nq;
    return location;
  }
 
  GlobalPoint average(const std::vector<MyPairWt>& pairs, int nq) {
    GlobalPoint location(0, 0, 0);
    for (std::vector<MyPairWt>::const_iterator i = pairs.begin(); i != (pairs.begin() + nq); ++i)
      location += (i->second)->first;
    location /= nq;
    return location;
  }
 
  typedef SMS::SMSType SMSType;
}  // namespace
 
SMS::SMS(SMSType tp, float q) : theType(tp), theRatio(q) {}
 
GlobalPoint SMS::location(const std::vector<GlobalPoint>& data) const {
  if (theType & Weighted) {
    std::cout << "[SMS] warning: Weighted SMS was asked for, but data are "
              << "weightless!" << std::endl;
  };
  int nobs = data.size();
  int nq = (int)ceil(theRatio * nobs);
  // cout << "nobs= " << nobs << "  nq= " << nq << endl;
 
  // Compute distances
  std::vector<MyPair> pairs;
 
  for (std::vector<GlobalPoint>::const_iterator i = data.begin(); i != data.end(); ++i) {
    std::vector<float> D;
    // Compute squared distances to all points
    for (std::vector<GlobalPoint>::const_iterator j = data.begin(); j != data.end(); ++j) {
      D.push_back((*j - *i).mag2());
    }
    // Find q-quantile in each row of the distance matrix
    sort(D.begin(), D.end());
    MyPair tmp(D[nq - 1], &(*i));
    pairs.push_back(tmp);
  };
 
  // Sort pairs by first element
  sort(pairs.begin(), pairs.end(), Sorter());
  if (!(theType & SMS::Interpolate) && !(theType & SMS::Iterate)) {
    // we dont interpolate, we dont iterate, so we can stop right here.
    // cout << "No interpolation, no iteration" << endl;
    return *(pairs.begin()->second);
  };
 
  // we dont iterate, or we dont have anything to iterate (anymore?)
  // so we stop here
 
  // cout << "nobs= " << nobs << "  nq= " << nq << endl;
  if (!(theType & SMS::Iterate) || nq <= 2)
    return average(pairs, nq);
 
  // we iterate (recursively)
 
  std::vector<GlobalPoint> data1;
  std::vector<MyPair>::iterator j;
 
  for (j = pairs.begin(); j - pairs.begin() < nq; ++j)
    data1.push_back(*(j->second));
 
  return this->location(data1);
}
 
GlobalPoint SMS::location(const std::vector<GlPtWt>& wdata) const {
  if (!(theType & Weighted)) {
    std::vector<GlobalPoint> points;
    for (std::vector<GlPtWt>::const_iterator i = wdata.begin(); i != wdata.end(); ++i) {
      points.push_back(i->first);
    };
    if (debug()) {
      std::cout << "[SMS] Unweighted SMS was asked for; ignoring the weights." << std::endl;
    };
    return location(points);
  };
  // int nobs=wdata.size();
  // Sum of weights
  float Sumw = 0;
  std::vector<GlPtWt>::const_iterator i, j;
  for (i = wdata.begin(); i != wdata.end(); ++i)
    Sumw += i->second;
 
  // Compute pairwise distances
  std::vector<MyPairWt> pairs;
  for (i = wdata.begin(); i != wdata.end(); ++i) {
    std::vector<FloatPair> D;
    // Compute squared distances to all points
    for (j = wdata.begin(); j != wdata.end(); ++j)
      D.push_back(FloatPair((j->first - i->first).mag2(), j->second));
    // Find weighted q-quantile in the distance vector
    sort(D.begin(), D.end());
    float sumw = 0;
    std::vector<FloatPair>::const_iterator where;
    for (where = D.begin(); where != D.end(); ++where) {
      sumw += where->second;
      // cout << sumw << endl;
      if (sumw > Sumw * theRatio)
        break;
    }
    MyPairWt tmp(where->first, &(*i));
    pairs.push_back(tmp);
    // cout << where->first << endl;
  };
 
  // Sort pairs by first element
  sort(pairs.begin(), pairs.end(), Sorter());
 
  // Find weighted q-quantile in the list of pairs
  float sumw = 0;
  int nq = 0;
  std::vector<MyPairWt>::const_iterator k;
  for (k = pairs.begin(); k != pairs.end(); ++k) {
    sumw += k->second->second;
    ++nq;
    if (sumw > Sumw * theRatio)
      break;
  }
 
  // cout << "nobs= " << nobs << "  nq= " << nq << endl;
 
  if (!(theType & SMS::Interpolate) && !(theType & SMS::Iterate)) {
    // we dont interpolate, we dont iterate, so we can stop right here.
    // cout << "No interpolation, no iteration" << endl;
    return pairs.begin()->second->first;
  };
 
  // we dont iterate, or we dont have anything to iterate (anymore?)
  // so we stop here
 
  // cout << "nobs= " << nobs << "  nq= " << nq << endl;
  if (!(theType & SMS::Iterate) || nq <= 2)
    return average(pairs, nq);
 
  // we iterate (recursively)
 
  std::vector<GlPtWt> wdata1;
 
  for (k = pairs.begin(); k - pairs.begin() < nq; ++k)
    wdata1.push_back(*(k->second));
 
  return this->location(wdata1);
}