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 This class is an implementation of the Classifier with a boosting of
29 trees. It works with samples from R^n and has no concept of the
34 #ifndef BOOSTED_CLASSIFIER_H
35 #define BOOSTED_CLASSIFIER_H
37 #include "classifier.h"
38 #include "sample_set.h"
39 #include "decision_tree.h"
40 #include "loss_machine.h"
42 class BoostedClassifier : public Classifier {
45 int _nb_weak_learners;
46 DecisionTree **_weak_learners;
50 BoostedClassifier(int nb_weak_learners);
52 virtual ~BoostedClassifier();
54 virtual scalar_t response(SampleSet *sample_set, int n_sample);
55 virtual void train(LossMachine *loss_machine, SampleSet *train, scalar_t *response);
57 virtual void tag_used_features(bool *used);
58 virtual void re_index_features(int *new_indexes);
60 virtual void read(istream *is);
61 virtual void write(ostream *os);