Motion adaptive patch-based low-rank approach for compressed sensing cardiac cine MRI.
basic_science · Level V
Where this comes from
- Record sourced from PubMed, PMID 24951686.
- Also identified by DOI 10.1109/TMI.2014.2330426.
- No licence information is recorded for this record.
- Because redistribution is not established, this page shows the abstract only. Follow the links below for the full text.
Abstract
One of the technical challenges in cine magnetic resonance imaging (MRI) is to reduce the acquisition time to enable the high spatio-temporal resolution imaging of a cardiac volume within a short scan time. Recently, compressed sensing approaches have been investigated extensively for highly accelerated cine MRI by exploiting transform domain sparsity using linear transforms such as wavelets, and Fourier. However, in cardiac cine imaging, the cardiac volume changes significantly between frames, and there often exist abrupt pixel value changes along time. In order to effectively sparsify such temporal variations, it is necessary to exploit temporal redundancy along motion trajectories. This paper introduces a novel patch-based reconstruction method to exploit geometric similarities in the spatio-temporal domain. In particular, we use a low rank constraint for similar patches along motion, based on the observation that rank structures are relatively less sensitive to global intensity changes, but make it easier to capture moving edges. A Nash equilibrium formulation with relaxation is employed to guarantee convergence. Experimental results show that the proposed algorithm clearly reconstructs important anatomical structures in cardiac cine image and provides improved image quality compared to existing state-of-the-art methods such as k-t FOCUSS, k-t SLR, and MASTeR.
Medical subject headings
- Image Processing, Computer-Assisted
- Magnetic Resonance Imaging, Cine
- Signal Processing, Computer-Assisted