The similarity measure is crucial to the performance of spectral clustering. The Gaussian kernel function based on the Euclidean distance is usual y adopted as the similarity measure. However, the Euclidean distance m...The similarity measure is crucial to the performance of spectral clustering. The Gaussian kernel function based on the Euclidean distance is usual y adopted as the similarity measure. However, the Euclidean distance measure cannot ful y reveal the complex distribution data, and the result of spectral clustering is very sensitive to the scaling parameter. To solve these problems, a new manifold distance measure and a novel simulated anneal-ing spectral clustering （SASC） algorithm based on the manifold distance measure are proposed. The simulated annealing based on genetic algorithm （SAGA）, characterized by its rapid convergence to the global optimum, is used to cluster the sample points in the spectral mapping space. The proposed algorithm can not only reflect local and global consistency better, but also reduce the sensitivity of spectral clustering to the kernel parameter, which improves the algorithm’s clustering performance. To efficiently apply the algorithm to image segmentation, the Nystrom method is used to reduce the computation complexity. Experimental results show that compared with traditional clustering algorithms and those popular spectral clustering algorithms, the proposed algorithm can achieve better clustering performances on several synthetic datasets, texture images and real images.展开更多
The spectral clustering method has notable advantages in segmentation.But the high computational complexity and time consuming limit its application in large-scale and dense airborne Light Detection and Ranging(LiDAR)...The spectral clustering method has notable advantages in segmentation.But the high computational complexity and time consuming limit its application in large-scale and dense airborne Light Detection and Ranging(LiDAR)point cloud data.We proposed the Nyström-based spectral clustering(NSC)algorithm to decrease the computational burden.This novel NSC method showed accurate and rapid in individual tree segmentation using point cloud data.The K-nearest neighbour-based sampling(KNNS)was proposed for the Nyström approximation of voxels to improve the efficiency.The NSC algorithm showed good performance for 32 plots in China and Europe.The overall matching rate and extraction rate of proposed algorithm reached 69%and 103%.For all trees located by Global Navigation Satellite System(GNSS)calibrated tape-measures,the tree height regression of the matching results showed an value of 0.88 and a relative root mean square error(RMSE)of 5.97%.For all trees located by GNSS calibrated total-station measures,the values were 0.89 and 4.49%.The method also showed good performance in a benchmark dataset with an improvement of 7%for the average matching rate.The results demonstrate that the proposed NSC algorithm provides an accurate individual tree segmentation and parameter estimation using airborne LiDAR point cloud data.展开更多
联合TK(Tomasi-Kanade,TK)角检测器和COVPEX(corner validation based on corner property ex-traction,COVPEX)角验证算法进行IKONOS多光谱影像的角提取。角提取对比实验结果说明,本方法适合用于多光谱高分辨率影像,其角提取结果的精...联合TK(Tomasi-Kanade,TK)角检测器和COVPEX(corner validation based on corner property ex-traction,COVPEX)角验证算法进行IKONOS多光谱影像的角提取。角提取对比实验结果说明,本方法适合用于多光谱高分辨率影像,其角提取结果的精确性和合理性均有较大程度的提高。展开更多
基金supported by the National Natural Science Foundationof China(61272119)
文摘The similarity measure is crucial to the performance of spectral clustering. The Gaussian kernel function based on the Euclidean distance is usual y adopted as the similarity measure. However, the Euclidean distance measure cannot ful y reveal the complex distribution data, and the result of spectral clustering is very sensitive to the scaling parameter. To solve these problems, a new manifold distance measure and a novel simulated anneal-ing spectral clustering （SASC） algorithm based on the manifold distance measure are proposed. The simulated annealing based on genetic algorithm （SAGA）, characterized by its rapid convergence to the global optimum, is used to cluster the sample points in the spectral mapping space. The proposed algorithm can not only reflect local and global consistency better, but also reduce the sensitivity of spectral clustering to the kernel parameter, which improves the algorithm’s clustering performance. To efficiently apply the algorithm to image segmentation, the Nystrom method is used to reduce the computation complexity. Experimental results show that compared with traditional clustering algorithms and those popular spectral clustering algorithms, the proposed algorithm can achieve better clustering performances on several synthetic datasets, texture images and real images.
文摘The spectral clustering method has notable advantages in segmentation.But the high computational complexity and time consuming limit its application in large-scale and dense airborne Light Detection and Ranging(LiDAR)point cloud data.We proposed the Nyström-based spectral clustering(NSC)algorithm to decrease the computational burden.This novel NSC method showed accurate and rapid in individual tree segmentation using point cloud data.The K-nearest neighbour-based sampling(KNNS)was proposed for the Nyström approximation of voxels to improve the efficiency.The NSC algorithm showed good performance for 32 plots in China and Europe.The overall matching rate and extraction rate of proposed algorithm reached 69%and 103%.For all trees located by Global Navigation Satellite System(GNSS)calibrated tape-measures,the tree height regression of the matching results showed an value of 0.88 and a relative root mean square error(RMSE)of 5.97%.For all trees located by GNSS calibrated total-station measures,the values were 0.89 and 4.49%.The method also showed good performance in a benchmark dataset with an improvement of 7%for the average matching rate.The results demonstrate that the proposed NSC algorithm provides an accurate individual tree segmentation and parameter estimation using airborne LiDAR point cloud data.
文摘联合TK(Tomasi-Kanade,TK)角检测器和COVPEX(corner validation based on corner property ex-traction,COVPEX)角验证算法进行IKONOS多光谱影像的角提取。角提取对比实验结果说明,本方法适合用于多光谱高分辨率影像,其角提取结果的精确性和合理性均有较大程度的提高。
