Figure 10.

Illustration of moves in the proposed iterative-improvement based optimization algorithm. The CNV assignment for a hypothetical region after t iterations is shown in the initial figure. Suppose Q_ij is selected for the (t+1)^st iteration. (a) All the markers in Q_ij are assigned to C₀, which completely eliminates Q_ij as a gain region. This is a valid move. (b) Some markers that initially have a C₀ class on the right border of Q_ij are assigned to the C₊ class which merges them with Q_ij by a valid move. (c) Some markers that initially exist in Q_ij are assigned to the C₀ class, which contracts Q_ij. This also represents a valid move. (d) An invalid move that divides the Q_ij into two sub-gain regions. (e) Another invalid move that introduces a completely new gain region that is not identified in the previous solution.