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. //
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. //
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/>. //
15 // Written by Francois Fleuret //
16 // (C) Idiap Research Institute //
18 // Contact <francois.fleuret@idiap.ch> for comments & bug reports //
19 ///////////////////////////////////////////////////////////////////////////
23 A PoseCellHierarchy provides the necessary methods to visit a
24 recursive partitioning of the pose space. The two main methods can
25 give you an root partitioning, or compute a finer partitioning from
30 #ifndef POSE_CELL_HIERARCHY_H
31 #define POSE_CELL_HIERARCHY_H
33 #include "pose_cell_set.h"
34 #include "labelled_image_pool.h"
36 struct RelativeBellyPoseCell {
37 Interval _belly_xc, _belly_yc;
40 class PoseCellHierarchy {
41 static const scalar_t pseudo_infty = 10000;
43 static const scalar_t belly_resolution = 0.5;
45 static const int nb_radius_1 = 16;
46 static const int nb_radius_2 = 16;
47 static const int nb_tilts = 64;
50 scalar_t _min_head_radius;
51 scalar_t _max_head_radius;
52 int _root_cell_nb_xy_per_radius;
56 RelativeBellyPoseCell *_belly_cells;
60 PoseCellHierarchy(LabelledImagePool *train_pool);
61 virtual ~PoseCellHierarchy();
63 virtual int nb_levels();
64 virtual void get_containing_cell(Image *image, int level,
65 Pose *pose, PoseCell *result_cell);
67 virtual void add_root_cells(Image *image, PoseCellSet *cell_set);
68 // level is the level to build, hence should be greater than 1
69 virtual void add_subcells(int level, PoseCell *root, PoseCellSet *cell_set);
71 virtual int nb_incompatible_poses(LabelledImagePool *pool);
73 virtual void write(ostream *os);
74 virtual void read(istream *is);