Algorithm Delineation of objects through FC.

Input: Image I, threshold θ < 1, affinity κ defined on the image space $\mathcal{V}\to \{0,1\}$, a set of seeds S indicating the object of interest (it comes from cavity detection algorithm).

Output: Delineated object CS, θ.

Auxiliary Data Structures: A characteristic function $g:\mathcal{V}\to \{0,1\}$ of CS, θ and a queue Q of voxels.

1: Begin

2:  Set g(s) = 1 for all s ∈ S and g(c) = 0 for all $c\in \mathcal{V}\setminus S$

3:  Push to Q all voxels $c\in \mathcal{V}$ for which κ(c, s) > θ for some s ∈ S;

4:  WhileQ is not empty Do

5:   Remove a voxel c from Q;

6:   Ifg(c) = 0 Then

7:    Set g(c) = 1;

8:    Push to Q all voxels $d\in \mathcal{V}$ for which κ(d, c) > θ;

9:   EndIf;

10:  EndWhile;

11:  Create PS, θ as a set of all voxels c with g(c) = 1;

12: End