Validity of non-local mean filter and novel denoising method

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.

A powerful denoising method based on non-local means filter for cryo-electron microscopic 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

基于Non-Local means滤波的雾天降质图像恢复算法

针对目前去雾算法易导致边缘晕环效应、边缘轮廓及景物特征比较模糊问题,提出了一种景深等先验信息未知条件下基于Non-Local means滤波的雾天降质图像恢复算法。首先,根据大气散射模型将经典的场景深度估计转化为大气面纱以及天空亮度估计,避免难求的场景深度图;然后,对雾天降质图像进行雾气平均化预处理,经过预处理图像平均亮度变小;其次,依据大气面纱的边缘跟雾天图像的低频具有大的相似性,采用Non-Localmeans滤波算法估计大气面纱模型;最后,为了使恢复图像的亮度跟色度都更加接近晴天图像,进行防止对比度放大的平滑与色度调整处理。通过与已有实验结果对比表明,提出的算法可以获得更精确的大气面纱,恢复图像不但边缘轮廓及景物特征都比较清楚,而且可有效抑制边缘晕环效应。

Fast Non-Local Means Algorithm Based on Krawtchouk Moments

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.

Improved Non-Local Means Algorithm for Image Denoising

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.

Two Modifications of Weight Calculation of the Non-Local Means Denoising Method

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-means算法的水电厂光纤测温系统可扩展性优化

针对水电厂光纤测温系统并行扩展性和问题扩展性较差的问题,设计了基于分布式K-means算法的水电厂光纤测温系统可扩展性优化方法。根据系统真实的执行时间和能耗,计算系统通信和能耗的实际加速比,构建系统可扩展模型;利用基于分布式K-means算法的协同过滤模型分散数据集,聚合相似度高的样本数据,完成系统的可扩展性优化。实验结果表明,设计方法的性能明显优于其他方法,解决了系统并行扩展性和问题扩展性的优化问题。

基于K-means聚类的舰船通信网络异常数据检测

为了解决海上通信环境中的干扰和传输问题,提升舰船通信网络通信质量和可靠性,提出基于K-means聚类的舰船通信网络异常数据检测方法。构建舰船通信网络通信多径信道模型,利用该模型获取舰船通信网络数据。使用基于超窄带滤波的舰船通信网络数据滤波处理方法去除舰船通信网络数据内的干扰噪声,将无噪声的舰船通信网络数据作为输入,使用K-means聚类算法输出舰船通信网络异常数据检测结果。结果表明,该方法采集舰船通信网络数据较为准确,并可有效去除数据内含有的干扰噪声,降低舰船通信网络数据幅值区间,同时可用聚类方式准确检测舰船通信网络异常数据,应用效果较为显著。

Vibration Suppression for Active Magnetic Bearings Using Adaptive Filter with Iterative Search Algorithm

Active Magnetic Bearing(AMB) is a kind of electromagnetic support that makes the rotor movement frictionless and can suppress rotor vibration by controlling the magnetic force. The most common approach to restrain the rotor vibration in AMBs is to adopt a notch filter or adaptive filter in the AMB controller. However, these methods cannot obtain the precise amplitude and phase of the compensation current. Thus, they are not so effective in terms of suppressing the vibrations of the fundamental and other harmonic orders over the whole speed range. To improve the vibration suppression performance of AMBs,an adaptive filter based on Least Mean Square(LMS) is applied to extract the vibration signals from the rotor displacement signal. An Iterative Search Algorithm(ISA) is proposed in this paper to obtain the corresponding relationship between the compensation current and vibration signals. The ISA is responsible for searching the compensating amplitude and shifting phase online for the LMS filter, enabling the AMB controller to generate the corresponding compensation force for vibration suppression. The results of ISA are recorded to suppress vibration using the Look-Up Table(LUT) in variable speed range. Comprehensive simulations and experimental validations are carried out in fixed and variable speed range, and the results demonstrate that by employing the ISA, vibrations of the fundamental and other harmonic orders are suppressed effectively.

面向大型数据集的局部敏感哈希K−means算法

大型数据集高效处理策略是煤矿安全监测智能化、采掘智能化等煤矿智能化建设的关键支撑。针对K−means算法面对大型数据集时聚类高效性及准确性不足的问题,提出了一种基于局部敏感哈希(LSH)的高效K−means聚类算法。基于LSH对抽样过程进行优化,提出了数据组构建算法LSH−G,将大型数据集合理划分为子数据组,并对数据集中的噪声点进行有效删除;基于LSH−G算法优化密度偏差抽样(DBS)算法中的子数据组划分过程,提出了数据组抽样算法LSH−GD,使样本集能更真实地反映原始数据集的分布规律;在此基础上,通过K−means算法对生成的样本集进行聚类,实现较低时间复杂度情况下从大型数据集中高效挖掘有效数据。实验结果表明:由10个AND操作与8个OR操作组成的级联组合为最优级联组合,得到的类中心误差平方和(SSEC)最小;在人工数据集上,与基于多层随机抽样(M−SRS)的K−means算法、基于DBS的K−means算法及基于网格密度偏差抽样(G−DBS)的K−means算法相比,基于LSH−GD的K−means算法在聚类准确性方面的平均提升幅度分别为56.63%、54.59%及25.34%,在聚类高效性方面的平均提升幅度分别为27.26%、16.81%及7.07%;在UCI标准数据集上,基于LSH−GD的K−means聚类算法获得的SSEC与CPU消耗时间(CPU−C)均为最优。

基于红蓝色差和改进K-means算法的航拍绝缘子分类识别方法

绝缘子作为输电线路中最重要的基础设施之一,对其准确识别是实现输电线路运行状态的自行监测与故障诊断的重要前提。为了能够对无人机航拍巡检中的绝缘子进行准确识别,提出基于红蓝色差和改进K-means算法的航拍绝缘子分类识别方法。首先,结合红蓝色差灰度化和加权灰度化,采用改进K-means算法对灰度图像进行聚类分割;其次,通过形态学滤波弥补分割缺陷;最后,根据绝缘子目标区域的红蓝色差均值,将绝缘子的分类问题简化为一维数据分类问题,从而实现分类识别。实验结果表明,该方法对复杂背景及不同拍摄角度下的绝缘子均能快速进行准确的分类识别,总识别率可达94.4%,为无人机巡检中输电线路绝缘子的分类识别提供了新的思路。

基于改进的加权中值滤波与K-means聚类的织物缺陷检测

为检测纹理织物在生产过程中产生的各种疵点,提出一种基于改进的加权中值滤波与K-means聚类相结合的纹理织物疵点检测方法。首先利用改进的加权中值滤波对纹理织物图像进行预处理,以减少纹理信息对疵点检测产生的影响,同时通过联合直方图动态数据分配权重和像素,减少寻求中位数的时间来有效地缩短检测时间,提高了执行速度;然后采用K-means算法对滤波后的织物图像进行聚类,计算织物图像疵点和非疵点的聚类中心,进而实现图像疵点区域的分割。实验结果表明,该方法可有效地检测出方格、点形、星形、平纹、斜纹等多类型纹理织物的疵点,并显著提高检测速度。

采用密度k-means和改进双边滤波的点云自适应去噪算法

采用相移结构光测量系统得到的三维点云,不可避免存在噪声。通过密度k均值(k-means)聚类算法将点云分为大尺度噪声点和小尺度噪声点,设定邻域大小以及点的数量来去除孤立噪声点;使用类内距离和类间距离的比值作为评价函数,得到最佳聚类数去除小片噪声点云;对于混杂在真实点云中的小尺度噪声点,采用鲁棒性更强的改进型双边滤波器进行点云光顺。实验验证表明:采用基于密度k-means和改进双边滤波结合的点云去噪算法可以有效去除各类噪声点,保持点云特征,相比平均曲率算法和基于特征选择的双边滤波算法,去噪效率分别提高了24%和16%。

集成k-means聚类和有监督特征选择的混合式协同过滤推荐

为了提高协同过滤推荐质量,提出了集成k-means聚类和有监督特征选择的混合式协同过滤推荐框架和KDICF算法。利用有监督特征选择的方法和技术,找出与待预测项目强相关的项目集,将高维稀疏的用户-项目评分数据集转为低维用户-项目评分数据集,并运用k-means聚类,在此基础上寻找近邻用户对目标用户未评分项目进行评分预测。实验结果表明,混合式KDICF算法有着优异的性能。

基于小波变换和K-means的非结构化道路检测

道路检测是智能交通视觉系统的一个重要组成部分,为提高复杂环境下非结构化道路检测的实时性、准确性和鲁棒性,提出一种新的道路检测方法。该方法利用高斯金字塔对图像进行降采样,压缩图像数据信息,对图像进行双边滤波,抑制噪声,采用基于小波变换求模极大值的方法对滤波后的图像提取边缘,通过阈值法去除非道路边缘点,给出基于斜率和截距的K-means聚类算法,实现道路方程拟合。实验结果表明,与传统最小二乘法相比,该方法能在道路场景较为复杂的情况下更准确地实现非结构化道路检测,并提高实时性。

一种结合有效降维和K-means聚类的协同过滤推荐模型

为了克服"维灾"所带来的问题,提出一种基于主成分分析的维数约简方法,并在转换后的低维向量空间上进行K-means聚类算法,以减少目标用户的最近邻搜索范围,代替在超高维空间上逐一寻找最近邻的过程。实验结果证明了新算法的有效性,特别在目标用户的历史评价信息较少的情况下,也能有较好的预测精度。

基于局部优化奇异值分解和K-means聚类的协同过滤算法

为了克服传统协同过滤(CF)推荐方法数据稀疏和可扩展性差的不足,该文提出1种基于局部优化降维和聚类的协同过滤算法。采用局部优化的奇异值分解(SVD)降维技术和K-均值(K-means)聚类技术对用户-项目评分矩阵中的相似用户进行聚类并降低维度。利用近似差分矩阵表示评分矩阵的局部结构,实现局部优化。局部优化的SVD降维技术可以利用更少的迭代次数缓解CF中数据稀疏和算法可扩展性差的问题。K-means聚类技术可以缩小邻居集查找范围,提高推荐速度。将该文算法与基于Pearson相关系数的协同过滤算法、基于SVD的协同过滤算法、基于K-means聚类的协同过滤算法相比较。在MovieLens数据集上的实验结果表明,该算法的平均绝对误差(MAE)较其他算法降低了大约12%,准确性(Precision)提高了7%。

基于K-means和SVM的蓝牙室内定位算法

为了克服指纹定位过程中,由于信号不稳定所造成的定位精确不高,指纹漂移等问题,利用卡尔曼滤波对采集的蓝牙接收信号强度(RSS)数据进行预处理,并通过K-means算法对数据进行初始聚类;计算待测数据与各聚类中心的距离,将与待测数据临近的类簇数据进行融合。针对融合形成的新数据子集,训练出对应的支持向量机(SVM)模型,并完成待测数据的分类。经过测试,结果表明:算法的定位精度稳定在1. 5m以内,达到预期目标。

基于NL-Means的均值平移图像分割算法

针对均值平移图象分割算法中,在密度中心点选择时的不足,本文采用一种新的寻找密度中心点的方法,同时,为了克服传统基于特征空间分析的图像分割方法对像素点空间关系考虑不够充分的缺陷,通过Non-local means算法,在距离公式中引入特征权参数,从而优化聚类效果。对图象分割结果分析表明了这种方法的有效性。

基于统计相关性与K-means的区分基因子集选择算法

针对高维小样本癌症基因数据集的有效区分基因子集选择难题,提出基于统计相关性和K-means的新颖混合基因选择算法实现有效区分基因子集选择.算法首先采用Pearson相关系数和Wilcoxon秩和检验计算各基因与类标的相关性,根据统计相关性原则选取与类标相关性较大的若干基因构成预选择基因子集;然后,采用K-means算法将预选择基因子集中高度相关的基因聚集到同一类簇,训练SVM分类模型,计算每一个基因的权重,从每一类簇选择一个权重最大或者采用轮盘赌思想从每一类簇选择一个得票数最多的基因作为本类簇的代表基因,各类簇的代表基因构成有效区分基因子集.将该算法与采用随机策略选择各类簇代表基因的随机基因选择算法Random,Guyon的经典基因选择算法SVM-RFE、采用顺序前向搜索策略的基因选择算法SVM-SFS进行实验比较,几个经典基因数据集上的200次重复实验的平均实验结果表明:所提出的混合基因选择算法能够选择到区分性能非常好的基因子集,建立在该区分基因子集上的分类器具有非常好的分类性能.