Skip to main content
. 2015 Feb 2;15(2):3172–3203. doi: 10.3390/s150203172

Algorithm 4: Region merging algorithm.

δseg ← Modeling(boundary(Ri,Rj));
ϱ̅Ri,Rj ← abs(Mean(Ri)-Mean(Rj));
ξRi,Rj ← Contrast(boundary(Ri,Rj));
if δseg5 OR (ξRi,Rjϱ̅Ri,Rj AND 3δseg4) then
 the region with a minimum label absorbs the region with the maximum label, i.e.
 label =min(label(Ri), label(Rj))
if label==label(Ri) then
  ∀ p ∈ Rj
  p=label
else
  ∀ p ∈ Ri
  p=label