Abstract
Magnetic Resonance Imaging (MRI) is highly sensitive to patient motion, which introduces artifacts like ghosting and blurring. Traditional correction methods often require additional scan time or specific sampling sequences. This paper presents a novel approach using Compressed Sensing (CS) principles to jointly estimate motion and image content. By leveraging the Sparse Relaxed Averaged Alternating Reflections (SRAAR) algorithm, the method identifies the most compressible image consistent with acquired k-space data. Results on phantom and simulated brain data demonstrate significant artifact reduction without the need for extra "navigator" data.
Introduction
Magnetic Resonance Imaging (MRI) is a cornerstone of modern diagnostic medicine, yet it remains notoriously sensitive to patient movement. Even minor physiological motions, such as breathing or slight shifts in position, can corrupt the "k-space" data—the raw frequency information collected by the scanner. This corruption manifests as ghosting and blurring in the final image, often necessitating costly and time-consuming re-scans.
Problem Statement
The challenge of motion correction is fundamentally "ill-posed": infinitely many combinations of possible motions and underlying images could produce the same corrupted raw data. Existing solutions typically fall into two categories:
- Navigators: These involve acquiring extra k-space lines to track motion, which increases total scan time.
- Phase Retrieval: These methods use prior knowledge of the Region of Interest (ROI), which is often limited in scope and flexibility.
This research proposes a method to solve the motion correction problem without requiring extra data or restrictive sampling sequences.
Methodology
The authors treat motion correction as an optimization problem rooted in Compressed Sensing (CS). The core hypothesis is that a motion-free MR image is naturally sparse (compressible) in a transform domain, such as wavelets, whereas a motion-corrupted image is not.
The SRAAR Algorithm
To solve this non-convex joint estimation problem, the authors introduce the Sparse Relaxed Averaged Alternating Reflections (SRAAR) algorithm. This iterative projection method alternates between two domains:
- Sparse Domain: The image is constrained to be compressible, minimizing the $\ell_1$ norm.
- Fourier Domain: The image is forced to remain consistent with the physical data collected by the scanner.
The algorithm assumes that motion is constant during a single "readout line" but can change between lines, a realistic model for many MRI sequences.
Experimental Setup
The approach was validated using:
- Shepp-Logan Phantom: A standard numerical model for testing reconstruction accuracy.
- BrainWeb Data: Simulated human brain data providing a complex, realistic test case.
- Simulated Motion: Random translational motions were applied, and varying levels of noise (SNR = 20dB and 26dB) were added to simulate real-world conditions.
Results
The SRAAR algorithm demonstrated high efficacy in removing motion artifacts. For the Shepp-Logan phantom, near-exact reconstruction was achieved within 100 iterations. In simulated brain scans with motions up to 5 pixels, the algorithm successfully removed severe artifacts, leaving only minor residuals.
The algorithm is computationally efficient, with each iteration taking approximately one second on a standard 3GHz CPU. While performance degrades under extreme motion combined with high noise, the SRAAR reconstruction consistently outperforms the uncorrected corrupted images.
Discussion and Limitations
A key advantage of this framework is its "backward compatibility"; it works on standard full-sampled data without needing specialized sequences. However, several limitations remain:
- Motion Model: The current model only accounts for 2D translational motion, excluding rotation or 3D through-plane movement.
- Parameter Sensitivity: The algorithm requires tuning a sparsity-related constant ($C$), which currently relies on heuristics.
- Local Minima: Due to the non-convex nature of the problem, the algorithm may converge to sub-optimal solutions if the initial motion is excessively large.
Future work may extend this framework to undersampled MRI, potentially enabling simultaneous motion correction and accelerated scanning.
Summary updated