Multi-sensor image matching based on salient edges has broad prospect in applications, but it is difficult to extract salient edges of real multi-sensor images with noises fast and accurately by using common algorithm...Multi-sensor image matching based on salient edges has broad prospect in applications, but it is difficult to extract salient edges of real multi-sensor images with noises fast and accurately by using common algorithms. According to the analysis of the features of salient edges, a novel salient edges detection algorithm and its rapid calculation are proposed based on possibility fuzzy C-means （PFCM） kernel clustering using two-dimensional vectors composed of the values of gray and texture. PFCM clustering can overcome the shortcomings that fuzzy C-means （FCM） cluster- ing is sensitive to noises and possibility C-means （PCM） clustering tends to find identical clusters. On this basis, a method is proposed to improve real-time performance by compressing data sets based on the idea of data reduction in the field of mathematical analysis. In addition, the idea that kernel-space is linearly separable is used to enhance robustness further. Experimental results show that this method extracts salient edges for real multi-sensor images with noises more accurately than the algorithm based on force fields and the FCM algorithm; and the proposed method is on average about 56 times faster than the PFCM algorithm in real time and has better robustness.展开更多
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.展开更多
基金supported by the Aeronautical Science Foundation of China (Grant No.20100152003)the National Natural Foundation of China (Grant Nos.60974105,61074161)the Fundamental Research Funds for the Central Universities (No. NZ2012307)
文摘Multi-sensor image matching based on salient edges has broad prospect in applications, but it is difficult to extract salient edges of real multi-sensor images with noises fast and accurately by using common algorithms. According to the analysis of the features of salient edges, a novel salient edges detection algorithm and its rapid calculation are proposed based on possibility fuzzy C-means （PFCM） kernel clustering using two-dimensional vectors composed of the values of gray and texture. PFCM clustering can overcome the shortcomings that fuzzy C-means （FCM） cluster- ing is sensitive to noises and possibility C-means （PCM） clustering tends to find identical clusters. On this basis, a method is proposed to improve real-time performance by compressing data sets based on the idea of data reduction in the field of mathematical analysis. In addition, the idea that kernel-space is linearly separable is used to enhance robustness further. Experimental results show that this method extracts salient edges for real multi-sensor images with noises more accurately than the algorithm based on force fields and the FCM algorithm; and the proposed method is on average about 56 times faster than the PFCM algorithm in real time and has better robustness.
文摘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.
