### Image patch prior based denoising algorithm by using low rank approximation and Wiener filtering

ZHANG Yang, CHEN Fei*, XU Haiping

1. College of Mathematics and Computer Science, Fuzhou University, Fuzhou 350116, Fujian, China
• Received:2017-01-05 Online:2017-06-20 Published:2017-01-05

Abstract: A Gaussian mixture model(GMM)was used to study the texture structure of natural image patches, and a low-rank approximation and Wiener filtering algorithm based on image patch prior were proposed. The proposed method divided the image into a number of overlapped patches and clustered them for collaborative filtering by using the prior structures of external image patch and internal image self-similarity. By grouping nonlocal similar patches, low-rank approximation was used as collaborative filtering to recover the texture structures. When the number of similar patches was small, Wiener filtering with patch prior was adopted to preserve texture features. The experimental results indicated that the proposed method was more suitable for the images with fewer similar patches like boundary and corner etc., and showed very competitive performance with state-of-the-art denoising method in terms of Peak Signal to Noise Ratio(PSNR)and visual quality.

CLC Number:

• TP37
 [1] ZORAN D, WEISS Y. From learning models of natural image patches to whole image restoration[C] //Proceedings of the 13th International Conference on Computer Vision(ICCV 2011). Barcelona, Spain: IEEE Computer Society, 2011, 6669(5): 479-486.[2] CHATTERJEE P, MILANFAR P. Learning denoising bounds fornoisy images[C] //Proceedings of the 17thInternational Conference on Image Processing(ICIP 2010). Hong Kong, China: IEEE Computer Society, 2010:1157-1160.[3] RUDIN L I, OSHER S, FATEMI E. Nonlinear total variation based noise removal algorithms[J].Physica D: Nonlinear Phenomena,1992, 60(1):259-268.[4] PORTILLA J, STRELA V, WAINWRIGHT M, et al, Image denoising using scale mixturesof Gaussians in the waveletdomain[J].IEEE Transactions on Image Processing A Publication of the IEEE Signal Processing Society, 2003, 12(11):1338-1351.[5] BUADES A, COLL B, MOREL J M. A nonlocal algorithm for image denoising[C] //Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition(CVPR'05). SanDiego, USA: IEEE Computer Society, 2005.[6] DABOV K, FOI A, KATKOVNIK V, et al. Image denoising by sparse 3-d transform-domain collaborative filtering[J]. IEEE Transactions on Image Processing, 2007,16(8):2080-2095.[7] MAIRAL J, BACH F, PONCE J, et al. Non-local sparse models for image restoration[C] //Proceedings of the 12th International Conference on Computer Vision(ICCV 2009). Kyoto, Japan: IEEE Computer Society, 2009, 30(2):2272-2279.[8] AHARON M, ELAD M, BRUCKSTEIN A. K-svd: an algorithm for designing overcomplete dictionaries for sparse representation[J]. IEEE Transactions on Signal Processing, 2006, 54(11): 4311-4322.[9] DONG W, SHI G, LI X. Nonlocal image restoration wi-th bilateral variance estimation: a low-rank approach[J].IEEE Transaction on Image Processing, 2013, 22(2):700-711.[10] GU S, ZHANG L, ZUO W, et al. Weighted nuclear nor-m minimization with application to image denoising[C] //Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition(CVPR 2014). Columbus, USA: IEEE Computer Society, 2014:2862-2869.[11] DONG W, SHI G, LI X, et al. Compressive sensing via nonlocal low rank regularization[J]. IEEE Transactions on Image Processing, 2014, 23(8): 3618-3632.[12] 刘波,杨华,张志强.基于奇异值分解的图像去噪[J].微电子学与计算机,2007,24(11):169-171. LIU Bo, YANG Hua, ZHANG Zhiqiang. Image denoisingbased on singular value decomposition[J]. Microelectronics and Computer, 2007, 24(11):169-171.[13] 张俊峰,孙清伟.基于图像旋转和分块的奇异值分解图像去噪[J].激光与红外,2009,39(5):538-541. ZHANG Junfeng, SUN Qingwei. Image denoising based on SVD using image rotation and block[J]. Laser and Infrared, 2009, 39(5):538-541.[14] BURGER H, SCHULER C, HARMELING S. Image denoising: can plain neural networks compete with bm3d[C] //Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition(CVPR 2012). Rhode Island, USA: IEEE Computer Society, 2012:2392-2399.[15] CHEN F, ZHANG L, YU H M. External patch prior guided internal clustering for image denoising[C] //Proceedings of the 2015 IEEE International Conference on Computer Vision(ICCV). San Diego, USA: IEEE Computer Society, 2015:603-611.[16] DEMPSTER A P, LAIRD N M, RUBIN D B.Maximum likelihood from incomplete data via the EM algorithm[J]. Journal of the Royal Statistical Society. Series B(Methodological), 1977, 39(1):1-38.[17] CAI J F, CANDES E J, SHEN Z W. A singular value thresholding algorithm for matrix completion[J]. SIAM Journal on Optimization, 2010, 20(4):1956-1982.
 [1] WU Huan, ZHONG Farong, MO Yuchang, PAN Zhusheng, ZENG Lingguo. Performance comparison between breadth-first ordering and priority ordering in network reliability analysis [J]. JOURNAL OF SHANDONG UNIVERSITY (ENGINEERING SCIENCE), 2015, 45(2): 43-48. [2] ZHAO Jia-min, FENG Ai-min*, LIU Xue-jun. A new structured one-class support vector machine with local density embedding [J]. JOURNAL OF SHANDONG UNIVERSITY (ENGINEERING SCIENCE), 2012, 42(4): 13-18. [3] ZHANG You-xin, WANG Li-hong. Two-stage semi-supervised clustering algorithm based on affinity propagation [J]. JOURNAL OF SHANDONG UNIVERSITY (ENGINEERING SCIENCE), 2012, 42(2): 18-22. [4] QU Bo 1, XU Baowen 1,2, NIE Changhai 1,2. A dynamic prioritization method for supplemental test cases [J]. JOURNAL OF SHANDONG UNIVERSITY (ENGINEERING SCIENCE), 2009, 39(2): 137-140.
Viewed
Full text

Abstract

Cited

Shared
Discussed