机构地区:[1]College of Automation Engineering,Nanjing University of Aeronautics and Astronautics
出 处:《Chinese Journal of Aeronautics》2014年第1期102-109,共8页中国航空学报(英文版)
基 金: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.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.
关 键 词:DaM reduction Edge detection Fuzzy clustering Possibility fuzzy C2means(PFCM)
分 类 号:TP212[自动化与计算机技术—检测技术与自动化装置] TP391.41[自动化与计算机技术—控制科学与工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...