Image Super-resolution Restoration based on Structure Feature in Fourier Domain for MR Images
Lijun Bao1

1Department of Electronic Science, Xiamen University, Xiamen, China, People's Republic of

Synopsis

In the learning based single image super-resolution restoration, the high frequency information is enhanced by retrieving the high-frequency information from the high resolution training samples. Therefore how to reveal the underlying relations between the HR and the LR patch spaces is the key issue. In this work, we propose to cluster the pre-collected HR example patches to generate subdictionary and select the proper subdictionary for any image patch according to the frequency spectrum feature in Fourier domain, because the Fourier spectrogram can reflect the feature complexity, local directionality and the texture periodicity of the image patch simultaneously.

Purpose

Image super-resolution (SR) restoration amounts to reconstruct a high-quality image from its degraded measurement. Such resolution-enhancing technology prove to be essential in medical MR imaging where high-quality image are not prone to acquire or unavailable in the presence of uncontrolled motion such as moving subjects and organs or fetal and neonatal magnetic resonance imaging.

Theory

The SR image techniques can be classified into frequency domain, interpolation, regularization [1] and learning based approaches [2, 3]. The first three categories get a high-resolution (HR) image from a set of low-resolution (LR) input images, while in the last approach the high frequency information of the single LR image is enhanced by retrieving the most likely high-frequency information from the HR training samples. Therefore how to reveal the underlying relations between the HR and the LR patch spaces is the key issue. For the contents of local patches across an image vary significantly, a set of subdictionaries are designed by clustering the training HR data. In this work, we propose to cluster the pre-collected HR example patches to generate subdictionary and select the proper subdictionary for any image patch according to the frequency spectrum feature in Fourier domain, because the characteristic of the Fourier spectrogram can reflect the feature complexity, local directionality and the texture periodicity of the image patch simultaneously.

As shown in Figure 1, we present typical image patches vs their Fourier frequency spectrograms. The first patch is uniform in gray intensity, and its frequency spectrum almost concentrate at zero. The patches 2 to 6 just have edge of single direction in image domain, corresponding to a spectrum line in frequency spectrogram perpendicular to the image edges, while the patches 7 to 12 containing slightly more complex edges presents two cross spectrum lines. The image patches of the last group are composed of more complicated structures and fine features, leading to spectra lines including a cross and a slash. However, when the patch structure are too mass, their frequency spectrograms will not exhibit definite spectrum feature as patches 16 to 18. On this basis, we apply the frequency spectra to do the patch clustering instead of K-means based on the Euclidian distance similarity [4] or structured sparsity with mixture Gaussian distributions [5], which are not quite reliable. With pixel set in direction θ denoted as Sθ={i(1),i(2)…i(n)}, the number of directions and the major direction of the spectrum lines in Fourier spectrograms can be determined as shown in Figure 2, and then all the image patches are clustered into 8 classes with the major spectum direction θmax using the scheme illustrated in Figure 3.

Methods

In the dictionary training process, once the cluster are completed, they are stored as a trained dictionary composed of multiple subdictionaries, which can be directly used in the reconstruction. Combined with sparsity constraint and weighted regularization terms, the SR reconstruction model can be formulated as follow

$$min‖DHX-Y‖_2^2 +λ‖ΦX‖_1+β‖M∇X‖_1$$

The first item is reconstruction fidelity energy where D means to down sampling and H denotes as deblurring operator, and the last item is a prior regularity to enhance the image edges, where weighting matrix M is defined that large gradient is zeros while uniform region is one. The second item is a sparse constrain in the transform domain Φ, herein is the PCA bases of the image patches of same θmax in each subdictionary. A brain MR image and its patch Fourier spectrograms are demonstrated in Figure 4 (patch size 15×15), where first 100 patches are selected for each clusters. It is observed that all the patches seperated into different groups have similar structure complexity and feature direction. Thus, the subdictionary construted from this kind of clustering is more adaptive and also behaves better sparsity. This optimization model can be solved in two steps by iterative soft threshold algorithm and conjugate gradient algorithm. Figure 5 demonstrated the SR reconstructed image of our proposed method (PSNR=30.06, MSSIM=0.95) compared to the original HR image and bicubic interplation method (PSNR=23.22, MSSIM=0.87), with image high resolution of 256×256 and low resolution of 128×128. We can see that our method can recover more fine details as shown in zoomed views with better evaluation parameters.

Acknowledgements

This work was supported by the NNSF of China under Grants 81301277, the Research Fund for the Doctoral Program of Higher Education of China under Grant 20130121120010 and NSF of Fujian Province of China under Grant 2014J05099.

References

1. Gholipour, A.; Estroff, J.A.; Warfield, S.K., "Robust Super-Resolution Volume Reconstruction from Slice Acquisitions: Application to Fetal Brain MRI," in Medical Imaging, IEEE Transactions on, vol.29, no.10, pp.1739-1758, Oct. 2010

2. Jianchao Yang; Wright, J.; Huang, T.S.; Yi Ma, "Image Super-Resolution via Sparse Representation," in Image Processing, IEEE Transactions on, vol.19, no.11, pp.2861-2873, Nov. 2010

3. Xinbo Gao; Kaibing Zhang; Dacheng Tao; Xuelong Li, "Joint Learning for Single-Image Super-Resolution via a Coupled Constraint," in Image Processing, IEEE Transactions on, vol.21, no.2, pp.469-480, Feb. 2012

4. Weisheng Dong; Zhang, D.; Guangming Shi; Xiaolin Wu, "Image Deblurring and Super-Resolution by Adaptive Sparse Domain Selection and Adaptive Regularization," in Image Processing, IEEE Transactions on, vol.20, no.7, pp.1838-1857, July 2011

5. Guoshen Yu; Sapiro, G.; Mallat, S., "Solving Inverse Problems with Piecewise Linear Estimators: From Gaussian Mixture Models to Structured Sparsity," in Image Processing, IEEE Transactions on, vol.21, no.5, pp.2481-2499, May 2012

Figures

Figure 1. Three groups of typical patches in image domain with their frequency spectrograms in Fourier domain.

Figure 2. How to determine the number of directions and the major direction of the spectrum lines in the Fourier spectrogram. (a) pixel set in direction θ denoted as Sθ={i(1),i(2)…i(n)}, with zero-frequency centered at i(8), (b) flow chart.

Figure 3. The patch clustering scheme using the number of directions and the major direction of the spectrum lines in the frequency spectra.

Figure 4. A brain MR image and its patch Fourier spectrograms analysis (a-b), (c) first 100 patches selected from each HR patch clusters of size 15×15 pixels.

Figure 5. The SR reconstructed image using our proposed method (c), compared to the original HR image(a) and their error map (d), and the result of bicubic interpolation method (c), with image high resolution of 256×256 and low resolution of 128×128. Two local regions are zoomed in the bottom.



Proc. Intl. Soc. Mag. Reson. Med. 24 (2016)
1789