X-Git-Url: https://www.fleuret.org/cgi-bin/gitweb/gitweb.cgi?a=blobdiff_plain;f=pose_cell_hierarchy.h;h=c04e3b0fcd48a1432f873a5ce382d12d0eafbdc8;hb=aed34255065b18c445d096f51bd2091833810a81;hp=ffd2146ca4a2d8efc0f4f1992389eae866f5ab91;hpb=f7e3efe41ffb65d89e8f2ce814c23ff90ad24f34;p=folded-ctf.git diff --git a/pose_cell_hierarchy.h b/pose_cell_hierarchy.h index ffd2146..c04e3b0 100644 --- a/pose_cell_hierarchy.h +++ b/pose_cell_hierarchy.h @@ -12,24 +12,35 @@ // You should have received a copy of the GNU General Public License // // along with this program. If not, see . // // // -// Written by Francois Fleuret, (C) IDIAP // +// Written by Francois Fleuret // +// (C) Idiap Research Institute // +// // // Contact for comments & bug reports // /////////////////////////////////////////////////////////////////////////// +/* + + A PoseCellHierarchy provides the necessary methods to visit a + recursive partitioning of the pose space. The two main methods can + give you an root partitioning, or compute a finer partitioning from + an existing one. + + */ + #ifndef POSE_CELL_HIERARCHY_H #define POSE_CELL_HIERARCHY_H #include "pose_cell_set.h" #include "labelled_image_pool.h" -struct RelativeBodyPoseCell { - Interval _body_xc, _body_yc; +struct RelativeBellyPoseCell { + Interval _belly_xc, _belly_yc; }; class PoseCellHierarchy { static const scalar_t pseudo_infty = 10000; - static const scalar_t body_resolution = 0.5; + static const scalar_t belly_resolution = 0.5; static const int nb_radius_1 = 16; static const int nb_radius_2 = 16; @@ -38,11 +49,11 @@ class PoseCellHierarchy { int _nb_levels; scalar_t _min_head_radius; scalar_t _max_head_radius; - int _root_cell_nb_xy_per_scale; + int _root_cell_nb_xy_per_radius; - int _nb_body_cells; + int _nb_belly_cells; - RelativeBodyPoseCell *_body_cells; + RelativeBellyPoseCell *_belly_cells; public: PoseCellHierarchy();