共查询到20条相似文献，搜索用时 625 毫秒
1.
空间数据模糊聚类的有效性(英文) 总被引：1，自引：0，他引：1
The validity measurement of fuzzy clustering is a key problem. If clustering is formed, it needs a kind of machine to verify its validity. To make mining more accountable, comprehensible and with a usable spatial pattern, it is necessary to first detect whether the data set has a clustered structure or not before clustering. This paper discusses a detection method for clustered patterns and a fuzzy clustering algorithm, and studies the validity function of the result produced by fuzzy clustering based on two aspects, which reflect the uncertainty of classification during fuzzy partition and spatial location features of spatial data, and proposes a new validity function of fuzzy clustering for spatial data. The experimental result indicates that the new validity function can accurately measure the validity of the results of fuzzy clustering. Especially, for the result of fuzzy clustering of spatial data, it is robust and its classification result is better when compared to other indices. 相似文献
2.
一种模糊聚类的遥感影像分析方法研究 总被引：1，自引：0，他引：1
针对传统模糊聚类的遥感影像分析方法的不足,重点研究基于模糊ISODATA聚类的遥感影像分析。通过Matlab软件编程实现基于迭代自组织数据分析技术、模糊C均值聚类、模糊ISODATA算法对合成图像、纹理图像及真实遥感影像的分类,并对其分类结果进行讨论。通过实验数据对比,评价FISODATA算法的优越性。实验结果表明:ISODATA算法及FISODATA算法都能够实现变类,而FCM算法只能在固定聚类数下进行分类,但是,ISODATA算法分类机制不稳定,不能每次都确定正确聚类数。在迭代过程中,将FISODATA算法引入模糊集理论,便能够快速准确的实现聚类数的确定。 相似文献
3.
遥感影像模糊聚类方法可以在无需样本分布信息的情况下获取比硬聚类方法更高的分类精度,但其仍依赖先验知识来确定影像地物的类别数。本文提出了一种基于自适应差分进化的遥感影像自动模糊聚类方法,该方法利用差分进化搜索速度快、计算简单、稳定性高的优点,以Xie-Beni指数为优化的适应度函数,在无需先验类别信息的情况下自动判定图像的类别数,并结合局部搜索算子对遥感影像进行最优化聚类。通过模拟影像以及两幅真实遥感图像的分类实验表明,本文方法不仅可以正确地自动获取地物类别数,而且能够获得比K均值、ISODATA以及模糊K均值方法更高的分类精度。 相似文献
4.
基于模糊划分中存在的分类不确定性因素和空间数据的空间位置特征,提出了一种新的空间数据模糊聚类有效性函数。实验结果表明,这种新的有效性函数能够对模糊聚类结果的有效性进行正确的评价,特别是对于空间数据模糊聚类有效性评价,其分类效果较理想,同其他有效性指标相比,能得到较优的分类数。 相似文献
5.
一种非凸包边界约束不规则三角网生成算法 总被引：1，自引：0，他引：1
数字高程模型(DEM)模拟的大多数地形区域是多种类型区域镶嵌而成的复合体,且子区域的边界一般为非凸多边形,即三角网受到边界的约束。而目前已有的各种Delaunay三角网构网算法生成的不规则三角网的边界都是区域内采样点集的凸包,不能表达复合区域和边界为非凸多边形的区域。本文作者对三角网扩张法作了扩展,使之能够在任意多边形所包围的区域内生成不规则三角网。扩展后的算法具有步骤简单、适合任意多边形边界内生成不规则三角网的优点,而且该算法可用于"分块"式生成数据量较大的三角网,同时保证各"分块"之间完整的邻接关系。 相似文献
6.
7.
Forest structure at stand level plays a key role for sustainable forest management, since the biodiversity, productivity, growth and stability of the forest can be positively influenced by managing its structural diversity. In contrast to field-based measurements, remote sensing techniques offer a cost-efficient opportunity to collect area-wide information about forest stand structure with high spatial and temporal resolution. Especially Interferometric Synthetic Aperture Radar (InSAR), which facilitates worldwide acquisition of 3d information independent from weather conditions and illumination, is convenient to capture forest stand structure. This study purposes an unsupervised two-stage clustering approach for forest structure classification based on height information derived from interferometric X-band SAR data which was performed in complex temperate forest stands of Traunstein forest (South Germany). In particular, a four dimensional input data set composed of first-order height statistics was non-linearly projected on a two-dimensional Self-Organizing Map, spatially ordered according to similarity (based on the Euclidean distance) in the first stage and classified using the k-means algorithm in the second stage. The study demonstrated that X-band InSAR data exhibits considerable capabilities for forest structure classification. Moreover, the unsupervised classification approach achieved meaningful and reasonable results by means of comparison to aerial imagery and LiDAR data. 相似文献
8.
l IntroductionClassification pIays an imPOrtant role for rernotelysensed data tO be intngrated into gapraphical infOr-mation systems(GISs), and is increasingly comPut-eriZed with soPhisticated hardware and software(Cambell l987; Lillesand and Kiefer l994). Pnd-ucts Of classification are usua[ly represented in formof contiguous patches of pixels,with each being la-belled as belonging to a discrete and dominantclass. Such tyPe of classification is termed as crispor discrete. The accuracie… 相似文献
9.
10.
超谱遥感图像快速聚类无损压缩算法 总被引：1，自引：0，他引：1
K-means聚类要求每个像素要和所有聚类中心求欧氏距离，当聚类数很多时，这是一个相当耗时的工作。改进的K—meam聚类算法根据历史聚类结果进行初始类分割，即节约初始聚类时间，又能使历史聚类过程中形成的类间稳定关系得以保持；类内像素只和相邻的聚类中心计算距离进行聚类，随着算法的迭代进行，大量类的状态基本固定，使得聚类速度不断加快。基于改进K-means聚类的无损压缩算法具有充分利用历史聚类成果和收敛速度快的特点，通过提高类内像素冗余度，最大限度消除谱间冗余和空间冗余。采用多次聚类压缩的结果预测最佳聚类数的方法，可实现最小熵无损压缩。通过和DPCM算法概率模型的熵值比较及实验数据的分析，验证了基于聚类无损压缩效率比不聚类无损压缩效果更优。 相似文献
11.
一种顾及上下文的遥感影像模糊聚类 总被引：7，自引：1，他引：7
模糊聚类是非监督分类中的一类重要方法。传统的模糊聚类方法应用于遥感影像的非监督分类时，均未考虑到邻域像元间的统计依赖关系即上下文信息。针对这一缺陷，在Markov随机场模型框架下，引入了空间隶属度概念，提出了一种顾及上下文信息的模糊聚类算法，有效地提高了聚类精度和抗噪声能力。针对需要预先指定聚类个数的问题，采用了一种兼顾类别内部紧密程度和类别之间分离程度的评价指标，用以检验聚类结果的有效性。从而找出最优的聚类个数，在一定程度上提高了聚类结果的客观性。最后通过实验验证了本文算法的有效性。 相似文献
12.
13.
This paper describes an improved algorithm for fuzzyc-means clustering of remotely sensed data, by which the degree of fuzziness of the resultant classification is decreased as
comparing with that by a conventional algorithm: that is, the classification accuracy is increased. This is achieved by incorporating
covariance matrices at the level of individual classes rather than assuming a global one. Empirical results from a fuzzy classification
of an Edinburgh suburban land cover confirmed the improved performance of the new algorithm for fuzzyc-means clustering, in particular when fuzziness is also accommodated in the assumed reference data. 相似文献
14.
行人路网的完整性和准确性是保障步行导航服务的关键。当前的行人路网大多是基于室外道路设施构建的,缺乏室内可步行路径的数据支持,无法在导航应用中提供准确、真实的最优路径规划服务。鉴于此,本文提出了一种基于众源数据的室内外一体化行人路网构建方法,采用智能手机定位传感器与惯性传感器记录的众源轨迹,首先对缺失或者漂移的室内步行数据进行筛选,然后使用改进的行人航位推算(PDR)方法推算出准确的室内轨迹,进而采用莫尔斯理论生成涵盖室内外行人路径的完整行人路网。试验分析中对搜集到的260条步行轨迹数据进行行人路网构建,并使用高精度测量设备采集真实路网数据进行对比分析,结合OSM数据对试验结果进行综合评价。试验结果表明,本文方法能够准确、完整地生成室内外一体化行人路网。 相似文献
15.
16.
A robust method for spatial prediction of landslide hazard in roaded and roadless areas of forest is described. The method is based on assigning digital terrain attributes into continuous landform classes. The continuous landform classification is achieved by applying a fuzzy k-means approach to a watershed scale area before the classification is extrapolated to a broader region. The extrapolated fuzzy landform classes and datasets of road-related and non road-related landslides are then combined in a geographic information system (GIS) for the exploration of predictive correlations and model development. In particular, a Bayesian probabilistic modeling approach is illustrated using a case study of the Clearwater National Forest (CNF) in central Idaho, which experienced significant and widespread landslide events in recent years. The computed landslide hazard potential is presented on probabilistic maps for roaded and roadless areas. The maps can be used as a decision support tool in forest planning involving the maintenance, obliteration or development of new forest roads in steep mountainous terrain. 相似文献
17.
18.
19.
地图上居民地空间信息的特征度量法 总被引：1，自引：1，他引：0
地图的基本功能之一是载负和传输空间信息。地图空间信息量是衡量地图上空间要素及其关系与要素空间分布状况复杂程度的定量描述指标,可为制图综合和质量评价提供依据。本文以地图上居民地空间信息度量为研究对象,从地图空间信息的本质特征出发,结合空间信息认知的层次性特点,将居民地空间特征划分为三个层次,并相应地将其空间信息构成划分为：元素层次居民地面要素的几何形态信息、邻域层次相邻居民地的空间关系信息、整体层次居民地的聚群结构信息。进而,分别建立三个层次空间特征的定量描述指标,在此基础上建立基于空间特征的几何形态信息、分布关系信息和聚群结构信息度量方法。最后,通过试验分析验证了所提方法的合理性和优越性。 相似文献
20.
《International Journal of Digital Earth》2013,6(5):471-489
ABSTRACTSymmetry is a common feature in the real world. It may be used to improve a classification by using the point symmetry-based distance as a measure of clustering. However, it is time consuming to calculate the point symmetry-based distance. Although an efficient parallel point symmetry-based K-means algorithm (ParSym) has been propsed to overcome this limitation, ParSym may get stuck in sub-optimal solutions due to the K-means technique it used. In this study, we proposed a novel parallel point symmetry-based genetic clustering (ParSymG) algorithm for unsupervised classification. The genetic algorithm was introduced to overcome the sub-optimization problem caused by inappropriate selection of initial centroids in ParSym. A message passing interface (MPI) was used to implement the distributed master–slave paradigm. To make the algorithm more time-efficient, a three-phase speedup strategy was adopted for population initialization, image partition, and kd-tree structure-based nearest neighbor searching. The advantages of ParSymG over existing ParSym and parallel K-means (PKM) alogithms were demonstrated through case studies using three different types of remotely sensed images. Results in speedup and time gain proved the excellent scalability of the ParSymG algorithm. 相似文献