|| || || || || || || ||

---

MakeRandomTree.h File Reference

#include "Core/Histogram/Entropy.h"
#include "Core/Feature/RandomTree.h"
#include "Util/FilterOperations.h"
#include "Util/MakeFilter.h"
#include "Util/Random.h"

Include dependency graph for MakeRandomTree.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Namespaces
namespace	Impala
namespace	Impala::Core
namespace	Impala::Core::Feature
Typedefs
typedef Table::TableTem< Vector::ColumnVectorSet, Column::ColumnInt32 >	Impala::Core::Feature::AnnotatedFeatureTable
Functions
void	Impala::Core::Feature::Dump (AnnotatedFeatureTable *t, std::ostream &os)
Histogram::Histogram1dTem< int > *	Impala::Core::Feature::MakeHistogram (const AnnotatedFeatureTable *data, int nrClasses, bool *filter)
	makes a historgram of the values found in the second column of data (the column with the 'class id') considering the filter.
double	Impala::Core::Feature::Gain (const AnnotatedFeatureTable *data, int nrClasses, bool *left, bool *right)
	according to Jasper: The Gain is defined as in [Shotton08], taken again from Lepetit, CVPR 2005
void	Impala::Core::Feature::SplitSet (bool *&left, bool *&right, int dimension, double value, const AnnotatedFeatureTable *data, bool *filter)
	returns filters for left and right through ref to pointer (pointer is set to a new address, so if either of these point to data when this function is called it will introduce a memory leak).
void	Impala::Core::Feature::TryRandomSplit (int &dimension, double &value, double &gain, const AnnotatedFeatureTable *data, bool *filter, int nrClasses)
	Take a random split point and return it and it's gain in the first three reference parameters.
void	Impala::Core::Feature::FindSplit (int &dimension, double &value, const AnnotatedFeatureTable *data, bool *filter, int nrClasses, int nrTrials)
	Find a split by trying random splits and returning the one with the maximum gain.
int	Impala::Core::Feature::GetCodeWord ()
	returns a new id every time the function is called.
Feature::RandomTree *	Impala::Core::Feature::MakeRandomTree (const AnnotatedFeatureTable *data, bool *filter, int nrClasses, int maxDepth, int nrTrials)
	recursive funtion finds a split and calls itself for the 'left' and 'right' splits
RandomTree *	Impala::Core::Feature::MakeRandomTree (const AnnotatedFeatureTable *data, int nrClasses, int maxDepth, int nrTrials)

---