Algorithm 2.
Deformable Kalman multiatlas segmentation.
| 1: | for i = 0, 2,,… N − 1 do | |
| 2: | Compute the affine registration using Algorithm 1 | |
| 3: | Register Ii ◦ Ai to I by minimizing NNC with respect to B-spline deformation field | |
| 4: | Record the final deformation field ψi and registration cost ci | |
| 5: | end for | |
| 6: | Sort ci’s so that cki ≤ cki+1 ∀i = 0, …, N − 2 | |
| 7: | Define wki = exp(ck0 − cki)∀i = 0, …, N − 1 and normalize wi’s s.t. | |
| 8: |