evFeatureRanker.h

Go to the documentation of this file.

/*
 *
 * EVITA: Efficient Visualization of Terascale Datasets
 * Copyright (C) 2000-2016  Team Evita
 * 
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Library General Public
 * License as published by the Free Software Foundation; either
 * version 2 of the License, or (at your option) any later version.
 * 
 * This library is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Library General Public License for more details.
 * 
 * You should have received a copy of the GNU Library General Public
 * License along with this library; if not, write to the
 * Free Software Foundation, Inc., 675 Mass Ave, Cambridge,
 * MA 02139, USA.
 *
 */


#ifndef __evFeatureRanker_h
#define __evFeatureRanker_h


#include "evProcessObject.h"
#include "evScalarField.h"
#include "evSegmentationMap.h"
#include "evFeatureRankerPriorityEntry.h"


class evFeatureRanker : public evProcessObject
{
 public:
  evFeatureRanker(void);
  virtual ~evFeatureRanker(void);

  virtual const evString GetClassName(void) const
    {
      return(evString("evFeatureRanker"));
    }
  
  virtual int Rank(const evScalarField &significance_map,
                   const evSegmentationMap &segmentation_map,
                   evSegmentationMap &ranked_map) = 0;

 protected:
  std::vector<evFeatureRankerPriorityEntry> PriorityQueue;

  void InitializeQueue(const unsigned int num_rois);
  void SortQueue(void);

 private:

};


inline evFeatureRanker::evFeatureRanker(void)
{
}


inline evFeatureRanker::~evFeatureRanker(void)
{
}


inline void evFeatureRanker::InitializeQueue(const unsigned int num_rois)
{
  this->PriorityQueue.clear();

  for (unsigned int roi = 0; roi < num_rois; roi++)
    {
      evFeatureRankerPriorityEntry entry(roi);
      this->PriorityQueue.push_back(entry);
    }
}


inline void evFeatureRanker::SortQueue(void)
{
  std::sort(this->PriorityQueue.begin(),
            this->PriorityQueue.end());
}


#endif