![]() |
Biomedical Image Analysis Library
The Biomedical Image Analysis Library is a poweful tool for developers, physicians, researchers, engineers, and so on.
|
#include <MaxPathFunction.hpp>


Public Member Functions | |
| MaxPathFunction (const C< D > &handicap, D new_bucket_size=1.0) | |
| Basic constructor. More... | |
| MaxPathFunction (const MaxPathFunction< C, D > &pf) | |
| Copy constructor. More... | |
| ~MaxPathFunction () | |
| Destructor. More... | |
| MaxPathFunction< C, D > | operator= (const MaxPathFunction< C, D > &pf) |
| Assignment operator. 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... | |
Public Member Functions inherited from Bial::PathFunction< C, D > | |
| 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... | |
Protected Attributes | |
| C< D > | handicap |
| Handicap container (Vector, Matrix, Image, etc). More... | |
| D | bucket_size |
| Minimum difference between two sample intensities. More... | |
Protected Attributes inherited from Bial::PathFunction< C, D > | |
| 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 |
Additional Inherited Members | |
Public Types inherited from Bial::PathFunction< C, D > | |
| 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... | |
Definition at line 22 of file MaxPathFunction.hpp.
| Bial::MaxPathFunction< C, D >::MaxPathFunction | ( | const C< D > & | handicap, |
| D | new_bucket_size = 1.0 |
||
| ) |
Basic constructor.
| new_bucket_size | size of bucke in queue. |
| Bial::MaxPathFunction< C, D >::MaxPathFunction | ( | const MaxPathFunction< C, D > & | pf | ) |
Copy constructor.
| pf | path-function to be copied. |
| Bial::MaxPathFunction< C, D >::~MaxPathFunction | ( | ) |
Destructor.
| none. |
|
virtual |
Checks if index can offer better value to adj_index, prior to computing it by Propagate function. This function makes IFT faster.
| source | Source pixel index. |
| target | Adjacent pixel index. |
Implements Bial::PathFunction< C, D >.
|
virtual |
Returns whether this path function uses increasing or decreasing values.
| none. |
Implements Bial::PathFunction< C, D >.
|
virtual |
Initializes object attributes.
| init_value | Reference for initial value container. |
| init_label | Reference for initial label container. |
| init_predecessor | Reference for predecessor container. |
| sequential_label | Sets labeling sequentially. |
Reimplemented from Bial::PathFunction< C, D >.
| MaxPathFunction< C, D > Bial::MaxPathFunction< C, D >::operator= | ( | const MaxPathFunction< C, D > & | pf | ) |
Assignment operator.
| pf | path-function to be assigned. |
|
virtual |
Updates adjacent pixel values and returns true if path_function is propagated.
| source | Source pixel index. |
| target | Adjacent pixel index. |
Implements Bial::PathFunction< C, D >.
|
virtual |
Sets initial value for root pixel of index 'index'. Also sets its label value.
| index | The index of the pixel to be initalized. |
Implements Bial::PathFunction< C, D >.
|
virtual |
Sets initial value for root pixel of index 'index'.
| index | The index of the pixel to be initalized. |
Implements Bial::PathFunction< C, D >.
|
protected |
Minimum difference between two sample intensities.
Definition at line 29 of file MaxPathFunction.hpp.
|
protected |
Handicap container (Vector, Matrix, Image, etc).
Definition at line 27 of file MaxPathFunction.hpp.