Structured Low-Rank Algorithms: Theory, Magnetic Resonance Applications, and Links to Machine Learning

Authors:
Publisher website
Google Scholar
Abstract
In this article, we provide a detailed review of recent advances in the recovery of continuous-domain multidimensional signals from their few nonuniform (multichannel) measurements using structured low-rank (SLR) matrix completion formulation. This framework is centered on the fundamental duality between the compactness (e.g., sparsity) of the continuous signal and the rank of a structured matrix, whose entries are functions of the signal. This property enables the reformulation of the signal recovery as an SLR matrix completion problem, which includes performance guarantees. We also review fast algorithms that are comparable in complexity to current compressed sensing (CS) methods, which enable the framework's application to large-scale magnetic resonance (MR) recovery problems. The remarkable flexibility of the formulation can be used to exploit signal properties that are difficult to capture by current sparse and low-rank optimization strategies. We demonstrate the utility of the framework in a wide range of MR imaging (MRI) applications, including highly accelerated imaging, calibration-free acquisition, MR artifact correction, and ungated dynamic MRI.
Funding Information
  • National Research Foundation (NRF-2016R1A2B3008104)
  • Foundation for the National Institutes of Health (1R01EB019961-01A1, R01 EB019961-02S1)

This publication has 35 references indexed in Scilit: