|
| FeatureDistanceFunction (const Feature< D > &new_feats) |
| Basic constructor. More...
|
|
void | Initialize (C< D > &init_value, C< int > *init_label, C< int > *init_predecessor, bool sequential_label) |
| Initializes object attributes. More...
|
|
bool | RemoveSimple (size_t index, BucketState state) |
| Sets initial value for root pixel of index 'index'. More...
|
|
bool | RemoveLabel (size_t index, BucketState state) |
| Sets initial value for root pixel of index 'index'. Also sets its label value. More...
|
|
bool | Capable (int index, int adj_index, BucketState adj_state) |
| Checks if index can offer better value to adj_index, prior to computing it by Propagate function. This function makes IFT faster. More...
|
|
bool | Propagate (int index, int adj_index) |
| Updates adjacent pixel values and returns true if path_function is propagated. More...
|
|
bool | Increasing () |
| Returns whether this path function uses increasing or decreasing values. More...
|
|
| PathFunction () |
| Basic constructor. More...
|
|
| PathFunction (const PathFunction< C, D > &pf) |
| Copy constructor. More...
|
|
virtual | ~PathFunction () |
| Virtual destructor required for virtual classes. More...
|
|
void | UpdateCompleteData (size_t index, size_t adj_index) |
| Updates value, label, and predecessor images of index adj_index according to 'index' and value. One of these functions will be used depending on the chosen resultant images. More...
|
|
void | UpdatePredecessorData (size_t index, size_t adj_index) |
|
void | UpdateLabelData (size_t index, size_t adj_index) |
|
void | UpdateSimpleData (size_t index, size_t adj_index) |
|
PathFunction< C, D >::RemoveFn | RemoveFunction () |
| Returns a root initialization function that will be used depending on used maps. More...
|
|
PathFunction< C, D >::UpdateFn | UpdateFunction () |
| Returns an update function that will be used depending on used maps. More...
|
|
|
typedef bool(PathFunction< C, D >::* | RemoveFn) (size_t index, BucketState state) |
| Initialization functions of IFT. It will operate on valid maps among value, label, predecessor, and. More...
|
|
typedef void(PathFunction< C, D >::* | UpdateFn) (size_t index, size_t adj_index) |
| Update functions of IFT. It will operate on valid maps among value, label, and predecessor. More...
|
|
C< D > * | value |
| Pointer to value container (Vector, Matrix, Image, etc). More...
|
|
C< int > * | label |
| Pointer to label container (Vector, Matrix, Image, etc). More...
|
|
C< int > * | predecessor |
| Pointer to predecessor container (Vector, Matrix, Image, etc). More...
|
|
int | next_label |
|
template<template< class D > class C, class D>
class Bial::FeatureDistanceFunction< C, D >
Definition at line 25 of file FeaturePathFunction.hpp.