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.展开更多
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.展开更多
Background Image denoising is an important topic in the digital image processing field.This study theoretically investigates the validity of the classical nonlocal mean filter(NLM)for removing Gaussian noise from a no...Background Image denoising is an important topic in the digital image processing field.This study theoretically investigates the validity of the classical nonlocal mean filter(NLM)for removing Gaussian noise from a novel statistical perspective.Method By considering the restored image as an estimator of the clear image from a statistical perspective,we gradually analyze the unbiasedness and effectiveness of the restored value obtained by the NLM filter.Subsequently,we propose an improved NLM algorithm called the clustering-based NLM filter that is derived from the conditions obtained through the theoretical analysis.The proposed filter attempts to restore an ideal value using the approximately constant intensities obtained by the image clustering process.In this study,we adopt a mixed probability model on a prefiltered image to generate an estimator of the ideal clustered components.Result The experiment yields improved peak signal-to-noise ratio values and visual results upon the removal of Gaussian noise.Conclusion However,the considerable practical performance of our filter demonstrates that our method is theoretically acceptable as it can effectively estimate ideal images.展开更多
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均衡的光正交频分复用系统误码率性能最好。展开更多
The main purpose of blasting operation is to produce desired and optimum mean size rock fragments.Smaller or fine fragments cause the loss of ore during loading and transportation,whereas large or coarser fragments ne...The main purpose of blasting operation is to produce desired and optimum mean size rock fragments.Smaller or fine fragments cause the loss of ore during loading and transportation,whereas large or coarser fragments need to be further processed,which enhances production cost.Therefore,accurate prediction of rock fragmentation is crucial in blasting operations.Mean fragment size(MFS) is a crucial index that measures the goodness of blasting designs.Over the past decades,various models have been proposed to evaluate and predict blasting fragmentation.Among these models,artificial intelligence(AI)-based models are becoming more popular due to their outstanding prediction results for multiinfluential factors.In this study,support vector regression(SVR) techniques are adopted as the basic prediction tools,and five types of optimization algorithms,i.e.grid search(GS),grey wolf optimization(GWO),particle swarm optimization(PSO),genetic algorithm(GA) and salp swarm algorithm(SSA),are implemented to improve the prediction performance and optimize the hyper-parameters.The prediction model involves 19 influential factors that constitute a comprehensive blasting MFS evaluation system based on AI techniques.Among all the models,the GWO-v-SVR-based model shows the best comprehensive performance in predicting MFS in blasting operation.Three types of mathematical indices,i.e.mean square error(MSE),coefficient of determination(R^(2)) and variance accounted for(VAF),are utilized for evaluating the performance of different prediction models.The R^(2),MSE and VAF values for the training set are 0.8355,0.00138 and 80.98,respectively,whereas 0.8353,0.00348 and 82.41,respectively for the testing set.Finally,sensitivity analysis is performed to understand the influence of input parameters on MFS.It shows that the most sensitive factor in blasting MFS is the uniaxial compressive strength.展开更多
In this research,an integrated classification method based on principal component analysis-simulated annealing genetic algorithm-fuzzy cluster means(PCA-SAGA-FCM)was proposed for the unsupervised classification of tig...In this research,an integrated classification method based on principal component analysis-simulated annealing genetic algorithm-fuzzy cluster means(PCA-SAGA-FCM)was proposed for the unsupervised classification of tight sandstone reservoirs which lack the prior information and core experiments.A variety of evaluation parameters were selected,including lithology characteristic parameters,poro-permeability quality characteristic parameters,engineering quality characteristic parameters,and pore structure characteristic parameters.The PCA was used to reduce the dimension of the evaluation pa-rameters,and the low-dimensional data was used as input.The unsupervised reservoir classification of tight sandstone reservoir was carried out by the SAGA-FCM,the characteristics of reservoir at different categories were analyzed and compared with the lithological profiles.The analysis results of numerical simulation and actual logging data show that:1)compared with FCM algorithm,SAGA-FCM has stronger stability and higher accuracy;2)the proposed method can cluster the reservoir flexibly and effectively according to the degree of membership;3)the results of reservoir integrated classification match well with the lithologic profle,which demonstrates the reliability of the classification method.展开更多
Suppressed fuzzy c-means (S-FCM) clustering algorithm with the intention of combining the higher speed of hard c-means clustering algorithm and the better classification performance of fuzzy c-means clustering algorit...Suppressed fuzzy c-means (S-FCM) clustering algorithm with the intention of combining the higher speed of hard c-means clustering algorithm and the better classification performance of fuzzy c-means clustering algorithm had been studied by many researchers and applied in many fields. In the algorithm, how to select the suppressed rate is a key step. In this paper, we give a method to select the fixed suppressed rate by the structure of the data itself. The experimental results show that the proposed method is a suitable way to select the suppressed rate in suppressed fuzzy c-means clustering algorithm.展开更多
基金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.
基金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.
文摘Background Image denoising is an important topic in the digital image processing field.This study theoretically investigates the validity of the classical nonlocal mean filter(NLM)for removing Gaussian noise from a novel statistical perspective.Method By considering the restored image as an estimator of the clear image from a statistical perspective,we gradually analyze the unbiasedness and effectiveness of the restored value obtained by the NLM filter.Subsequently,we propose an improved NLM algorithm called the clustering-based NLM filter that is derived from the conditions obtained through the theoretical analysis.The proposed filter attempts to restore an ideal value using the approximately constant intensities obtained by the image clustering process.In this study,we adopt a mixed probability model on a prefiltered image to generate an estimator of the ideal clustered components.Result The experiment yields improved peak signal-to-noise ratio values and visual results upon the removal of Gaussian noise.Conclusion However,the considerable practical performance of our filter demonstrates that our method is theoretically acceptable as it can effectively estimate ideal images.
文摘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均衡的光正交频分复用系统误码率性能最好。
基金funded by the National Natural Science Foundation of China(Grant No.42177164)the Innovation-Driven Project of Central South University(Grant No.2020CX040)supported by China Scholarship Council(Grant No.202006370006)。
文摘The main purpose of blasting operation is to produce desired and optimum mean size rock fragments.Smaller or fine fragments cause the loss of ore during loading and transportation,whereas large or coarser fragments need to be further processed,which enhances production cost.Therefore,accurate prediction of rock fragmentation is crucial in blasting operations.Mean fragment size(MFS) is a crucial index that measures the goodness of blasting designs.Over the past decades,various models have been proposed to evaluate and predict blasting fragmentation.Among these models,artificial intelligence(AI)-based models are becoming more popular due to their outstanding prediction results for multiinfluential factors.In this study,support vector regression(SVR) techniques are adopted as the basic prediction tools,and five types of optimization algorithms,i.e.grid search(GS),grey wolf optimization(GWO),particle swarm optimization(PSO),genetic algorithm(GA) and salp swarm algorithm(SSA),are implemented to improve the prediction performance and optimize the hyper-parameters.The prediction model involves 19 influential factors that constitute a comprehensive blasting MFS evaluation system based on AI techniques.Among all the models,the GWO-v-SVR-based model shows the best comprehensive performance in predicting MFS in blasting operation.Three types of mathematical indices,i.e.mean square error(MSE),coefficient of determination(R^(2)) and variance accounted for(VAF),are utilized for evaluating the performance of different prediction models.The R^(2),MSE and VAF values for the training set are 0.8355,0.00138 and 80.98,respectively,whereas 0.8353,0.00348 and 82.41,respectively for the testing set.Finally,sensitivity analysis is performed to understand the influence of input parameters on MFS.It shows that the most sensitive factor in blasting MFS is the uniaxial compressive strength.
基金funded by the National Natural Science Foundation of China(42174131)the Strategic Cooperation Technology Projects of CNPC and CUPB(ZLZX2020-03).
文摘In this research,an integrated classification method based on principal component analysis-simulated annealing genetic algorithm-fuzzy cluster means(PCA-SAGA-FCM)was proposed for the unsupervised classification of tight sandstone reservoirs which lack the prior information and core experiments.A variety of evaluation parameters were selected,including lithology characteristic parameters,poro-permeability quality characteristic parameters,engineering quality characteristic parameters,and pore structure characteristic parameters.The PCA was used to reduce the dimension of the evaluation pa-rameters,and the low-dimensional data was used as input.The unsupervised reservoir classification of tight sandstone reservoir was carried out by the SAGA-FCM,the characteristics of reservoir at different categories were analyzed and compared with the lithological profiles.The analysis results of numerical simulation and actual logging data show that:1)compared with FCM algorithm,SAGA-FCM has stronger stability and higher accuracy;2)the proposed method can cluster the reservoir flexibly and effectively according to the degree of membership;3)the results of reservoir integrated classification match well with the lithologic profle,which demonstrates the reliability of the classification method.
文摘Suppressed fuzzy c-means (S-FCM) clustering algorithm with the intention of combining the higher speed of hard c-means clustering algorithm and the better classification performance of fuzzy c-means clustering algorithm had been studied by many researchers and applied in many fields. In the algorithm, how to select the suppressed rate is a key step. In this paper, we give a method to select the fixed suppressed rate by the structure of the data itself. The experimental results show that the proposed method is a suitable way to select the suppressed rate in suppressed fuzzy c-means clustering algorithm.
