Fuzzy c-means(FCM) clustering algorithm is sensitive to noise points and outlier data, and the possibilistic fuzzy c-means(PFCM) clustering algorithm overcomes the problem well, but PFCM clustering algorithm has some ...Fuzzy c-means(FCM) clustering algorithm is sensitive to noise points and outlier data, and the possibilistic fuzzy c-means(PFCM) clustering algorithm overcomes the problem well, but PFCM clustering algorithm has some problems: it is still sensitive to initial clustering centers and the clustering results are not good when the tested datasets with noise are very unequal. An improved kernel possibilistic fuzzy c-means algorithm based on invasive weed optimization(IWO-KPFCM) is proposed in this paper. This algorithm first uses invasive weed optimization(IWO) algorithm to seek the optimal solution as the initial clustering centers, and introduces kernel method to make the input data from the sample space map into the high-dimensional feature space. Then, the sample variance is introduced in the objection function to measure the compact degree of data. Finally, the improved algorithm is used to cluster data. The simulation results of the University of California-Irvine(UCI) data sets and artificial data sets show that the proposed algorithm has stronger ability to resist noise, higher cluster accuracy and faster convergence speed than the PFCM algorithm.展开更多
When the classical constant false-alarm rate （CFAR） combined with fuzzy C-means （FCM） algorithm is applied to target detection in synthetic aperture radar （SAR） images with complex background, CFAR requires bloc...When the classical constant false-alarm rate （CFAR） combined with fuzzy C-means （FCM） algorithm is applied to target detection in synthetic aperture radar （SAR） images with complex background, CFAR requires block-by-block estimation of clutter models and FCM clustering converges to local optimum. To address these problems, this paper pro-poses a new detection algorithm： knowledge-based combined with improved genetic algorithm-fuzzy C-means （GA-FCM） algorithm. Firstly, the algorithm takes target region＇s maximum and average intensity, area, length of long axis and long-to-short axis ratio of the external ellipse as factors which influence the target appearing probabil- ity. The knowledge-based detection algorithm can produce preprocess results without the need of estimation of clutter models as CFAR does. Afterward the GA-FCM algorithm is improved to cluster pre-process results. It has advantages of incorporating global optimizing ability of GA and local optimizing ability of FCM, which will further eliminate false alarms and get better results. The effectiveness of the proposed technique is experimentally validated with real SAR images.展开更多
为减少温室气体的排放,以风电为代表的清洁能源大规模接入电网。如何消纳高占比、波动剧烈的风电,成为现代电力系统所面临的重要问题。在此背景下,将多端柔性直流输电系统(VSC based multi-terminal HVDC,VSCMTDC)对功率的灵活调节能力...为减少温室气体的排放,以风电为代表的清洁能源大规模接入电网。如何消纳高占比、波动剧烈的风电,成为现代电力系统所面临的重要问题。在此背景下,将多端柔性直流输电系统(VSC based multi-terminal HVDC,VSCMTDC)对功率的灵活调节能力纳入安全约束机组组合(security-constrained unit commitment,SCUC)问题中进行调控。设计日前机组组合、短期实时调节和滚动重调节三段式配合的调度框架,并基于列与约束生成算法(column-andconstraint generation,C&CG)设计三层迭代求解方法。通过该方法解决了传统二阶段鲁棒性机组组合偏于保守的弊端,有效提高了风电消纳。为了充分利用VSC换流站能独立调节有功、无功的优势,在SCUC结果的基础上进行无功电压优化,并基于Benders分解算法进行求解,有效降低了系统网损。最后,将所提模型应用于改进IEEE 30节点系统算例,验证模型的有效性和可行性。展开更多
针对传统模糊C-均值聚类算法(FCM算法)初始聚类中心选择的随机性和距离向量公式应用的局限性,提出一种基于密度和马氏距离优化的模糊C-均值聚类算法(Fuzzy C-Means Based on Mahalanobis and Density,FCMBMD算法)。该算法通过计算样本...针对传统模糊C-均值聚类算法(FCM算法)初始聚类中心选择的随机性和距离向量公式应用的局限性,提出一种基于密度和马氏距离优化的模糊C-均值聚类算法(Fuzzy C-Means Based on Mahalanobis and Density,FCMBMD算法)。该算法通过计算样本点的密度来确定初始聚类中心,避免了初始聚类中心随机选取而产生的聚类结果的不稳定;采用马氏距离计算样本集的相似度,以满足不同度量单位数据的要求。实验结果表明,FCMBMD算法在聚类中心、收敛速度、迭代次数以及准确率等方面具有良好的效果。展开更多
文摘Fuzzy c-means(FCM) clustering algorithm is sensitive to noise points and outlier data, and the possibilistic fuzzy c-means(PFCM) clustering algorithm overcomes the problem well, but PFCM clustering algorithm has some problems: it is still sensitive to initial clustering centers and the clustering results are not good when the tested datasets with noise are very unequal. An improved kernel possibilistic fuzzy c-means algorithm based on invasive weed optimization(IWO-KPFCM) is proposed in this paper. This algorithm first uses invasive weed optimization(IWO) algorithm to seek the optimal solution as the initial clustering centers, and introduces kernel method to make the input data from the sample space map into the high-dimensional feature space. Then, the sample variance is introduced in the objection function to measure the compact degree of data. Finally, the improved algorithm is used to cluster data. The simulation results of the University of California-Irvine(UCI) data sets and artificial data sets show that the proposed algorithm has stronger ability to resist noise, higher cluster accuracy and faster convergence speed than the PFCM algorithm.
基金supported by the National Natural Science Foundation of China(6107113961171122)+1 种基金the Fundamental Research Funds for the Central Universities"New Star in Blue Sky" Program Foundation the Foundation of ATR Key Lab
文摘When the classical constant false-alarm rate （CFAR） combined with fuzzy C-means （FCM） algorithm is applied to target detection in synthetic aperture radar （SAR） images with complex background, CFAR requires block-by-block estimation of clutter models and FCM clustering converges to local optimum. To address these problems, this paper pro-poses a new detection algorithm： knowledge-based combined with improved genetic algorithm-fuzzy C-means （GA-FCM） algorithm. Firstly, the algorithm takes target region＇s maximum and average intensity, area, length of long axis and long-to-short axis ratio of the external ellipse as factors which influence the target appearing probabil- ity. The knowledge-based detection algorithm can produce preprocess results without the need of estimation of clutter models as CFAR does. Afterward the GA-FCM algorithm is improved to cluster pre-process results. It has advantages of incorporating global optimizing ability of GA and local optimizing ability of FCM, which will further eliminate false alarms and get better results. The effectiveness of the proposed technique is experimentally validated with real SAR images.
文摘随着信息技术的发展,设计越来越复杂,嵌入式存储器在SoC芯片面积中所占的比例越来越大,由于本身单元密度很高,嵌入式存储器容易造成硅片缺陷,降低了芯片的成品率.针对投影仪梯形校正项目嵌入的存储器模块存在的故障等问题,讨论了基于M arch C+算法的B IST的设计与实现,并对B IST进行改进,完成对存储器故障的检测和定位,整个测试故障覆盖率接近100%、测试时间为35.546 m s.
文摘为减少温室气体的排放,以风电为代表的清洁能源大规模接入电网。如何消纳高占比、波动剧烈的风电,成为现代电力系统所面临的重要问题。在此背景下,将多端柔性直流输电系统(VSC based multi-terminal HVDC,VSCMTDC)对功率的灵活调节能力纳入安全约束机组组合(security-constrained unit commitment,SCUC)问题中进行调控。设计日前机组组合、短期实时调节和滚动重调节三段式配合的调度框架,并基于列与约束生成算法(column-andconstraint generation,C&CG)设计三层迭代求解方法。通过该方法解决了传统二阶段鲁棒性机组组合偏于保守的弊端,有效提高了风电消纳。为了充分利用VSC换流站能独立调节有功、无功的优势,在SCUC结果的基础上进行无功电压优化,并基于Benders分解算法进行求解,有效降低了系统网损。最后,将所提模型应用于改进IEEE 30节点系统算例,验证模型的有效性和可行性。
文摘针对传统模糊C-均值聚类算法(FCM算法)初始聚类中心选择的随机性和距离向量公式应用的局限性,提出一种基于密度和马氏距离优化的模糊C-均值聚类算法(Fuzzy C-Means Based on Mahalanobis and Density,FCMBMD算法)。该算法通过计算样本点的密度来确定初始聚类中心,避免了初始聚类中心随机选取而产生的聚类结果的不稳定;采用马氏距离计算样本集的相似度,以满足不同度量单位数据的要求。实验结果表明,FCMBMD算法在聚类中心、收敛速度、迭代次数以及准确率等方面具有良好的效果。
