parsing.h

   1
   2 ///////////////////////////////////////////////////////////////////////////
   3 // This program is free software: you can redistribute it and/or modify  //
   4 // it under the terms of the version 3 of the GNU General Public License //
   5 // as published by the Free Software Foundation.                         //
   6 //                                                                       //
   7 // This program is distributed in the hope that it will be useful, but   //
   8 // WITHOUT ANY WARRANTY; without even the implied warranty of            //
   9 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU      //
  10 // General Public License for more details.                              //
  11 //                                                                       //
  12 // You should have received a copy of the GNU General Public License     //
  13 // along with this program. If not, see <http://www.gnu.org/licenses/>.  //
  14 //                                                                       //
  15 // Written by Francois Fleuret, (C) IDIAP                                //
  16 // Contact <francois.fleuret@idiap.ch> for comments & bug reports        //
  17 ///////////////////////////////////////////////////////////////////////////
  18
  19 #ifndef PARSING_H
  20 #define PARSING_H
  21
  22 /*
  23
  24   A Parsing is associated to a LabelledImage and stores responses over
  25   cells.
  26
  27 */
  28
  29 #include "fusion_sort.h"
  30 #include "pose_cell_hierarchy.h"
  31 #include "classifier.h"
  32 #include "labelled_image.h"
  33
  34 class Parsing {
  35   LabelledImagePool *_image_pool;
  36   int _image_index;
  37   int _nb_cells, _nb_positives, _nb_negatives;
  38
  39   PoseCell *_cells;
  40   scalar_t *_responses;
  41   int *_labels;
  42
  43 public:
  44
  45   Parsing(LabelledImagePool *image_pool,
  46           PoseCellHierarchy *hierarchy,
  47           scalar_t proportion_negative_cells,
  48           int image_index);
  49
  50   ~Parsing();
  51
  52   //////////////////////////////////////////////////////////////////////
  53
  54   inline int nb_cells() {
  55     return _nb_cells;
  56   }
  57
  58   inline int nb_positive_cells() {
  59     return _nb_positives;
  60   }
  61
  62   inline int nb_negative_cells() {
  63     return _nb_negatives;
  64   }
  65
  66   inline scalar_t response(int c) {
  67     ASSERT(c >= 0 && c < _nb_cells);
  68     return _responses[c];
  69   }
  70
  71   inline int label(int c) {
  72     ASSERT(c >= 0 && c < _nb_cells);
  73     return _labels[c];
  74   }
  75
  76   void down_one_level(PoseCellHierarchy *hierarchy, int level, int *sample_nb_occurences, scalar_t *sample_responses);
  77
  78   void update_cell_responses(PiFeatureFamily *pi_feature_family,
  79                              Classifier *classifier);
  80
  81   void collect_samples(SampleSet *samples,
  82                        PiFeatureFamily *pi_feature_family,
  83                        int s,
  84                        int *to_collect);
  85 };
  86
  87 #endif