Table I.

Rules for Updating the Cost Function During Segmentation Refinement in Dependence of the Location of Node n(υ, j).

	$n(\upsilon ,j)\in {\mathrm{\Omega }}_k^{t+1}$	$n(\upsilon ,j)\notin {\mathrm{\Omega }}_k^{t+1}$
$n(\upsilon ,j)\in {\mathrm{\Omega }}_k^t$	Determine level of influence based on distance from n(υ, j) to $p_k^t$ and $p_k^{t+1}$ (i.e., the closest intersection point is utilized); replace d(pk, n(υ, j)) with $\mathit{min}\{d(p_k^{t+1},n(\upsilon ,j)),d(p_k^t,n(\upsilon ,j))\}$ in function UR (Eq. 8)	${\mathrm{\Omega }}_k^t$ is the dominant region; replace pk with $p_k^t$ in function UR (Eq. 8)
$n(\upsilon ,j)\notin {\mathrm{\Omega }}_k^t$	${\mathrm{\Omega }}_k^{t+1}$ is the dominant region; replace pk with $p_k^{t+1}$ in function UR (Eq. 8)	Determine level of influence based on distance from n(υ, j) to $p_k^t$ and $p_k^{t+1}$ (i.e., the closest intersection point is utilized); replace d(pk, n(υ, j)) with $\mathit{min}(d(p_k^{t+1},n(\upsilon ,j)),d(p_k^t,n(\upsilon ,j))$ in function UB (Eq. 9)