SMIL  1.0.4
Watershed Algorithms

Watershed algorithms. More...

Detailed Description

Watershed algorithms.

Warning
some annoted functions are tests functions, no guarentee on the results !!!
Author
Jean Stawiaski
+ Collaboration diagram for Watershed Algorithms:

Functions

template<class T1 , class T2 >
RES_T geoCutsWatershed_MinCut (const Image< T1 > &imIn, const Image< T2 > &imMarker, const double Power, const StrElt &nl, Image< T2 > &imOut)
 Watershed as a Minimum Cut (2 labels) More...
 
template<class T1 , class T2 >
RES_T geoCutsMultiway_Watershed (const Image< T1 > &imIn, const Image< T2 > &imMarker, const double Power, const StrElt &nl, Image< T2 > &imOut)
 Watershed as a mutli_terminal cut (multi label) More...
 

Function Documentation

◆ geoCutsWatershed_MinCut()

RES_T geoCutsWatershed_MinCut ( const Image< T1 > &  imIn,
const Image< T2 > &  imMarker,
const double  Power,
const StrElt nl,
Image< T2 > &  imOut 
)

Watershed as a Minimum Cut (2 labels)

Note
See Jean Stawiaski Thesis to understand Power parameter effect
Parameters
[in]imInImage<T> in
[in]imMarkerImage<T> marker
[in]Power
[in]nlNeighborlist
[out]imOutImage<T> out

◆ geoCutsMultiway_Watershed()

RES_T geoCutsMultiway_Watershed ( const Image< T1 > &  imIn,
const Image< T2 > &  imMarker,
const double  Power,
const StrElt nl,
Image< T2 > &  imOut 
)

Watershed as a mutli_terminal cut (multi label)

Note
See Jean Stawiaski Thesis to understand Power parameter effect
Parameters
[in]imInImage<T> in
[in]imMarkerImage<T> marker
[in]Power
[in]nlNeighborlist
[out]imOutImage<T> out