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                                           //
  16 // (C) Idiap Research Institute                                          //
  17 //                                                                       //
  18 // Contact <francois.fleuret@idiap.ch> for comments & bug reports        //
  19 ///////////////////////////////////////////////////////////////////////////
  20
  21 /*
  22
  23   A Parsing is associated to a LabelledImage and stores responses over
  24   cells. We use it during training to remember the responses over all
  25   the negative samples.
  26
  27 */
  28
  29 #ifndef PARSING_H
  30 #define PARSING_H
  31
  32 #include "fusion_sort.h"
  33 #include "pose_cell_hierarchy.h"
  34 #include "classifier.h"
  35 #include "labelled_image.h"
  36
  37 class Parsing {
  38   LabelledImagePool *_image_pool;
  39   int _image_index;
  40   int _nb_cells, _nb_positives, _nb_negatives;
  41
  42   PoseCell *_cells;
  43   scalar_t *_responses;
  44   int *_labels;
  45
  46 public:
  47
  48   Parsing(LabelledImagePool *image_pool,
  49           PoseCellHierarchy *hierarchy,
  50           scalar_t proportion_negative_cells,
  51           int image_index);
  52
  53   ~Parsing();
  54
  55   //////////////////////////////////////////////////////////////////////
  56
  57   inline int nb_cells() {
  58     return _nb_cells;
  59   }
  60
  61   inline int nb_positive_cells() {
  62     return _nb_positives;
  63   }
  64
  65   inline int nb_negative_cells() {
  66     return _nb_negatives;
  67   }
  68
  69   inline scalar_t response(int c) {
  70     ASSERT(c >= 0 && c < _nb_cells);
  71     return _responses[c];
  72   }
  73
  74   inline int label(int c) {
  75     ASSERT(c >= 0 && c < _nb_cells);
  76     return _labels[c];
  77   }
  78
  79   void down_one_level(PoseCellHierarchy *hierarchy, int level, int *sample_nb_occurences, scalar_t *sample_responses);
  80
  81   void update_cell_responses(PiFeatureFamily *pi_feature_family,
  82                              Classifier *classifier);
  83
  84   void collect_samples(SampleSet *samples,
  85                        PiFeatureFamily *pi_feature_family,
  86                        int s,
  87                        int *to_collect);
  88 };
  89
  90 #endif