oln::morpho::internal Namespace Reference

Internal purpose only. More...

Classes
struct	fast_morpho_inner
struct	fast_morpho_inner< Dim, Dim, I, S, H, B, P, O >
struct	stat_
	Min and Max on a structuring element. More...
struct	stat_< I, E, ntg::bin >
struct	watershed_seg_point_handler_
struct	watershed_con_point_handler_
Functions
template<class E1, class E2, class E3> void	find_struct_elts (const abstract::struct_elt< E1 > &se, E2 se_add[mlc::exact< E1 >::ret::dim], E3 se_rem[mlc::exact< E1 >::ret::dim])
	Find structuring elements.
template<class I, class E1, class E2, class H> void	hist_update (utils::abstract::histogram< H > &hist, const abstract::non_vectorial_image< I > &input, const typename mlc::exact< I >::ret::point_type &p, const abstract::struct_elt< E1 > &se_rem, const abstract::struct_elt< E2 > &se_add)
	Update an histogram.
template<class Point, class T> bool	watershed_seg_sort_ (const std::pair< Point, T > &p1, const std::pair< Point, T > &p2)
	Check if the second element of p1 is lower than the second one of p2.
template<class PointHandler, class DestValue, class I, class N> mute< I, DestValue >::ret	soille_watershed_ (const abstract::non_vectorial_image< I > &im_i, const abstract::neighborhood< N > &Ng)
	Algorithm by Vincent and Soille.

---

Detailed Description

Internal purpose only.

---

Function Documentation

template<class E1, class E2, class E3> void find_struct_elts (  const abstract::struct_elt< E1 > &  se, E2  se_add[mlc::exact< E1 >::ret::dim], E3  se_rem[mlc::exact< E1 >::ret::dim] )

Find structuring elements. Find structuring elements to be added/removed from the histogram when we move forward along each direction. Todo: FIXME: add(dp) on w_windows associates a default weight set to 1 Definition at line 58 of file fast_morpho.hxx. { mlc_is_a(E2, abstract::struct_elt)::ensure(); mlc_is_a(E3, abstract::struct_elt)::ensure(); const unsigned dim = E1::dim; // back[n] allows to move backward on coordinate `n'. oln_dpoint_type(E1) back[dim]; for (unsigned n = 0; n < dim; ++n) back[n].nth(n) = -1; oln_iter_type(E1) dp(se); oln_iter_type(E1) dp_prime(se); for_all(dp) { bool add[dim]; // whether to add `dp' when moving forward // on coordinate `n'. bool rem[dim]; // whether to remove `dp'. for (unsigned n = 0; n < dim; ++n) add[n] = rem[n] = true; for_all(dp_prime) for (unsigned n = 0; n < dim; ++n) { if (dp_prime.cur() + back[n] == dp) // DP_PRIME is already in SE: don't add it. add[n] = false; if (dp.cur() + back[n] == dp_prime) // DP is still in SE: don't remove it. rem[n] = false; } for (unsigned n = 0; n < dim; ++n) { if (add[n]) { se_add[n].add(dp); } if (rem[n]) { se_rem[n].add(dp.cur() + back[n]); } } } for (unsigned n = 0; n < dim; ++n) postcondition(se_add[n].card() == se_rem[n].card()); }

template<class I, class E1, class E2, class H> void hist_update (  utils::abstract::histogram< H > &  hist, const abstract::non_vectorial_image< I > &  input, const typename mlc::exact< I >::ret::point_type &  p, const abstract::struct_elt< E1 > &  se_rem, const abstract::struct_elt< E2 > &  se_add )

Update an histogram. Update HIST by adding elements from _SE_ADD, and removing those from _SE_REM. Definition at line 120 of file fast_morpho.hxx. Referenced by oln::morpho::internal::fast_morpho_inner< NP1, Dim, I, S, H, B, P, O >::doit(). { { oln_iter_type(E1) dp(se_rem); for_all(dp) --hist[input[p + dp]]; } { oln_iter_type(E2) dp(se_add); for_all(dp) ++hist[input[p + dp]]; } }

---