A quick and accurate extraction of dominant colors of background images is the basis of adaptive camouflage design.This paper proposes a Color Image Quick Fuzzy C-Means(CIQFCM)clustering algorithm based on clustering ...A quick and accurate extraction of dominant colors of background images is the basis of adaptive camouflage design.This paper proposes a Color Image Quick Fuzzy C-Means(CIQFCM)clustering algorithm based on clustering spatial mapping.First,the clustering sample space was mapped from the image pixels to the quantized color space,and several methods were adopted to compress the amount of clustering samples.Then,an improved pedigree clustering algorithm was applied to obtain the initial class centers.Finally,CIQFCM clustering algorithm was used for quick extraction of dominant colors of background image.After theoretical analysis of the effect and efficiency of the CIQFCM algorithm,several experiments were carried out to discuss the selection of proper quantization intervals and to verify the effect and efficiency of the CIQFCM algorithm.The results indicated that the value of quantization intervals should be set to 4,and the proposed algorithm could improve the clustering efficiency while maintaining the clustering effect.In addition,as the image size increased from 128×128 to 1024×1024,the efficiency improvement of CIQFCM algorithm was increased from 6.44 times to 36.42 times,which demonstrated the significant advantage of CIQFCM algorithm in dominant colors extraction of large-size images.展开更多
Due to the complicated background of objectives and speckle noise, it is almost impossible to extract roads directly from original synthetic aperture radar(SAR) images. A method is proposed for extraction of road netw...Due to the complicated background of objectives and speckle noise, it is almost impossible to extract roads directly from original synthetic aperture radar(SAR) images. A method is proposed for extraction of road network from high-resolution SAR image. Firstly, fuzzy C means is used to classify the filtered SAR image unsupervisedly, and the road pixels are isolated from the image to simplify the extraction of road network. Secondly, according to the features of roads and the membership of pixels to roads, a road model is constructed, which can reduce the extraction of road network to searching globally optimization continuous curves which pass some seed points. Finally, regarding the curves as individuals and coding a chromosome using integer code of variance relative to coordinates, the genetic operations are used to search global optimization roads. The experimental results show that the algorithm can effectively extract road network from high-resolution SAR images.展开更多
Feature extraction of range images provided by ranging sensor is a key issue of pattern recognition. To automatically extract the environmental feature sensed by a 2D ranging sensor laser scanner, an improved method b...Feature extraction of range images provided by ranging sensor is a key issue of pattern recognition. To automatically extract the environmental feature sensed by a 2D ranging sensor laser scanner, an improved method based on genetic clustering VGA-clustering is presented. By integrating the spatial neighbouring information of range data into fuzzy clustering algorithm, a weighted fuzzy clustering algorithm （WFCA） instead of standard clustering algorithm is introduced to realize feature extraction of laser scanner. Aimed at the unknown clustering number in advance, several validation index functions are used to estimate the validity of different clustering algorithms and one validation index is selected as the fitness function of genetic algorithm so as to determine the accurate clustering number automatically. At the same time, an improved genetic algorithm IVGA on the basis of VGA is proposed to solve the local optimum of clustering algorithm, which is implemented by increasing the population diversity and improving the genetic operators of elitist rule to enhance the local search capacity and to quicken the convergence speed. By the comparison with other algorithms, the effectiveness of the algorithm introduced is demonstrated.展开更多
As the first step of service restoration of distribution system,rapid fault diagnosis is a significant task for reducing power outage time,decreasing outage loss,and subsequently improving service reliability and safe...As the first step of service restoration of distribution system,rapid fault diagnosis is a significant task for reducing power outage time,decreasing outage loss,and subsequently improving service reliability and safety.This paper analyzes a fault diagnosis approach by using rough set theory in which how to reduce decision table of data set is a main calculation intensive task.Aiming at this reduction problem,a heuristic reduction algorithm based on attribution length and frequency is proposed.At the same time,the corresponding value reduction method is proposed in order to fulfill the reduction and diagnosis rules extraction.Meanwhile,a Euclid matching method is introduced to solve confliction problems among the extracted rules when some information is lacking.Principal of the whole algorithm is clear and diagnostic rules distilled from the reduction are concise.Moreover,it needs less calculation towards specific discernibility matrix,and thus avoids the corresponding NP hard problem.The whole process is realized by MATLAB programming.A simulation example shows that the method has a fast calculation speed,and the extracted rules can reflect the characteristic of fault with a concise form.The rule database,formed by different reduction of decision table,can diagnose single fault and multi-faults efficiently,and give satisfied results even when the existed information is incomplete.The proposed method has good error-tolerate capability and the potential for on-line fault diagnosis.展开更多
In order to make full use of the driver’s long-term driving experience in the process of perception, interaction and vehicle control of road traffic information, a driving behavior rule extraction algorithm based on ...In order to make full use of the driver’s long-term driving experience in the process of perception, interaction and vehicle control of road traffic information, a driving behavior rule extraction algorithm based on artificial neural network interface(ANNI) and its integration is proposed. Firstly, based on the cognitive learning theory, the cognitive driving behavior model is established, and then the cognitive driving behavior is described and analyzed. Next, based on ANNI, the model and the rule extraction algorithm(ANNI-REA) are designed to explain not only the driving behavior but also the non-sequence. Rules have high fidelity and safety during driving without discretizing continuous input variables. The experimental results on the UCI standard data set and on the self-built driving behavior data set, show that the method is about 0.4% more accurate and about 10% less complex than the common C4.5-REA, Neuro-Rule and REFNE. Further, simulation experiments verify the correctness of the extracted driving rules and the effectiveness of the extraction based on cognitive driving behavior rules. In general, the several driving rules extracted fully reflect the execution mechanism of sequential activity of driving comprehensive cognition, which is of great significance for the traffic of mixed traffic flow under the network of vehicles and future research on unmanned driving.展开更多
针对目前视频拼接技术中的主要问题,即SURF(Speed Up Robust Features)特征提取算法与FLANN(Fast Library or Approximate Nearest Neighbors)特征匹配算法在综采工作面恶劣环境中存在特征点误提取和特征点匹配正确率低的问题,提出一种...针对目前视频拼接技术中的主要问题,即SURF(Speed Up Robust Features)特征提取算法与FLANN(Fast Library or Approximate Nearest Neighbors)特征匹配算法在综采工作面恶劣环境中存在特征点误提取和特征点匹配正确率低的问题,提出一种改进SURF-FLANN的综采工作面视频拼接特征提取与匹配算法。为了提高特征点提取正确率,该方法通过将传统的高斯滤波换为更为先进的双边滤波提取图像中的SURF关键特征点,同时在特征向量中引入特征点4-领域内的特征点描述符信息,从而改进了描述符算子,进一步提高了特征点的描述能力。为了提升特征点匹配速度,提出了R-FLANN(Random Sample Consensus-Fast Library or Approximate Nearest Neighbors)特征匹配算法,该算法利用RANSAC算法获取特征点的匹配先验信息剔除无匹配、误匹配的特征点,从而提高特征点匹配速度。为了验证改进效果,通过消融试验验证了改进SURF-FLANN的特征提取与匹配算法有效提升综采工作面视频图像特征提取和匹配正确率。通过本文方法与SIFT+FLANN,Hairrs与SURF+FLANN的特征提取与匹配算法进行特征点提取与匹配的对比试验,结果表明本文方法特征提取与匹配平均正确率和平均匹配速度最高,分别达到了81.47%和51.47帧/s。通过运用本文方法与SIFT+FLANN,Hairrs与SURF+FLANN的特征提取与匹配算法进行视频图像拼接对比试验,结果表明本文提出的方法在拼接效果清晰度、对比度、熵、拼接速率指标都最好,得到了最佳效果。展开更多
局部线性嵌入算法采用欧氏距离选择邻域点,这通常会损失数据集本身的非线性特征,造成邻域点选取错误,且仅使用欧氏距离构造权重会导致信息挖掘不充分。针对以上问题,提出基于概率模型与信息熵的局部线性嵌入算法(Probability informatio...局部线性嵌入算法采用欧氏距离选择邻域点,这通常会损失数据集本身的非线性特征,造成邻域点选取错误,且仅使用欧氏距离构造权重会导致信息挖掘不充分。针对以上问题,提出基于概率模型与信息熵的局部线性嵌入算法(Probability information entropy-LLE,PIE-LLE)。首先,为了使邻域点选择更加合理,从数据集的概率分布角度出发,考虑样本点及其邻域的概率分布,为样本点构造符合局部分布的邻域集合。其次,为了充分提取样本的局部结构信息,在权重构造阶段,分别计算样本所属邻域概率以及每个样本的信息熵,融合二者信息重构低维样本。最后,在两个轴承故障数据集上的实验表明,所提方法故障识别准确度最高达到了100%,高于其他对比算法;在邻域点个数5~15范围内,PIE-LLE算法展现出良好的低维可视化效果;在参数敏感性实验中,该算法可以保持Fisher指标较大,有效提高了算法的分类准确度和稳定性。展开更多
文摘A quick and accurate extraction of dominant colors of background images is the basis of adaptive camouflage design.This paper proposes a Color Image Quick Fuzzy C-Means(CIQFCM)clustering algorithm based on clustering spatial mapping.First,the clustering sample space was mapped from the image pixels to the quantized color space,and several methods were adopted to compress the amount of clustering samples.Then,an improved pedigree clustering algorithm was applied to obtain the initial class centers.Finally,CIQFCM clustering algorithm was used for quick extraction of dominant colors of background image.After theoretical analysis of the effect and efficiency of the CIQFCM algorithm,several experiments were carried out to discuss the selection of proper quantization intervals and to verify the effect and efficiency of the CIQFCM algorithm.The results indicated that the value of quantization intervals should be set to 4,and the proposed algorithm could improve the clustering efficiency while maintaining the clustering effect.In addition,as the image size increased from 128×128 to 1024×1024,the efficiency improvement of CIQFCM algorithm was increased from 6.44 times to 36.42 times,which demonstrated the significant advantage of CIQFCM algorithm in dominant colors extraction of large-size images.
文摘Due to the complicated background of objectives and speckle noise, it is almost impossible to extract roads directly from original synthetic aperture radar(SAR) images. A method is proposed for extraction of road network from high-resolution SAR image. Firstly, fuzzy C means is used to classify the filtered SAR image unsupervisedly, and the road pixels are isolated from the image to simplify the extraction of road network. Secondly, according to the features of roads and the membership of pixels to roads, a road model is constructed, which can reduce the extraction of road network to searching globally optimization continuous curves which pass some seed points. Finally, regarding the curves as individuals and coding a chromosome using integer code of variance relative to coordinates, the genetic operations are used to search global optimization roads. The experimental results show that the algorithm can effectively extract road network from high-resolution SAR images.
基金the National Natural Science Foundation of China (60234030)the Natural Science Foundationof He’nan Educational Committee of China (2007520019, 2008B520015)Doctoral Foundation of Henan Polytechnic Universityof China (B050901, B2008-61)
文摘Feature extraction of range images provided by ranging sensor is a key issue of pattern recognition. To automatically extract the environmental feature sensed by a 2D ranging sensor laser scanner, an improved method based on genetic clustering VGA-clustering is presented. By integrating the spatial neighbouring information of range data into fuzzy clustering algorithm, a weighted fuzzy clustering algorithm （WFCA） instead of standard clustering algorithm is introduced to realize feature extraction of laser scanner. Aimed at the unknown clustering number in advance, several validation index functions are used to estimate the validity of different clustering algorithms and one validation index is selected as the fitness function of genetic algorithm so as to determine the accurate clustering number automatically. At the same time, an improved genetic algorithm IVGA on the basis of VGA is proposed to solve the local optimum of clustering algorithm, which is implemented by increasing the population diversity and improving the genetic operators of elitist rule to enhance the local search capacity and to quicken the convergence speed. By the comparison with other algorithms, the effectiveness of the algorithm introduced is demonstrated.
基金Project Supported by National Natural Science Foundation of China （50607023）, Natural Science Femdation of CQ CSTC （2006BB2189）
文摘As the first step of service restoration of distribution system,rapid fault diagnosis is a significant task for reducing power outage time,decreasing outage loss,and subsequently improving service reliability and safety.This paper analyzes a fault diagnosis approach by using rough set theory in which how to reduce decision table of data set is a main calculation intensive task.Aiming at this reduction problem,a heuristic reduction algorithm based on attribution length and frequency is proposed.At the same time,the corresponding value reduction method is proposed in order to fulfill the reduction and diagnosis rules extraction.Meanwhile,a Euclid matching method is introduced to solve confliction problems among the extracted rules when some information is lacking.Principal of the whole algorithm is clear and diagnostic rules distilled from the reduction are concise.Moreover,it needs less calculation towards specific discernibility matrix,and thus avoids the corresponding NP hard problem.The whole process is realized by MATLAB programming.A simulation example shows that the method has a fast calculation speed,and the extracted rules can reflect the characteristic of fault with a concise form.The rule database,formed by different reduction of decision table,can diagnose single fault and multi-faults efficiently,and give satisfied results even when the existed information is incomplete.The proposed method has good error-tolerate capability and the potential for on-line fault diagnosis.
基金Project(2017YFB0102503)supported by the National Key Research and Development Program of ChinaProjects(U1664258,51875255,61601203)supported by the National Natural Science Foundation of China+1 种基金Projects(DZXX-048,2018-TD-GDZB-022)supported by the Jiangsu Province’s Six Talent Peak,ChinaProject(18KJA580002)supported by Major Natural Science Research Project of Higher Learning in Jiangsu Province,China
文摘In order to make full use of the driver’s long-term driving experience in the process of perception, interaction and vehicle control of road traffic information, a driving behavior rule extraction algorithm based on artificial neural network interface(ANNI) and its integration is proposed. Firstly, based on the cognitive learning theory, the cognitive driving behavior model is established, and then the cognitive driving behavior is described and analyzed. Next, based on ANNI, the model and the rule extraction algorithm(ANNI-REA) are designed to explain not only the driving behavior but also the non-sequence. Rules have high fidelity and safety during driving without discretizing continuous input variables. The experimental results on the UCI standard data set and on the self-built driving behavior data set, show that the method is about 0.4% more accurate and about 10% less complex than the common C4.5-REA, Neuro-Rule and REFNE. Further, simulation experiments verify the correctness of the extracted driving rules and the effectiveness of the extraction based on cognitive driving behavior rules. In general, the several driving rules extracted fully reflect the execution mechanism of sequential activity of driving comprehensive cognition, which is of great significance for the traffic of mixed traffic flow under the network of vehicles and future research on unmanned driving.
文摘局部线性嵌入算法采用欧氏距离选择邻域点,这通常会损失数据集本身的非线性特征,造成邻域点选取错误,且仅使用欧氏距离构造权重会导致信息挖掘不充分。针对以上问题,提出基于概率模型与信息熵的局部线性嵌入算法(Probability information entropy-LLE,PIE-LLE)。首先,为了使邻域点选择更加合理,从数据集的概率分布角度出发,考虑样本点及其邻域的概率分布,为样本点构造符合局部分布的邻域集合。其次,为了充分提取样本的局部结构信息,在权重构造阶段,分别计算样本所属邻域概率以及每个样本的信息熵,融合二者信息重构低维样本。最后,在两个轴承故障数据集上的实验表明,所提方法故障识别准确度最高达到了100%,高于其他对比算法;在邻域点个数5~15范围内,PIE-LLE算法展现出良好的低维可视化效果;在参数敏感性实验中,该算法可以保持Fisher指标较大,有效提高了算法的分类准确度和稳定性。
