The need for fast acquisition and automatic analysis of MRI data is growing. Although compressed sensing magnetic resonance imaging (CS-MRI) has been studied to accelerate MRI by reducing k-space measurements, current techniques overlook downstream applications such as segmentation when doing image reconstruction. In this paper, we test the utility of CS-MRI when performing automatic segmentation and propose a unified deep neural network architecture called SegNetMRI for simultaneous CS-MRI reconstruction and segmentation. SegNetMRI uses an MRI reconstruction network with multiple cascaded blocks, each containing an encoder-decoder unit and a data fidelity unit, and a parallel MRI segmentation network having the same encoder-decoder structure. The two subnetworks are pre-trained and fine-tuned with shared reconstruction encoders. The outputs are merged into the final segmentation. Our experiments show that SegNetMRI can improve both the reconstruction and segmentation performance when using compressed measurements.
The main research focus of CS-MRI is proposing better @math and efficient optimization techniques. In the first CS-MRI work called SparseMRI @cite_1 , wavelet domain @math sparsity plus image total variation are imposed as regularizations. More complicated wavelet variants are designed for CS-MRI in PANO @cite_8 and GBRWT @cite_7 . Dictionary learning techniques are also introduced in CS-MRI, e.g., DLMRI @cite_12 and BPTV @cite_9 . These works can all be categorized as sparsity-based CS-MRI methods; they model the MRI with a shallow'' sparse prior, which often tends to over-smooth the image.
@cite_7 @cite_8 @cite_9 @cite_1 @cite_12
2191349405 2141168890 2119047398 2101675075 2168668658
Abstract Compressed sensing magnetic resonance imaging has shown great capacity for accelerating magnetic resonance imaging if an image can be sparsely represented. How the image is sparsified seriously affects its reconstruction quality. In the present study, a graph-based redundant wavelet transform is introduced to sparsely represent magnetic resonance images in iterative image reconstructions. With this transform, image patches is viewed as vertices and their differences as edges, and the shortest path on the graph minimizes the total difference of all image patches. Using the l 1 norm regularized formulation of the problem solved by an alternating-direction minimization with continuation algorithm, the experimental results demonstrate that the proposed method outperforms several state-of-the-art reconstruction methods in removing artifacts and achieves fewer reconstruction errors on the tested datasets. Abstract Compressed sensing MRI (CS-MRI) has shown great potential in reducing data acquisition time in MRI. Sparsity or compressibility plays an important role to reduce the image reconstruction error. Conventional CS-MRI typically uses a pre-defined sparsifying transform such as wavelet or finite difference, which sometimes does not lead to a sufficient sparse representation for the image to be reconstructed. In this paper, we design a patch-based nonlocal operator (PANO) to sparsify magnetic resonance images by making use of the similarity of image patches. The definition of PANO results in sparse representation for similar patches and allows us to establish a general formulation to trade the sparsity of these patches with the data consistency. It also provides feasibility to incorporate prior information learnt from undersampled data or another contrast image, which leads to optimized sparse representation of images to be reconstructed. Simulation results on in vivo data demonstrate that the proposed method achieves lower reconstruction error and higher visual quality than conventional CS-MRI methods. We develop a Bayesian nonparametric model for reconstructing magnetic resonance images (MRIs) from highly undersampled (k ) -space data. We perform dictionary learning as part of the image reconstruction process. To this end, we use the beta process as a nonparametric dictionary learning prior for representing an image patch as a sparse combination of dictionary elements. The size of the dictionary and patch-specific sparsity pattern are inferred from the data, in addition to other dictionary learning variables. Dictionary learning is performed directly on the compressed image, and so is tailored to the MRI being considered. In addition, we investigate a total variation penalty term in combination with the dictionary learning model, and show how the denoising property of dictionary learning removes dependence on regularization parameters in the noisy setting. We derive a stochastic optimization algorithm based on Markov chain Monte Carlo for the Bayesian model, and use the alternating direction method of multipliers for efficiently performing total variation minimization. We present empirical results on several MRI, which show that the proposed regularization framework can improve reconstruction accuracy over other methods. The sparsity which is implicit in MR images is exploited to significantly undersample k -space. Some MR images such as angiograms are already sparse in the pixel representation; other, more complicated images have a sparse representation in some transform domain–for example, in terms of spatial finite-differences or their wavelet coefficients. According to the recently developed mathematical theory of compressedsensing, images with a sparse representation can be recovered from randomly undersampled k -space data, provided an appropriate nonlinear recovery scheme is used. Intuitively, artifacts due to random undersampling add as noise-like interference. In the sparse transform domain the significant coefficients stand out above the interference. A nonlinear thresholding scheme can recover the sparse coefficients, effectively recovering the image itself. In this article, practical incoherent undersampling schemes are developed and analyzed by means of their aliasing interference. Incoherence is introduced by pseudo-random variable-density undersampling of phase-encodes. The reconstruction is performed by minimizing the 1 norm of a transformed image, subject to data Compressed sensing (CS) utilizes the sparsity of magnetic resonance (MR) images to enable accurate reconstruction from undersampled k-space data. Recent CS methods have employed analytical sparsifying transforms such as wavelets, curvelets, and finite differences. In this paper, we propose a novel framework for adaptively learning the sparsifying transform (dictionary), and reconstructing the image simultaneously from highly undersampled k-space data. The sparsity in this framework is enforced on overlapping image patches emphasizing local structure. Moreover, the dictionary is adapted to the particular image instance thereby favoring better sparsities and consequently much higher undersampling rates. The proposed alternating reconstruction algorithm learns the sparsifying dictionary, and uses it to remove aliasing and noise in one step, and subsequently restores and fills-in the k-space data in the other step. Numerical experiments are conducted on MR images and on real MR data of several anatomies with a variety of sampling schemes. The results demonstrate dramatic improvements on the order of 4-18 dB in reconstruction error and doubling of the acceptable undersampling factor using the proposed adaptive dictionary as compared to previous CS methods. These improvements persist over a wide range of practical data signal-to-noise ratios, without any parameter tuning.