Figure 5
Algorithm 
.(a) Image as a digraph. (b) Initialization of IFT with background seed S
b
for computing the connectivity value V
b
(s
i
) using the connectivity function \(f^{S_{b}}_{\text {min}}\). (c) Result of Step 1: The value V
b
(s
i
)=1 is computed by the IFT. (d) Step 2: The graph G
≤. (e,f) Step 3: The transpose graph of G
≤ and finally, the object’s pixels from the DCC.