首页 | 本学科首页   官方微博 | 高级检索  
     

矢量居民地多边形多级图划分聚类方法
引用本文:金澄,安晓亚,陈占龙,马啸川. 矢量居民地多边形多级图划分聚类方法[J]. 武汉大学学报(信息科学版), 2021, 0(1): 19-29
作者姓名:金澄  安晓亚  陈占龙  马啸川
作者单位:西安测绘研究所;地理信息工程国家重点实验室;中国地质大学(武汉)地理与信息工程学院
基金项目:国家自然科学基金(41871305);国家重点研发计划(2017YFC0602204);中央高校基本科研业务费(CUGQY1945);中央高校基本科研业务费(GLAB2019ZR02);地质探测与评估教育部重点实验室主任基金。
摘    要:针对复杂居民地多边形的信息挖掘问题,提出了一种多级图划分聚类分析方法,构造居民地多边形的图模型,并通过对图模型进行粗化匹配与重构、初始化分和细化得到聚类结果.首先构建研究区域内居民地建筑物的Delaunay三角网,生成包含研究对象之间的邻接信息图;然后结合空间认知准则和人类认知的特点,采用形状狭长度、面积比、凹凸性、距...

关 键 词:居民地多边形  相似性度量  多边形聚类分析  多级图划分方法

A Multi-level Graph Partition Clustering Method of Vector Residential Area Polygon
JIN Cheng,AN Xiaoya,CHEN Zhanlong,MA Xiaochuan. A Multi-level Graph Partition Clustering Method of Vector Residential Area Polygon[J]. Geomatics and Information Science of Wuhan University, 2021, 0(1): 19-29
Authors:JIN Cheng  AN Xiaoya  CHEN Zhanlong  MA Xiaochuan
Affiliation:(Xi'an Research Institute of Surveying and Mapping,Xi'an 710054,China;State key Laboratory of Geo-Information Engineering,Xi'an 710054,China;School of Geography and Information Engineering,China University of Geosciences(Wuhan),Wuhan 430074,China)
Abstract:In order to solve the problems of information mining of complex residential polygons,a multilevel graph partition clustering method is proposed to construct the graph model of residential polygons,and the clustering results are obtained by coarsen,matching and reconstruction,initialization and refinement of the graph model.Firstly,the Delaunay triangular network of residential buildings in the study area is constructed to generate the adjacent information graph including the research objects.Then,the similarity of the neighborhood graph is measured by five indexes of shape narrow length,size,convexity,distance and connectivity combined with the characteristics of spatial cognition and human cognition in this paper.Finally,the clustering results are obtained by using the multi-level graph partition method.In the experiment,the vector data of residential buildings in Shanghai are used for clustering analysis,and the silhouette coefficients and visual effects of improved k-Means algorithm(k-Means + +),density-based spatial clustering of applications with noise(DBSCAN) and minimum spanning tree(MST) clustering algorithms with noise robustness are compared.The experimental results show that the results of polygonal clustering analysis based on multi-level graph partition are more consistent with human cognition.
Keywords:residential area polygon  similarity measurement  clustering analysis of polygons  multi-level graph-partition method
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号