X-Git-Url: https://fleuret.org/cgi-bin/gitweb/gitweb.cgi?p=folded-ctf.git;a=blobdiff_plain;f=pose_cell_hierarchy.h;h=3165eb223b139571750a28d578e1a3e4ff5bd249;hp=ffd2146ca4a2d8efc0f4f1992389eae866f5ab91;hb=HEAD;hpb=f7e3efe41ffb65d89e8f2ce814c23ff90ad24f34

diff --git a/pose_cell_hierarchy.h b/pose_cell_hierarchy.h
index ffd2146..3165eb2 100644
--- a/pose_cell_hierarchy.h
+++ b/pose_cell_hierarchy.h
@@ -1,20 +1,35 @@
-
-///////////////////////////////////////////////////////////////////////////
-// This program is free software: you can redistribute it and/or modify  //
-// it under the terms of the version 3 of the GNU General Public License //
-// as published by the Free Software Foundation.                         //
-//                                                                       //
-// This program 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      //
-// General Public License for more details.                              //
-//                                                                       //
-// You should have received a copy of the GNU General Public License     //
-// along with this program. If not, see <http://www.gnu.org/licenses/>.  //
-//                                                                       //
-// Written by Francois Fleuret, (C) IDIAP                                //
-// Contact <francois.fleuret@idiap.ch> for comments & bug reports        //
-///////////////////////////////////////////////////////////////////////////
+/*
+ *  folded-ctf is an implementation of the folded hierarchy of
+ *  classifiers for object detection, developed by Francois Fleuret
+ *  and Donald Geman.
+ *
+ *  Copyright (c) 2008 Idiap Research Institute, http://www.idiap.ch/
+ *  Written by Francois Fleuret <francois.fleuret@idiap.ch>
+ *
+ *  This file is part of folded-ctf.
+ *
+ *  folded-ctf is free software: you can redistribute it and/or modify
+ *  it under the terms of the GNU General Public License version 3 as
+ *  published by the Free Software Foundation.
+ *
+ *  folded-ctf 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
+ *  General Public License for more details.
+ *
+ *  You should have received a copy of the GNU General Public License
+ *  along with folded-ctf.  If not, see <http://www.gnu.org/licenses/>.
+ *
+ */
+
+/*
+
+  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
@@ -22,14 +37,14 @@
 #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 +53,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();