2 * folded-ctf is an implementation of the folded hierarchy of
3 * classifiers for object detection, developed by Francois Fleuret
6 * Copyright (c) 2008 Idiap Research Institute, http://www.idiap.ch/
7 * Written by Francois Fleuret <francois.fleuret@idiap.ch>
9 * This file is part of folded-ctf.
11 * folded-ctf is free software: you can redistribute it and/or modify
12 * it under the terms of the GNU General Public License as published
13 * by the Free Software Foundation, either version 3 of the License,
14 * or (at your option) any later version.
16 * folded-ctf is distributed in the hope that it will be useful, but
17 * WITHOUT ANY WARRANTY; without even the implied warranty of
18 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
19 * General Public License for more details.
21 * You should have received a copy of the GNU General Public License
22 * along with folded-ctf. If not, see <http://www.gnu.org/licenses/>.
28 A SampleSet stands for a set of samples from R^d with their
29 labels. It abstracts the notion features and is what the machine
30 learning techniques of this software see.
37 #include "pose_cell.h"
38 #include "pi_feature_family.h"
39 #include "shared_responses.h"
44 SharedResponses *_shared_feature_values;
45 scalar_t **_feature_values;
50 inline int nb_samples() { return _nb_samples; }
51 inline int nb_features() { return _nb_features; }
53 inline int label(int n_sample) {
54 ASSERT(n_sample >= 0 && n_sample < _nb_samples);
55 return _labels[n_sample];
58 inline scalar_t feature_value(int n_sample, int n_feature) {
59 ASSERT(n_sample >= 0 && n_sample < _nb_samples &&
60 n_feature >= 0 && n_feature < _nb_features);
61 ASSERT(!isnan(_feature_values[n_sample][n_feature]));
62 return _feature_values[n_sample][n_feature];
65 SampleSet(int nb_features, int nb_samples);
66 SampleSet(SampleSet *father, int nb, int *indexes);
70 void set_sample(int n,
71 PiFeatureFamily *pi_feature_family,