Algorithm 1.
Registration scheme
1: | Get the number of rejection steps nR from user |
2: | Get the fraction of total blocks rejected fR from user |
3: | for i = 0 to nR do |
4: | Fi ⇐ KUi |
5: | Ui+1 ⇐ [K + HT SH]−1 [HT SD + Fi] |
6: | for all Blocks k do |
7: | Compute error function ξk |
8: | end for |
9: | Reject blocks with highest error function ξ |
10: | Recompute S, H, D |
11: | end for |
12: | repeat |
13: | Fi ⇐ KUi |
14: | Ui+1 ⇐ [K + HTSH]−1 [HT SD + Fi] |
15: | until Convergence |