A two-level Bregmanized method with graph regularized sparse coding （TBGSC） is presented for image interpolation. The outer-level Bregman iterative procedure enforces the observation data constraints, while the inner-level Bregmanized method devotes to dictionary updating and sparse represention of small overlapping image patches. The introduced constraint of graph regularized sparse coding can capture local image features effectively, and consequently enables accurate reconstruction from highly undersampled partial data. Furthermore, modified sparse coding and simple dictionary updating applied in the inner minimization make the proposed algorithm converge within a relatively small number of iterations. Experimental results demonstrate that the proposed algorithm can effectively reconstruct images and it outperforms the current state-of-the-art approaches in terms of visual comparisons and quantitative measures.
针对磁共振(magnetic resonance,MR)幅度图像中带有不易去除的与信号相关的莱斯(Rician)噪声问题,利用其复数图像中的实部与虚部所含噪声为不相关的加性高斯白噪声这一特性,代替对幅度图像直接去噪,提出将原始对偶字典学习(predual dictionary learning,PDL)算法用于对MR复数图像的实部与虚部分别进行去噪,然后组合得到幅度图像的方法.经仿真实验和在HT-MRSI50-50(50 mm)1.2 T小动物核磁共振系统中的实际应用,证明所提方法较直接对幅度图像去噪取得更好的效果,在有效去除MR图像噪声的同时能较好地保持图像中的细节.与经典的字典学习算法核奇异值分解(kernel singular value decomposition,K-SVD)相比,PDL算法去噪效果优于K-SVD算法,而运算速度提高约5倍.与经典的基于非局部相似块的三维块匹配滤波(block-matching and 3D filtering,BM3D)算法相比,在噪声水平较低时PDL算法略优于BM3D算法,噪声水平较高时BM3D算法略优于PDL算法,两者总体比较接近.
