While the formation of ghost-free images from EPI data can be a difficult problem, recent low-rank matrix modeling methods have demonstrated promising results. In this abstract, we provide new theoretical insight into these approaches, and show that the low-rank ghost correction optimization problem has infinitely many solutions without using additional constraints. However, we also show that SENSE-like or GRAPPA-like constraints can be successfully used to make the problem well-posed, even for single-channel data. Additionally, we show that substantial performance gains can be achieved over previous low-rank ghost correction implementations by using nonconvex low-rank regularization instead of previous convex approaches.
How to access this content:
For one year after publication, abstracts and videos are only open to registrants of this annual meeting. Registrants should use their existing login information. Non-registrant access can be purchased via the ISMRM E-Library.
After one year, current ISMRM & ISMRT members get free access to both the abstracts and videos. Non-members and non-registrants must purchase access via the ISMRM E-Library.
After two years, the meeting proceedings (abstracts) are opened to the public and require no login information. Videos remain behind password for access by members, registrants and E-Library customers.
Keywords