On the one hand, a parallel framework for GWCS is explored. GWCS is a highly parallelizable problem, so we will make use of the OpenCLIPER framework, another previous work of ours, for its implementation. This solution is motion compensated to increase the sparse character of the solution, so we have to parallelize: 1) the groupwise registration algorithm to estimate the motion, which will be done using FFDs with cubic B-splines, and 2) the optimization algorithm of the reconstruction itself, for which we will use NESTA. Results obtained with and without motion estimation and compensation are analyzed to conclude that the solution is clinically viable in terms of execution times, and suitable for any computing device which has an OpenCL implementation.On the other hand, we propose a GWCS-like approach that leverages deep learning to enhance the reconstruction process. Our approach eliminates the need of optimization steps and utilizes deep learning techniques instead to speed up reconstructions and reduce computational complexity.We first create a fast solution for registration with unsupervised DL, called dGW, and then a self-supervised DL solution for motion-compensated reconstruction (SSMoComp) that relies on the previously trained registration. Regarding dGW, we found that it achieved comparable accuracy to traditional optimization-based approaches, but with significantly reduced registration runtimes. As for SSMoComp, we conducted a comparative analysis with a state-of-the-art solution and observed that our design outperformed it, yielding superior results. A modified version of the cine DL solution was additionally adapted for first-pass perfusion, called SECRET.Compared with state-of-the-art approaches, the SECRET method maintains good quality reconstructions for higher acceleration rates, with low training and very fast reconstruction times.