Swati Rane, Lakshmappa K. Ragha, Siddalingappagouda Biradar, Vaibhav R. Pandit
{"title":"Using Marchenko–Pastur SVD and Linear MMSE Estimation for Reducing Image Noise","authors":"Swati Rane, Lakshmappa K. Ragha, Siddalingappagouda Biradar, Vaibhav R. Pandit","doi":"10.47164/ijngc.v13i5.915","DOIUrl":null,"url":null,"abstract":"The degradation in visual quality of images is often seen due to a variety of noise added inevitably at the time of image acquisition. Its restoration has thus become a fundamental and significant problem in image processing. Many attempts are made in recent past to efficiently denoise images. But, the best possible solution to this problem is still an open research problem. This paper validates the effectiveness of one such popular image denoising approach, where an adaptive image patch clustering is followed by the two step denoising algorithm in Principal Component Analysis (PCA) domain. First step uses Marchenko–Pastur law based hard thresholding of singular values in the singular value decomposition (SVD) domain and the second step removes remaining noise in PCA domain using Linear Minimum Mean-Squared-Error (LMMSE), a soft thresholding. The experimentation is conducted on gray-scale images corrupted by four different noise types namely speckle, salt & pepper, Gaussian, and Poisson. The efficiency of image denoising is quantified in terms of popular image quality metrics peak signal-to-noise ratio (PSNR), structural similarity (SSIM), feature similarity (FSIM), and the denoising time. The comprehensive performance analysis of the denoising approach against the four noise models underlies its suitability to various applications. This certainly gives the new researchers a direction for selection of image denoising method.","PeriodicalId":42021,"journal":{"name":"International Journal of Next-Generation Computing","volume":"69 1","pages":""},"PeriodicalIF":0.3000,"publicationDate":"2022-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Next-Generation Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.47164/ijngc.v13i5.915","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
The degradation in visual quality of images is often seen due to a variety of noise added inevitably at the time of image acquisition. Its restoration has thus become a fundamental and significant problem in image processing. Many attempts are made in recent past to efficiently denoise images. But, the best possible solution to this problem is still an open research problem. This paper validates the effectiveness of one such popular image denoising approach, where an adaptive image patch clustering is followed by the two step denoising algorithm in Principal Component Analysis (PCA) domain. First step uses Marchenko–Pastur law based hard thresholding of singular values in the singular value decomposition (SVD) domain and the second step removes remaining noise in PCA domain using Linear Minimum Mean-Squared-Error (LMMSE), a soft thresholding. The experimentation is conducted on gray-scale images corrupted by four different noise types namely speckle, salt & pepper, Gaussian, and Poisson. The efficiency of image denoising is quantified in terms of popular image quality metrics peak signal-to-noise ratio (PSNR), structural similarity (SSIM), feature similarity (FSIM), and the denoising time. The comprehensive performance analysis of the denoising approach against the four noise models underlies its suitability to various applications. This certainly gives the new researchers a direction for selection of image denoising method.