Table 2:

Different compressed sensing methods, their corresponding equations, and minimization algorithm, a brief description, median computational time to converge (Intel Skylake 6148 core@2.4GHz, 32GB DDR4–2666DIMM) adjusted per slice.

CS Method	Equation	Minimization algorithm	Transform/Dictionary	median comp. time Cartesian	median comp. time Radial
STFD	[4]	MFISTA-VA-FGP	Spatial and temporal finite difference, spatial order 1 and temporal order 2	134 sec	1319 sec
WAV	[5]	MFISTA-VA	3D Wavelet transform (2D+time) Daubechies 4, with 4 levels of decomposition.	152 sec	445 sec
PCA	[5]	MFISTA-VA	Unitary transform from temporal PCA of fully-sampled data	44 sec	264 sec
EXP	[5]	MFISTA-VA	Overcomplete temporal dictionary of exponentials with 50 relaxation times between 0.75 and 300 ms	201 sec	776 sec
LR	[6]	MFISTA-VA	Applied to a NyNz × Nt matrix formed with the reshaped NyNzNt × 1 vector.	57 sec	244 sec
L+S	[7]	MFISTA-VA	Same as LR, plus identity for l1-norm	50 sec	408 sec
L+S SFD	[7]	MFISTA-VA-FGP	Same as LR, plus spatial finite difference for l1-norm	87 sec	1091 sec
L+S WAV	[7]	MFISTA-VA	Same as LR, plus 2D spatial wavelet for l1-norm, also Daubechies 4, with 4 levels.	152 sec	597 sec