基于改进蝙蝠优化自确定的模糊C-均值聚类算法

针对模糊C-均值聚类算法敏感于初始聚类中心及聚类收敛慢、聚类数目手动设定等缺陷,提出了基于改进蝙蝠优化自确定的模糊C-均值聚类算法。该算法是基于密度峰值综合衡量聚类中心外围数据密集程度和聚类中心间距离,自动确定聚类中心和聚类数目,以此作为改进蝙蝠算法的初始中心;在原始蝙蝠算法中引入Levy飞行特征加强算法跳出局部最优能力;使用Powell局部搜索加快算法的收敛,利用改进的蝙蝠种群进行种群寻优,并将最优蝙蝠位置作为聚类C-均值新聚类中心,进行模糊聚类,以此循环交叉迭代多次最终获得聚类结果。将基于改进蝙蝠优化自确定的模糊C-均值聚类算法与其它两种聚类算法在标准数据集上进行仿真对比,实验结果表明:与其它两种算法相比,该算法收敛速度快、误差率低。     

无线传感器网络中LEACH协议的节能改进算法

分析了低功耗自适应分簇路由协议(LEACH)算法,对算法中簇头选举数目的随机性做了改进并且在簇头选举时加入了对节点剩余能量的考虑,同时提出采用欧式平面上两条曲线交叉概率很大的思想,在簇头与基站之间建立多跳链路,从而解决了原协议中簇头与基站单跳通信能量消耗过大的问题.性能分析和仿真实验表明:改进的协议有效均衡了节点能耗,提高了网络寿命.     

激光点云中散乱电子元器件分割方法

目的 针对散乱电子元器件计数过程中电子元器件分割困难的问题,提出一种基于点云簇平均法线夹角、平均点云密度边缘提取和区域生长阈值自适应的散乱电子元器件分割方法。方法 通过体素化处理、RANSAC算法和统计离群滤波算法对原始点云数据进行预处理,去除大量无关点云;使用欧式聚类算法对预处理结果粗分割得到电子元器件点云簇,以点云簇为阈值设置单元,避免阈值设置不合理的情况;通常边缘点较非边缘点法线夹角更大、邻域点更少,提出通过点云簇平均法线夹角和平均点云密度自适应约束来去除点云簇中边缘点的方法;对去边缘点后的点云簇细分割,根据细分割后点云簇的平均法线夹角进行区域生长阈值的自适应选择,通过改进的区域生长算法将每个电子元器件从点云簇中分割出来。结果 实验结果证明,文中方法分割正确率达97%以上,每10个目标分割耗时约345 ms。结论 提出的方法具有良好的准确性和实用性,分割效果优于传统分割算法,能够准确地将每个电子元器件从复杂场景中分割出来。     

Multiple Kernel Clustering Based on Self-Weighted Local Kernel Alignment

Multiple kernel clustering based on local kernel alignment has achieved outstanding clustering performance by applying local kernel alignment on each sample. However, we observe that most of existing works usually assume that each local kernel alignment has the equal contribution to clustering performance, while local kernel alignment on different sample actually has different contribution to clustering performance. Therefore this assumption could have a negative effective on clustering performance. To solve this issue, we design a multiple kernel clustering algorithm based on self-weighted local kernel alignment, which can learn a proper weight to clustering performance for each local kernel alignment. Specifically, we introduce a new optimization variable- weight-to denote the contribution of each local kernel alignment to clustering performance, and then, weight, kernel combination coefficients and cluster membership are alternately optimized under kernel alignment frame. In addition, we develop a three-step alternate iterative optimization algorithm to address the resultant optimization problem. Broad experiments on five benchmark data sets have been put into effect to evaluate the clustering performance of the proposed algorithm. The experimental results distinctly demonstrate that the proposed algorithm outperforms the typical multiple kernel clustering algorithms, which illustrates the effectiveness of the proposed algorithm.     

基于车载16线激光雷达的障碍物检测方法

针对目前车载16线激光雷达点云数据中障碍物检测算法准确率不高的问题,提出了一种基于自适应网格聚类的障碍物检测方法。首先,结合八叉树与随机抽样一致性算法(RANSAC)去除地面点;其次,投影点云至二维网格,依据各网格高程信息快速提取高结构物;然后,建立两级网格模型,按照粗网格聚类结果的分布信息自适应地确定子网格分辨率,对可能包含多目标的障碍物在子网格层进行准确检测;最后,结合相邻时刻障碍物的状态信息修正检测结果。在16线激光雷达城市道路环境测试集下的实验结果表明:该算法可准确检测行驶区域内障碍物目标,优化后的聚类算法较好地降低了欠分割与过分割错误率,检测准确率达91%。     

A Phase I Cluster‐Based Method for Analyzing Nonparametric Profiles

A cluster‐based method has been used successfully to analyze parametric profiles in Phase I of the profile monitoring process. Performance advantages have been demonstrated when using a cluster‐based method of analyzing parametric profiles over a non‐cluster based method with respect to more accurate estimates of the parameters and improved classification performance criteria. However, it is known that, in many cases, profiles can be better represented using a nonparametric method. In this study, we use the cluster‐based method to analyze profiles that cannot be easily represented by a parametric function. The similarity matrix used during the clustering phase is based on the fits of the individual profiles with p‐spline regression. The clustering phase will determine an initial main cluster set that contains greater than half of the total profiles in the historical data set. The profiles with in‐control T² statistics are sequentially added to the initial main cluster set, and upon completion of the algorithm, the profiles in the main cluster set are classified as the in‐control profiles and the profiles not in the main cluster set are classified as out‐of‐control profiles. A Monte Carlo study demonstrates that the cluster‐based method results in superior performance over a non‐cluster based method with respect to better classification and higher power in detecting out‐of‐control profiles. Also, our Monte Carlo study shows that the cluster‐based method has better performance than a non‐cluster based method whether the model is correctly specified or not. We illustrate the use of our method with data from the automotive industry. Copyright © 2014 John Wiley & Sons, Ltd.     

A New Database Intrusion Detection Approach Based on Hybrid Meta-Heuristics

A new secured database management system architecture using intrusion detection systems (IDS) is proposed in this paper for organizations with no previous role mapping for users. A simple representation of Structured Query Language queries is proposed to easily permit the use of the worked clustering algorithm. A new clustering algorithm that uses a tube search with adaptive memory is applied to database log files to create users’ profiles. Then, queries issued for each user are checked against the related user profile using a classifier to determine whether or not each query is malicious. The IDS will stop query execution or report the threat to the responsible person if the query is malicious. A simple classifier based on the Euclidean distance is used and the issued query is transformed to the proposed simple representation using a classifier, where the Euclidean distance between the centers and the profile’s issued query is calculated. A synthetic data set is used for our experimental evaluations. Normal user access behavior in relation to the database is modelled using the data set. The false negative (FN) and false positive (FP) rates are used to compare our proposed algorithm with other methods. The experimental results indicate that our proposed method results in very small FN and FP rates.     

一种改进的势函数聚类多阈值图像分割算法

针对基于势函数聚类的多阈值图像分割算法的不足,定义了伪势的概念,并在原算法基础上提出了一种改进的图像分割算法。由伪势概念确定了伪势合并的判别方法,按照此方法,当相邻的两个峰之间的距离小于所定义的自适应模糊伪势因子时,则应该进行伪势合并。改进后的算法在计算剩余势函数时判断是否存在伪势,然后在势划分函数组的确定过程中相应地进行伪势合并计算。利用多幅图像进行了多阈值分割的仿真试验,结果表明,改进的基于势函数的多阈值图像分割算法具有更好的鲁棒性和分割效果。     

An improved method using factor division algorithm for reducing the order of linear dynamical system

An improved method is proposed to determine the reduced order model of large scale linear time invariant system. The dominant poles of the low order system are calculated by clustering method. The selection of pole to the cluster point is based on the contributions of each pole in redefining time moment and redefining Markov parameters. The coefficients of the numerator polynomial for reduced model are obtained using a factor division algorithm. This method is computationally efficient and keeps up the stability and input output characteristic of the original arrangement.     

基于失衡样本特性过采样算法与SVM的滚动轴承故障诊断

针对传统支持向量机(SVM)算法在滚动轴承故障诊断领域中,对失衡数据集效果不佳、对噪声敏感以及对本身参数依赖较大等缺点,提出一种基于样本特性的过采样算法(OABSC)。该算法利用改进凝聚层次聚类将故障样本分成多个簇;在每个簇中综合考虑样本距离、近邻域密度对"疑似噪声点"进行识别、剔除,并将剩余样本按信息量进行排序;紧接着,在每个簇中采用K^*-信息量近邻域(K^*INN)过采样算法合成新样本,以使得数据集平衡;模拟3种不同失衡比下的轴承故障情况,并采用粒子群算法优化了SVM分类器的参数。经试验证明:相比已有算法,OABSC算法能更好地适用于数据呈多簇分布且失衡的轴承故障诊断领域,拥有更高的G-mean值与AUC值以及更强的算法鲁棒性。     

Denoising and segmentation of MR images using fourth order non-linear adaptive PDE and new convergent clustering

At present, digital image processing plays a vital role in medical imaging areas and specifically in magnetic resonance imaging (MRI) of brain images such as axial and coronal sections. This article mainly focused on the MRI brain images. The existing methods such as total variation (MC), parallel MRI, modified pyramidal dual-tree direction filter, adaptive dictionary selection algorithm, classifier methods, and fuzzy clustering techniques are poor in image eminence and precision. Thus, this article presents a novel approach consisting of denoising followed by segmentation. The objective of these proposed methods was visual eminence improvement of medical images to examine tumor extent using an adaptive partial differential equation (APDE)-based analysis with soft threshold function in denoising. The fourth order, nonlinear APDE was used to denoise the image depending on gradient and Laplacian operators associated with the new adaptive Haar-type wavelet transform. A second approach was the new convergent K-means clustering for segmentation. The convergent K-means procedure diminishes the summation of the squared deviations of structures in a cluster from the center. The significance of these proposed methods was to compute their performances in terms of mean squared error, peak signal-to-noise ratio, structure similarity, segmentation accuracy, false hit, missed-term, and elapsed time. The results were analyzed with the MATLAB software.     

自适应聚类Hough变换及地震断层检测

针对现有基于Hough变换的地震断层检测方法只能检测单个断层,不能准确检测多个断层的不足,提出了一种基于自适应聚类Hough变换的地震断层检测方法。该方法首先对预处理后的地震相干图像进行边缘检测并对边缘图像进行Hough变换以检测出边缘图像中的线段,然后根据倾斜角和位置信息对线段进行自适应聚类以获得更完整的线段,最后根据初始地震图像对完整线段中的各点进行调整以获得准确、平滑的断层。为验证该方法的有效性,在实际地震图像上进行了对比实验。实验结果表明,该方法可正确检测地震图像中的多个断层,正确率达到90%以上,与现有方法相比,峰值信噪比提高了约10%。     

HREF: a highest remaining energy first adaptive clustering algorithm for wireless sensor/mesh networks

A simple mechanism to prolong the life cycle of the network by balancing nodes’ energy consumption is to rotate the active dominating set (DS) through a set of legitimate DSs. This paper proposes a novel adaptive clustering algorithm named HREF (Highest Remaining Energy First). In the HREF algorithm, cluster formation is performed cyclically and each node can declare itself as a cluster head autonomously if it has the largest residual energy among all its adjacent nodes. The performance effectiveness of the HREF algorithm is investigated and compared to the D-WCDS (Disjoint Weakly Connected Dominating Set) algorithm. In this paper, we assume the network topology is fixed and does not require sensor mobility. This allows us to focus on the impact of clustering algorithms on communication between network nodes rather than with the base station. Simulation results show that in the D-WCDS algorithm energy depletion is more severe and the variance of the node residual energy is also much larger than that in the HREF algorithm. That is, nodes’ energy consumption in the HREF algorithm is in general more evenly distributed among all network nodes. This may be regarded as the main advantage of the HREF adaptive clustering algorithm.     

基于层次的K-means初始化算法

K-means算法是一种常用的聚类算法,但是聚类中心的初始化是其中的一个难点。笔者提出了一个基于层次思想的初始化方法。一般聚类问题均可看作加权聚类,通过层层抽样减少数据量,然后采用自顶向下的方式,从抽样结束层到原始数据层,每层都进行聚类,其中每层初始聚类中心均通过对上层聚类中心进行换算得到,重复该过程直到原始数据层,可得原始数据层的初始聚类中心。模拟数据和真实数据的实验结果均显示基于层次抽样初始化的K-means算法不仅收敛速度快、聚类质量高,而且对噪声不敏感,其性能明显优于现有的相关算法。     

基于KHM聚类算法的跳频信号分选

针对跳频信号分选,主要研究了聚类算法及利用直方图来预估计聚类数目及初始中心的方法.首先对直方图方法进行改进,得到了对跳频信号参数估计值误差不敏感的方法,其次对初始化中心不敏感的KHM聚类算法进行改进并聚类,最后提出了通过定义类内距类间距的方法来确定最佳聚类数的算法.通过改进的KHM算法和估计聚类个数方法,利用跳频信号参...     

彩色目标高维检测与空间分集检测技术

提出一种彩色目标高维检测和空间分集检测技术,它利用 RGB 颜色的均值趋同性校正色偏,减少光照强度和光源颜色对目标检测的影响;采用检测门限自适应变化的彩色目标高维检测算法检测出疑似目标,进一步避免了传统方法受环境光照影响大的缺点;使用基于区域关联性的彩色信号自适应空间分集检测技术,提高目标检测效果。试验证明,检测并降噪以后,97.5%以上的图像的提取结果可以达到 30db 以上的信噪比。     

自适应局部独立分量分析

提出一种自适应局部独立分量分析降噪算法。该算法先将一维时间序列重构到高维相空间,用聚集模糊K均值聚类和聚类评价函数求取高维数据集的聚类个数和聚类中心位置,然后利用K均值聚类寻找局部投影区间,对每个聚类进行独立分量分析并投影到低维空间,将低维空间数据排列并重构成一维时间序列。与使用聚类的局部独立分量分析相比,该算法具有自适应性和稳定性。使用数值仿真试验和齿轮故障信号对该算法进行验证,结果表明该算法对此类信号具有良好的降噪效果。     

基于视觉原理的密度聚类算法

在模式识别、图像处理、聚类分析等领域,人的眼睛具有快速有效地组织并发现物体内部结构的自然能力,本文就是在模拟人类视觉系统这一功能的基础上,结合基于密度的聚类方法提出了一种新的聚类算法,该算法具有对初始化参数不敏感、能发现任意形状的聚类及能找到最优聚类等优点。     

修正自适应格型陷波器及其应用

提出了一种频率响应非对称的修正自适应格型陷波器(improved adaptive lattice notch filter,I-ALNF),并且提出一种新的自适应格型递推算法。将陷波器传递函数零极点部分同时引入到自适应调整算法中,使陷波器具有更好的特性。该陷波器应用于语音信号处理,根据其反射系数推导出自适应陷波频率,可以较容易的检测到语音声门闭合时刻(glottal closure instant,GCI)的位置。     

Improving the Detection Rate of Rarely Appearing Intrusions in Network-Based Intrusion Detection Systems

In network-based intrusion detection practices, there are more regular instances than intrusion instances. Because there is always a statistical imbalance in the instances, it is difficult to train the intrusion detection system effectively. In this work, we compare intrusion detection performance by increasing the rarely appearing instances rather than by eliminating the frequently appearing duplicate instances. Our technique mitigates the statistical imbalance in these instances. We also carried out an experiment on the training model by increasing the instances, thereby increasing the attack instances step by step up to 13 levels. The experiments included not only known attacks, but also unknown new intrusions. The results are compared with the existing studies from the literature, and show an improvement in accuracy, sensitivity, and specificity over previous studies. The detection rates for the remote-to-user (R2L) and user-to-root (U2L) categories are improved significantly by adding fewer instances. The detection of many intrusions is increased from a very low to a very high detection rate. The detection of newer attacks that had not been used in training improved from 9% to 12%. This study has practical applications in network administration to protect from known and unknown attacks. If network administrators are running out of instances for some attacks, they can increase the number of instances with rarely appearing instances, thereby improving the detection of both known and unknown new attacks.