Algorithm 2: MF evaluation of ${\mathbf{M}}^{\mathbf{T}}\underset{¯}{u}$

$$\begin{array}{cc}\hfill & \mathbf{procedure}\text{Computing}\underset{¯}{\omega }={\mathit{M}}^{\mathit{T}}\underset{¯}{u};\hfill \\ \hfill & \underset{¯}{\omega }=zeros(Nodes,1)](\text{initialize})\hfill \\ \hfill & \mathbf{U}=\text{reshape}(\underset{¯}{u},N_d\times N_t)\hfill \\ \hfill & \mathbf{for}m=1to{N}_d\mathbf{do}\hfill \\ \hfill & {\underset{¯}{u}}_d\leftarrow [\mathbf{U}(m,:){]}^T\hfill \\ \hfill & \mathbf{for}q=1to{N}_t\mathbf{do}\hfill \\ \hfill & \overrightarrow{\alpha }{}_i\leftarrow \overrightarrow{r}+\text{vq}\Delta t{\widehat{\beta }}_i\hfill \\ \hfill & \text{find}\overrightarrow{\alpha }{}_{ix}\mid <\frac{x_0}{2}\&\mid \overrightarrow{\alpha }{}_{iy}\mid <\frac{y_0}{2}\&\mid \overrightarrow{\alpha }{}_{iz}\mid <\frac{z_0}{2}\hfill \\ \hfill & \text{find the voxels in which each}\overrightarrow{\alpha }{}_i\mathrm{s}\text{lie in:}\hfill \\ \hfill & \text{say voxel}k(=1,2,\dots ,n)\text{carries}{l}_k\overrightarrow{\alpha }{}_i\mathrm{s}\hfill \\ \hfill & \gamma ={\underset{¯}{u}}_d(q)(1-q)+{\underset{¯}{u}}_d(q-1)(q-1)\hfill \\ \hfill & \underset{¯}{\in }=zeros(Nodes,1)\hfill \\ \hfill & \mathbf{for}k=1ton\mathbf{do}\hfill \\ \hfill & \in (k)=\gamma v{\sum }_{i=1}^{l_k}\Delta {\Omega }_i,\hfill \\ \hfill & \mathbf{end}\mathbf{for}\hfill \\ \hfill & \underset{¯}{\omega }\leftarrow \underset{¯}{\omega }+\underset{¯}{\in }\hfill \\ \hfill & \mathbf{end}\mathbf{for}\hfill \\ \hfill & \mathbf{end}\mathbf{for}\hfill \\ \hfill & \mathbf{return}\underset{¯}{\omega }\hfill \\ \hfill & \mathbf{end}\mathbf{procedure}\hfill \end{array}$$