Algorithm 1.

Pseudocode of the MCM-RR algorithm.

1: Compute the shape bases B via the elastic net based sparse model (5).

2: Initialize α, β, γ.

3: Initialize M0, Z0, Y0, μ0, t = 0.

4: while t < = 1000 do

5:    Compute the optimized Mt+1 according to (15) by fixing Zt, Yt, and μt,

6:    Update Zt+1 via (17) by fixing Mt+1, Yt, and μt,

7:    Update Yt+1 via (18) by fixing Mt+1, Zt+1,

8:    if δ1 < ε & δ2 < ε then

9:      break,

10:    else

11:      if δ1 > 10δ2 then

12:        μt+1 = 2μt,

13:      else {δ2 > 10δ1}

14:        μt+1 = μt/2.

15:      end if

16:    end if

17:    Update t ← t + 1.

18: end while

19: if refinement reconstruction then

20:    Compute R and c according to (22) via the alternating minimization (Zhou et al., 2013).

21: end if

22: Estimate S by using (1)