首页> 外文会议>International Symposium on Advanced Electrical and Communication Technologies >Landscape Change Detection Using Auto-optimized K-means Algorithm
【24h】

Landscape Change Detection Using Auto-optimized K-means Algorithm

机译:景观改变检测使用自动优化的K-means算法

获取原文

摘要

This paper presents landscape change detection for sustainable environment monitoring and planning of urban areas. An integration of principle component analysis (PCA) and K-mean algorithm is used in the study. The PCA offers the advantages of data redundancy, but results are difficult to interpret. K-mean provides an efficient interpretation of PCA results, but the selection of cluster K affects the detection results. Therefore, an automatic selection of the optimized value of K is proposed in the paper. A Calinski-Harabasz criterion in contrast to the Silhouette criterion is proposed to find the optimized value of K. The results are obtained for both Panchromatic and multispectral satellite images of Pune and Ahmedabad city of India respectively. The experiment analysis shows that the Calinski-Harabasz criterion gives an accurate value of K with better change detection in the images.
机译:本文介绍了可持续环境监测和城市地区规划的景观变革检测。 研究中使用了原理分析(PCA)和K平均算法的整合。 PCA提供数据冗余的优点,但结果难以解释。 K-均值提供了对PCA结果的有效解释,但群集K的选择会影响检测结果。 因此,在纸上提出了自动选择k的优化值。 建议与轮廓标准相比的Calinski-Harabasz标准找到了K的优化值。分别为Pune和Ahmedabad市的Punchromatic和Multispectral卫星图像分别获得了结果。 实验分析表明,Calinski-Harabasz标准在图像中具有更好的变化检测,提供了k的精确值。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号