Algorithm.
1. SMAF(X, d, λ, k) |
2. Initialize U ∈ ℝg × d and W ∈ ℝd × n randomly. |
3. For 10 iterations: |
a. Update the module dictionary as U = Lasso Nonnegative (X, W,λ). |
b. Normalize each module so that ||ui||2=1. |
c. Update the activity levels as W = OMP (X, U, k). |
4. Return U, W. |