Volume 13 Supplement 1
Video compressive sensing for dynamic MRI
© Shi et al; licensee BioMed Central Ltd. 2012
Published: 16 July 2012
Recent theoretical and practical advances in video compressive sensing (CS) hold considerable promise for the application in dynamic MRI [1, 2], an imaging technique for capturing sequence of images. The most profound utility of dynamic MRI is to examine motion, which carries biological signature of malfunctions for various organs, especially the heart and the lung. Dynamic MRI can also examine brain functions, exemplified by perfusion imaging. Compressive sensing enables signal recovery based on number of samples well below Nyquist rate, thereby accelerating the acquisition process of MRI.
Existing literature mainly employs two specific methodologies for dynamic imaging of organs such as the heart and the lung. The first method relies on a set of static imaging acquisitions while the subject holds breathing, and resorts to image registration for retrieving the motion. The second method tries to capture free-breathing motion by using fast imaging techniques, with a trade-off between image resolution and quality. Both methods have their limitations, and we envision video compressive sensing can resolve the challenge.
We propose a novel framework, inspired by a state-of-the-art video compressive sensing algorithm , to estimate motion and reconstruct high fidelity dynamic MRI based on partially sampled k-t data. Given highly under-sampled data in the k-t space, we first estimate a low-resolution version of the video at a sequence of sub-sampled time points based on a customized sensing matrix in the Fourier domain. The spatial and temporal resolution of this video is optimized for the best image quality, given the time varying nature of dynamic imaging and the uncertainty principle. Optical flow is consequently estimated between consecutive frames of this reconstructed low-resolution video .
Based on the partially sampled Fourier data, and the motion estimate obtained from the optical flow, we use a convex optimization framework to reconstruct the dynamic MRI at full spatial resolution. For the best recovery performance, we minimize an objective function using a mixture of wavelet sparsity of the MRI signal as well as its total variation (TV) in both spatial and temporal dimensions; the objective function is minimized along with two constraints in the least square sense. These constraints (a) enforce consistency of compressive measurements, and (b) impose the estimated optical flow between consecutive frames.
We develop an efficient algorithm to solve for the resultant convex optimization using the alternating direction method based on augmented Lagrangian, further accelerated using Bregman divergence on a sequence of minimization subproblems [5, 6].
Our framework enables simultaneous motion extraction and high fidelity video reconstruction in a computational efficient manner, based on highly compressive k-t sampling, therefore making it possible to perform real-time dynamic MRI.
- Gamper U, Boesiger P, Kozerke S: Compressed sensing in dynamic MRI. Magn. Reson. Med. 2008, 59 (2): 365-373. 10.1002/mrm.21477.View ArticlePubMedGoogle Scholar
- Jung H, Sung K, Nayak KS, Kim EY, Ye JC: k-t FOCUSS: a general compressed sensing framework for high resolution dynamic MRI. Magn. Reson. Med. 2009, 61 (1): 103-116. 10.1002/mrm.21757.View ArticlePubMedGoogle Scholar
- Sankaranarayanan AC, Studer C, Baraniuk RG: CS-MURI: video compressive sensing for spatial-multiplexing cameras. International Conference on Computational Photography. 2012, acceptedGoogle Scholar
- Horn B, Schunck B: Determining optical flow. Artif. Intel. 1981, 17: 185-203. 10.1016/0004-3702(81)90024-2.View ArticleGoogle Scholar
- Goldstein T, Osher S: The split Bregman method for L1-regularized problems. SIAM J. Imaging Sci. 2009, 2: 323-343. 10.1137/080725891.View ArticleGoogle Scholar
- Wang Y, Yang J, Yin W, Zhang Y: A new alternating minimization algorithm for total variation image reconstruction. SIAM J. Imaging Sci. 2008, 1 (3): 248-272. 10.1137/080724265.View ArticleGoogle Scholar