[ VIGRA Homepage | Function Index | Class Index | Namespaces | File List | Main Page ]

Public Member Functions
OnlineLearnVisitor Class Reference

#include <vigra/random_forest/rf_visitors.hxx>

Inheritance diagram for OnlineLearnVisitor:
VisitorBase

List of all members.

Public Member Functions

void reset_tree (int tree_id)
template<class Tree , class Split , class Region , class Feature_t , class Label_t >
void visit_after_split (Tree &tree, Split &split, Region &parent, Region &leftChild, Region &rightChild, Feature_t &features, Label_t &labels)
template<class RF , class PR , class SM , class ST >
void visit_after_tree (RF &rf, PR &pr, SM &sm, ST &st, int index)
template<class RF , class PR >
void visit_at_beginning (RF &rf, const PR &pr)
template<class TR , class IntT , class TopT , class Feat >
void visit_internal_node (TR &tr, IntT index, TopT node_t, Feat &features)

Detailed Description

Vistior to gain information, later needed for online learning.


Member Function Documentation

void visit_at_beginning ( RF &  rf,
const PR &  pr 
)

Initilize, set the number of trees

void reset_tree ( int  tree_id)

Reset a tree

void visit_after_tree ( RF &  rf,
PR &  pr,
SM &  sm,
ST &  st,
int  index 
)

simply increase the tree count

Reimplemented from VisitorBase.

void visit_after_split ( Tree &  tree,
Split &  split,
Region &  parent,
Region &  leftChild,
Region &  rightChild,
Feature_t &  features,
Label_t &  labels 
)

do something after the the Split has decided how to process the Region (Stack entry)

Parameters:
treereference to the tree that is currently being learned
splitreference to the split object
parentcurrent stack entry which was used to decide the split
leftChildleft stack entry that will be pushed
rightChildright stack entry that will be pushed.
featuresfeatures matrix
labelslabel matrix
See also:
RF_Traits::StackEntry_t

Reimplemented from VisitorBase.

void visit_internal_node ( TR &  tr,
IntT  index,
TopT  node_t,
Feat &  features 
)

do something when visiting a internal node during getToLeaf

remember as last node id, for finding the parent of the last external node also: adjust class counts and borders

Reimplemented from VisitorBase.


The documentation for this class was generated from the following file:

© Ullrich Köthe (ullrich.koethe@iwr.uni-heidelberg.de)
Heidelberg Collaboratory for Image Processing, University of Heidelberg, Germany

html generated using doxygen and Python
vigra 1.7.0 (Thu Aug 25 2011)