Fawkes API
Fawkes Development Version
|
Hough transform tree node. More...
#include "hough_transform.h"
Public Member Functions | |
Node (HoughTransform *ht, unsigned int dims, int value=0) | |
Constructor. | |
~Node () | |
Destructor. | |
unsigned int | insert (int *values) |
Insert new values. | |
unsigned int | num_nodes () |
Get number of nodes. | |
unsigned int | depth () |
Depth of the tree. | |
unsigned int | filter (int **values, unsigned int min_count) |
Filter values by number of votes. | |
Friends | |
class | HoughTransform |
Hough transform tree node.
The nodes are used to form a tree. The tree is organized as stacked binary trees. At a certain stack level, a value of a specific dimension is stored, with the left and right sub-trees pointing to smaller or higher values respectively. Nodes with a stack level of 1 (e.g. the bottom-most level) have a field to count the number of votes (these are the bucket nodes). Nodes on higher levels have a pointer to another node on a stack level one lower than the own, which represents the next dimension of the values.
HoughTransform::Node::Node | ( | HoughTransform * | ht, |
unsigned int | dims, | ||
int | value = 0 |
||
) |
Constructor.
ht | hough transform the node belongs to |
dims | number of remaining dimensions (including the own) |
value | the initial value of the node |
Definition at line 175 of file hough_transform.cpp.
HoughTransform::Node::~Node | ( | ) |
Destructor.
Definition at line 213 of file hough_transform.cpp.
unsigned int HoughTransform::Node::depth | ( | ) |
Depth of the tree.
Definition at line 269 of file hough_transform.cpp.
References HoughTransform::max().
unsigned int HoughTransform::Node::filter | ( | int ** | values, |
unsigned int | min_count | ||
) |
Filter values by number of votes.
This method filters all created buckets and returns only the ones which have at least min_count
votes
values | upon return points to a newly allocated array of values with the size of number of values * number of dimensions. The memory must be freed when done by using free(). |
min_count | minimum number of votes required to consider a bucket |
Definition at line 306 of file hough_transform.cpp.
References HoughTransform::filter().
Referenced by HoughTransform::filter().
unsigned int HoughTransform::Node::insert | ( | int * | values | ) |
Insert new values.
values | array with new values, must be of the size of the number of dimensions |
Definition at line 225 of file hough_transform.cpp.
Referenced by HoughTransform::process().
unsigned int HoughTransform::Node::num_nodes | ( | ) |