Research Article
Investigating the Relevance of Graph Cut Parameter on Interactive and Automatic Cell Segmentation
Algorithm 2
Cell Segmentation using Equation (
7).
(1) | Require: I grey scale image | (2) | Output: | (3) | Build graph G from I | (4) | for each node a in G | (5) | if () | (6) | for edge a–O | (7) | c = 20 | (8) | (Equation (8)) | (9) | determine a’s a–O edge weight (Figure 1) using the data term in Equation (7) | (10) | end for | (11) | for edge a–B | (12) | c = 0 | (13) | (Equation (8)) | (14) | determine a’s a–B edge weight (Figure 1) using the data term in Equation (7) | (15) | end for | (16) | else | (17) | c = 1 | (18) | (Equation (8)) | (19) | determine a’s a–O edge weight (Figure 1) using the data term in Equation (7) | (20) | determine a’s a–B edge weight (Figure 1) using the data term in Equation (7) | (21) | end if | (22) | end for | (23) | for each pixel a in G | (24) | determine a’s a–b (neighbourhood) edge weight (Figure 1) using the smoothness term in Equation (7) | (25) | end for | (26) | Use algorithm in [21] to partition G into foreground (O) and background (B) to give |
|