Abstract: Provided are a parallel magnetic resonance imaging method and apparatus based on adaptive joint sparse codes and a computer-readable medium. The method includes solving an l2?lF?l2,1 minimization objective, where the l2 norm is a data fitting term, the lF norm is a sparse representation error, and the l2,1 mixed norm is the joint sparsity constraining across multiple channels; separately updating each of a sparse matrix, a dictionary and K-space data with a corresponding algorithm, and obtaining a reconstructed image by a sum of root mean squares of all the channels. The joint sparsity of the channels is developed using the norm l2,1. In this manner, calibration is not required while information sparsity is developed. Moreover, the method is robust.

Abstract: Provided are a parallel magnetic resonance imaging method and apparatus based on adaptive joint sparse codes and a computer-readable medium. The method includes solving an l2?lF?l2,1 minimization objective, where the l2 norm is a data fitting term, the lF norm is a sparse representation error, and the l2,1 mixed norm is the joint sparsity constraining across multiple channels; separately updating each of a sparse matrix, a dictionary and K-space data with a corresponding algorithm, and obtaining a reconstructed image by a sum of root mean squares of all the channels. The joint sparsity of the channels is developed using the norm l2,1. In this manner, calibration is not required while information sparsity is developed. Moreover, the method is robust.