Non-local means(NLM)method is a state-of-the-art denoising algorithm, which replaces each pixel with a weighted average of all the pixels in the image. However, the huge computational complexity makes it impractical f...Non-local means(NLM)method is a state-of-the-art denoising algorithm, which replaces each pixel with a weighted average of all the pixels in the image. However, the huge computational complexity makes it impractical for real applications. Thus, a fast non-local means algorithm based on Krawtchouk moments is proposed to improve the denoising performance and reduce the computing time. Krawtchouk moments of each image patch are calculated and used in the subsequent similarity measure in order to perform a weighted averaging. Instead of computing the Euclidean distance of two image patches, the similarity measure is obtained by low-order Krawtchouk moments, which can reduce a lot of computational complexity. Since Krawtchouk moments can extract local features and have a good antinoise ability, they can classify the useful information out of noise and provide an accurate similarity measure. Detailed experiments demonstrate that the proposed method outperforms the original NLM method and other moment-based methods according to a comprehensive consideration on subjective visual quality, method noise, peak signal to noise ratio(PSNR), structural similarity(SSIM) index and computing time. Most importantly, the proposed method is around 35 times faster than the original NLM method.展开更多
Image denoising technology is one of the forelands in the field of computer graphic and computer vision. Non-local means method is one of the great performing methods which arouse tremendous research. In this paper, a...Image denoising technology is one of the forelands in the field of computer graphic and computer vision. Non-local means method is one of the great performing methods which arouse tremendous research. In this paper, an improved weighted non-local means algorithm for image denoising is proposed. The non-local means denoising method replaces each pixel by the weighted average of pixels with the surrounding neighborhoods. The proposed method evaluates on testing images with various levels noise. Experimental results show that the algorithm improves the denoising performance.展开更多
In the paper, we propose a robust and fast image denoising method. The approach integrates both Non- Local means algorithm and Laplacian Pyramid. Given an image to be denoised, we first decompose it into Laplacian pyr...In the paper, we propose a robust and fast image denoising method. The approach integrates both Non- Local means algorithm and Laplacian Pyramid. Given an image to be denoised, we first decompose it into Laplacian pyramid. Exploiting the redundancy property of Laplacian pyramid, we then perform non-local means on every level image of Laplacian pyramid. Essentially, we use the similarity of image features in Laplacian pyramid to act as weight to denoise image. Since the features extracted in Laplacian pyramid are localized in spatial position and scale, they are much more able to describe image, and computing the similarity between them is more reasonable and more robust. Also, based on the efficient Summed Square Image （SSI） scheme and Fast Fourier Transform （FFT）, we present an accelerating algorithm to break the bottleneck of non-local means algorithm - similarity computation of compare windows. After speedup, our algorithm is fifty times faster than original non-local means algorithm. Experiments demonstrated the effectiveness of our algorithm.展开更多
Classic non-local means (CNLM) algorithm uses the inherent self-similarity in images for noise removal. The denoised pixel value is estimated through the weighted average of all the pixels in its non-local neighborhoo...Classic non-local means (CNLM) algorithm uses the inherent self-similarity in images for noise removal. The denoised pixel value is estimated through the weighted average of all the pixels in its non-local neighborhood. In the CNLM algorithm, the differences between the pixel value and the distance of the pixel to the center are both taken into consideration to calculate the weighting coefficients. However, the Gaussian kernel cannot reflect the information of edge and structure due to its isotropy, and it has poor performance in flat regions. In this paper, an improved non-local means algorithm based on local edge direction is presented for image denoising. In edge and structure regions, the steering kernel regression (SKR) coefficients are used to calculate the weights, and in flat regions the average kernel is used. Experiments show that the proposed algorithm can effectively protect edge and structure while removing noises better when compared with the CNLM algorithm.展开更多
Cryo-electron microscopic images of biological molecules usually have high noise and low contrast. It is essential to suppress noise and enhance contrast in order to recognize
The non-local means (NLM) denoising method replaces each pixel by the weighted average of pixels with the sur-rounding neighborhoods. In this paper we employ a cosine weighting function instead of the original exponen...The non-local means (NLM) denoising method replaces each pixel by the weighted average of pixels with the sur-rounding neighborhoods. In this paper we employ a cosine weighting function instead of the original exponential func-tion to improve the efficiency of the NLM denoising method. The cosine function outperforms in the high level noise more than low level noise. To increase the performance more in the low level noise we calculate the neighborhood si-milarity weights in a lower-dimensional subspace using singular value decomposition (SVD). Experimental compari-sons between the proposed modifications against the original NLM algorithm demonstrate its superior denoising per-formance in terms of peak signal to noise ratio (PSNR) and histogram, using various test images corrupted by additive white Gaussian noise (AWGN).展开更多
在室内可见光通信中符号间干扰和噪声会严重影响系统性能,K均值(K-means)均衡方法可以抑制光无线信道的影响,但其复杂度较高,且在聚类边界处易出现误判。提出了改进聚类中心点的K-means(Improved Center K-means,IC-Kmeans)算法,通过随...在室内可见光通信中符号间干扰和噪声会严重影响系统性能,K均值(K-means)均衡方法可以抑制光无线信道的影响,但其复杂度较高,且在聚类边界处易出现误判。提出了改进聚类中心点的K-means(Improved Center K-means,IC-Kmeans)算法,通过随机生成足够长的训练序列,然后将训练序列每一簇的均值作为K-means聚类中心,避免了传统K-means反复迭代寻找聚类中心。进一步,提出了基于神经网络的IC-Kmeans(Neural Network Based IC-Kmeans,NNIC-Kmeans)算法,使用反向传播神经网络将接收端二维数据映射至三维空间,以增加不同簇之间混合数据的距离,提高了分类准确性。蒙特卡罗误码率仿真表明,IC-Kmeans均衡和传统K-means算法的误码率性能相当,但可以显著降低复杂度,特别是在信噪比较小时。同时,在室内多径信道模型下,与IC-Kmeans和传统Kmeans均衡相比,NNIC-Kmeans均衡的光正交频分复用系统误码率性能最好。展开更多
基金Supported by the Open Fund of State Key Laboratory of Marine Geology,Tongji University(No.MGK1412)Open Fund(No.PLN1303)of State Key Laboratory of Oil and Gas Reservoir Geology and Exploitation(Southwest Petroleum University)+2 种基金Open Fund of Jiangsu Key Laboratory of Quality Control and Further Processing of Cereals and Oils,Nanjing University of Finance Economics(No.LYPK201304)Foundation of Graduate Innovation Center in NUAA(No.kfjj201430)Fundamental Research Funds for the Central Universities
文摘Non-local means(NLM)method is a state-of-the-art denoising algorithm, which replaces each pixel with a weighted average of all the pixels in the image. However, the huge computational complexity makes it impractical for real applications. Thus, a fast non-local means algorithm based on Krawtchouk moments is proposed to improve the denoising performance and reduce the computing time. Krawtchouk moments of each image patch are calculated and used in the subsequent similarity measure in order to perform a weighted averaging. Instead of computing the Euclidean distance of two image patches, the similarity measure is obtained by low-order Krawtchouk moments, which can reduce a lot of computational complexity. Since Krawtchouk moments can extract local features and have a good antinoise ability, they can classify the useful information out of noise and provide an accurate similarity measure. Detailed experiments demonstrate that the proposed method outperforms the original NLM method and other moment-based methods according to a comprehensive consideration on subjective visual quality, method noise, peak signal to noise ratio(PSNR), structural similarity(SSIM) index and computing time. Most importantly, the proposed method is around 35 times faster than the original NLM method.
文摘Image denoising technology is one of the forelands in the field of computer graphic and computer vision. Non-local means method is one of the great performing methods which arouse tremendous research. In this paper, an improved weighted non-local means algorithm for image denoising is proposed. The non-local means denoising method replaces each pixel by the weighted average of pixels with the surrounding neighborhoods. The proposed method evaluates on testing images with various levels noise. Experimental results show that the algorithm improves the denoising performance.
基金This work is supported by the National Grand Fundamental Research 973 Program of China(Grant No.2002CB312101)the National Natural Science Foundation of China(Grant Nos.60403038 and 60703084)the Natural Science Foundation of Jiangsu Province(Grant No.BK2007571).
文摘In the paper, we propose a robust and fast image denoising method. The approach integrates both Non- Local means algorithm and Laplacian Pyramid. Given an image to be denoised, we first decompose it into Laplacian pyramid. Exploiting the redundancy property of Laplacian pyramid, we then perform non-local means on every level image of Laplacian pyramid. Essentially, we use the similarity of image features in Laplacian pyramid to act as weight to denoise image. Since the features extracted in Laplacian pyramid are localized in spatial position and scale, they are much more able to describe image, and computing the similarity between them is more reasonable and more robust. Also, based on the efficient Summed Square Image （SSI） scheme and Fast Fourier Transform （FFT）, we present an accelerating algorithm to break the bottleneck of non-local means algorithm - similarity computation of compare windows. After speedup, our algorithm is fifty times faster than original non-local means algorithm. Experiments demonstrated the effectiveness of our algorithm.
基金National Key Research and Development Program of China(No.2016YFC0101601)Fund for Shanxi“1331 Project”Key Innovative Research Team+1 种基金Shanxi Province Science Foundation for Youths(No.201601D021080)Universities Science and Technology Innovation Project of Shanxi Province(No.2017107)
文摘Classic non-local means (CNLM) algorithm uses the inherent self-similarity in images for noise removal. The denoised pixel value is estimated through the weighted average of all the pixels in its non-local neighborhood. In the CNLM algorithm, the differences between the pixel value and the distance of the pixel to the center are both taken into consideration to calculate the weighting coefficients. However, the Gaussian kernel cannot reflect the information of edge and structure due to its isotropy, and it has poor performance in flat regions. In this paper, an improved non-local means algorithm based on local edge direction is presented for image denoising. In edge and structure regions, the steering kernel regression (SKR) coefficients are used to calculate the weights, and in flat regions the average kernel is used. Experiments show that the proposed algorithm can effectively protect edge and structure while removing noises better when compared with the CNLM algorithm.
文摘Cryo-electron microscopic images of biological molecules usually have high noise and low contrast. It is essential to suppress noise and enhance contrast in order to recognize
文摘The non-local means (NLM) denoising method replaces each pixel by the weighted average of pixels with the sur-rounding neighborhoods. In this paper we employ a cosine weighting function instead of the original exponential func-tion to improve the efficiency of the NLM denoising method. The cosine function outperforms in the high level noise more than low level noise. To increase the performance more in the low level noise we calculate the neighborhood si-milarity weights in a lower-dimensional subspace using singular value decomposition (SVD). Experimental compari-sons between the proposed modifications against the original NLM algorithm demonstrate its superior denoising per-formance in terms of peak signal to noise ratio (PSNR) and histogram, using various test images corrupted by additive white Gaussian noise (AWGN).
文摘在室内可见光通信中符号间干扰和噪声会严重影响系统性能,K均值(K-means)均衡方法可以抑制光无线信道的影响,但其复杂度较高,且在聚类边界处易出现误判。提出了改进聚类中心点的K-means(Improved Center K-means,IC-Kmeans)算法,通过随机生成足够长的训练序列,然后将训练序列每一簇的均值作为K-means聚类中心,避免了传统K-means反复迭代寻找聚类中心。进一步,提出了基于神经网络的IC-Kmeans(Neural Network Based IC-Kmeans,NNIC-Kmeans)算法,使用反向传播神经网络将接收端二维数据映射至三维空间,以增加不同簇之间混合数据的距离,提高了分类准确性。蒙特卡罗误码率仿真表明,IC-Kmeans均衡和传统K-means算法的误码率性能相当,但可以显著降低复杂度,特别是在信噪比较小时。同时,在室内多径信道模型下,与IC-Kmeans和传统Kmeans均衡相比,NNIC-Kmeans均衡的光正交频分复用系统误码率性能最好。
