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 Qij is selected for the (t+1)st iteration. (a) All the markers in Qij are assigned to C0, which completely eliminates Qij as a gain region. This is a valid move. (b) Some markers that initially have a C0 class on the right border of Qij are assigned to the C+ class which merges them with Qij by a valid move. (c) Some markers that initially exist in Qij are assigned to the C0 class, which contracts Qij. This also represents a valid move. (d) An invalid move that divides the Qij into two sub-gain regions. (e) Another invalid move that introduces a completely new gain region that is not identified in the previous solution.