SMIL
1.0.4
|
This algorithm needs an INT32 input and an INT32 output. More...
This algorithm needs an INT32 input and an INT32 output.
It can be an inplace transform However, we are working with UINT8 and UINT8 input and output buffer. Hence, we have already converted the input image in INT32. (not const) First, the result of the area op will be store in imIn. Then we convert it into imOut
The following functions were deactivated in the Swig interface - why ? :
Functions | |
template<class T1 , class T2 > | |
RES_T | ImAreaClosing_PixelQueue (const Image< T1 > &imIn, int size, Image< T2 > &imOut) |
Area closing with pixel queue algorithm (V4) More... | |
template<class T1 , class T2 > | |
RES_T | ImAreaOpening_PixelQueue (const Image< T1 > &imIn, int size, Image< T2 > &imOut) |
Area Opening with pixel queue algorithm (V4) More... | |
template<class T1 , class T2 > | |
RES_T | ImAreaOpening_MaxTree (const Image< T1 > &imIn, int size, Image< T2 > &imOut) |
Area opening with a max tree algorithm (V4) More... | |
template<class T1 , class T2 > | |
RES_T | ImAreaClosing_MaxTree (const Image< T1 > &imIn, int size, Image< T2 > &imOut) |
Area closing with a max tree algorithm (V4) More... | |
template<class T1 , class T2 > | |
RES_T | ImAreaOpening_UnionFind (const Image< T1 > &imIn, int size, Image< T2 > &imOut) |
Area opening with an union find algorithm (V4) More... | |
template<class T1 , class T2 > | |
RES_T | ImAreaClosing_UnionFind (const Image< T1 > &imIn, int size, Image< T2 > &imOut) |
Area closing with an union find algorithm (V4) More... | |
template<class T1 , class T2 > | |
RES_T | ImAreaOpening_Line (const Image< T1 > &imIn, int size, Image< T2 > &imOut) |
Non exact implementation of the Area opening with an 1D line (V4) More... | |
template<class T1 , class T2 > | |
RES_T | ImAreaClosing_Line (const Image< T1 > &imIn, int size, Image< T2 > &imOut) |
Non exact implementation of the Area closing with an 1D line (V4) More... | |
template<class T1 , class T2 > | |
RES_T | ImAreaOpening_LineSupEqu (const Image< T1 > &imIn, int size, Image< T2 > &imOut) |
Non exact implementation of the Area opening with an 1D line (V4) More... | |
template<class T1 , class T2 > | |
RES_T | ImInertiaThinning_MaxTree (const Image< T1 > &imIn, double size, Image< T2 > &imOut) |
Inertia thinning with a max tree algorithm (V4) More... | |
template<class T1 , class T2 > | |
RES_T | ImInertiaThickening_MaxTree (const Image< T1 > &imIn, double size, Image< T2 > &imOut) |
Inertia thickening with a max tree algorithm (V4) More... | |
Area closing with pixel queue algorithm (V4)
[in] | imIn | : the initial image |
[in] | size | : |
[out] | imOut | : Area Closing of imIn |
Area Opening with pixel queue algorithm (V4)
[in] | imIn | : the initial image |
[in] | size | : |
[out] | imOut | : Area Opening of imIn |
Area opening with a max tree algorithm (V4)
[in] | imIn | : the initial image |
[in] | size | : |
[out] | imOut | : Area Opening of imIn |
Area closing with a max tree algorithm (V4)
[in] | imIn | : the initial image |
[in] | size | : |
[out] | imOut | : Area Closing of imIn |
Area opening with an union find algorithm (V4)
[in] | imIn | : the initial image |
[in] | size | : |
[out] | imOut | : Area opening of imIn |
Area closing with an union find algorithm (V4)
[in] | imIn | : the initial image |
[in] | size | : |
[out] | imOut | : Area Closing of imIn |
Non exact implementation of the Area opening with an 1D line (V4)
[in] | imIn | : the initial image |
[in] | size | : |
[out] | imOut | : Area Opening of imIn |
Non exact implementation of the Area closing with an 1D line (V4)
[in] | imIn | : the initial image |
[in] | size | : |
[out] | imOut | : Area Closing of imIn |
Non exact implementation of the Area opening with an 1D line (V4)
[in] | imIn | : the initial image |
[in] | size | : |
[out] | imOut | : Area Opening of imIn |
Inertia thinning with a max tree algorithm (V4)
[in] | imIn | : the initial image |
[in] | size | : |
[out] | imOut | : inertia thinning of imIn |