Magnetic Resonance Fingerprinting (MRF) accelerates quantitative magnetic resonance imaging. The reconstruction can be separated into two problems: reconstruction of a set of multi-contrast images from k-space signals, and estimation of parametric maps from the set of multi-contrast images. In this study we focus on the former problem, while leveraging dictionary matching for the estimation of parametric maps. Two different sparsity promoting regularisation strategies were investigated: contrast-wise Total Variation (TV) which encourages image sparsity separately; and Total Nuclear Variation (TNV) which promotes a measure of joint edge sparsity. We found improved results using joint sparsity.