共查询到20条相似文献,搜索用时 484 毫秒
1.
陈友 《测绘与空间地理信息》2015,(9):42-44
K均值算法是一种常用的聚类分析方法,广泛应用于图像处理和机器学习等领域。但该算法具有较高的计算复杂度,导致了算法具有较大的局限性。为了提高算法的运行效率,本文在深入分析算法基本原理的基础上,利用CUDA架构提供的强大计算能力对该算法进行了并行化改进。实验结果表明,算法在取不同的聚类数时均取得了较高的加速比。 相似文献
2.
Classification is always the key point in the field of remote sensing. Fuzzy c-Means is a traditional clustering algorithm that has been widely used in fuzzy clustering. However, this algorithm usually has some weaknesses, such as the problems of falling into a local minimum, and it needs much time to accomplish the classification for a large number of data. In order to overcome these shortcomings and increase the classification accuracy, Gustafson-Kessel (GK) and Gath-Geva (GG) algorithms are proposed to improve the traditional FCM algorithm which adopts Euclidean distance norm in this paper. The experimental result shows that these two methods are able to detect clusters of varying shapes, sizes and densities which FCM cannot do. Moreover, they can improve the classification accuracy of remote sensing images. 相似文献
3.
针对K-均值聚类存在的初始聚类中心不稳定、聚类数目难以确定的问题,提出利用正交投影散度(OPD)优化K-均值算法的初始聚类中心,设计了RD指标函数用于估计聚类数目k。将所提出的算法应用于高光谱影像特征提取与端元提取分析,实验结果表明,所提出算法的性能高于已有的类似算法。 相似文献
4.
5.
6.
超谱遥感图像快速聚类无损压缩算法 总被引:1,自引:0,他引:1
K-means聚类要求每个像素要和所有聚类中心求欧氏距离,当聚类数很多时,这是一个相当耗时的工作。改进的K—meam聚类算法根据历史聚类结果进行初始类分割,即节约初始聚类时间,又能使历史聚类过程中形成的类间稳定关系得以保持;类内像素只和相邻的聚类中心计算距离进行聚类,随着算法的迭代进行,大量类的状态基本固定,使得聚类速度不断加快。基于改进K-means聚类的无损压缩算法具有充分利用历史聚类成果和收敛速度快的特点,通过提高类内像素冗余度,最大限度消除谱间冗余和空间冗余。采用多次聚类压缩的结果预测最佳聚类数的方法,可实现最小熵无损压缩。通过和DPCM算法概率模型的熵值比较及实验数据的分析,验证了基于聚类无损压缩效率比不聚类无损压缩效果更优。 相似文献
7.
遥感影像模糊聚类方法可以在无需样本分布信息的情况下获取比硬聚类方法更高的分类精度,但其仍依赖先验知识来确定影像地物的类别数。本文提出了一种基于自适应差分进化的遥感影像自动模糊聚类方法,该方法利用差分进化搜索速度快、计算简单、稳定性高的优点,以Xie-Beni指数为优化的适应度函数,在无需先验类别信息的情况下自动判定图像的类别数,并结合局部搜索算子对遥感影像进行最优化聚类。通过模拟影像以及两幅真实遥感图像的分类实验表明,本文方法不仅可以正确地自动获取地物类别数,而且能够获得比K均值、ISODATA以及模糊K均值方法更高的分类精度。 相似文献
8.
本文将遗传算法(GA)应用于非监督训练,提高了遥感数据的分类精度。遗传竞争学习算法(GA-CL)综合了遗传算法和简单的竞争学习算法,可用于改进非监督训练的结果。遗传算法在典型样本聚类的过程中可以避免得到局部最优值。Jeffries-Matusita(J-M)距离法是通过统计测量两个训练类别之间的分离度,可用于评价这种算法。将此算法应用于TM数据的结果显示,遗传算法改进了简单的竞争学习算法,与其他非监督训练算法相比,其提供了K-均值,GA-K-均值和简单的竞争学习算法。 相似文献
9.
针对核优化问题进行了研究,给出了一种基于数据的智能核优化新方法。算法利用UCI数据和美国实测合成孔径雷达图像数据进行仿真实验,结果验证了该方法的有效性和可行性。 相似文献
10.
欧氏聚类算法是多元统计中的一种重要分类方法,可以将其应用于测绘领域中点云数据的分割。本文首先计算点云数据中两点之间的欧氏距离,将距离小于指定阈值作为分为一类的判定准则;然后迭代计算,直至所有的类间距大于指定阈值,完成欧氏聚类分割。具体步骤为:①利用Octree法建立点云数据拓扑组织结构;②对每个点进行k近邻搜索,计算该点与k个邻近点之间的欧氏距离,最小归为一类;③设置一定的阈值,对步骤②迭代计算,直至所有类与类之间的距离大于指定阈值。试验证明,欧氏聚类算法对不同测量技术手段获取的点云数据均具有适用性,可以成功对点云数据进行分割,分割效果良好。 相似文献
11.
12.
13.
ABSTRACTAs an effective tool for simulating spatiotemporal urban processes in the real world, urban cellular automata (CA) models involve multiple data layers and complicated calibration algorithms, which make their computational capability become a bottleneck. Numerous approaches and techniques have been applied to the development of high-performance urban CA models, among which the integration of vectorization and parallel computing has broad application prospects due to its powerful computational ability and scalability. Unfortunately, this hybrid algorithm becomes inefficient when the axis-aligned bounding box (AABB) of study areas contains many unavailable cells. This paper presents a minimum-volume oriented bounding box (OBB) strategy to solve the above problem. Specifically, geometric transformation (i.e. translation and rotation) is applied to find the OBB of the study area before implementing the hybrid algorithm, and a set of functions are established to describe the spatial coordinate relationship between the AABB and OBB layers. Experiments conducted in this study demonstrate that the OBB strategy can further reduce the computational time of urban CA models after vectorization and parallelism. For example, when the cell size is 15 m and the neighborhood size is 3 × 3, an approximately 10-fold speedup in computational time can result from vectorization in the MATLAB environment, followed by an 18-fold speedup after implementing parallel computing in a quad-core processor and, finally, a speedup of 25-fold by further using an OBB strategy. We thus argue that OBB strategy can make the integration of vectorization and parallel computing more efficient and may provide scalable solutions for significantly improving the applicability of urban CA models. 相似文献
14.
基于MRF随机场和广义混合模型的遥感图像分级聚类 总被引:3,自引:0,他引:3
有限混合模型FM的分级聚类已广泛应用于不同领域,然而,它的计算复杂度与观测数据的平方成正比,因此,在海量数据方面的应用就受到了限制。另一方面,多光谱图像数据中同时包含有空间和光谱两类信息,但大多数基于像素的多光谱图像聚类方法,仅使用了其频谱信息而忽视了空间信息。本文提出了一种新的基于广义有限混合模型GFM的分级聚类方法,该算法把MRF随机场和GFM模型结合在一起,分类数可以通过PLIC准则自动确定。算法在执行过程中,采用K均值聚类方式获得过分类图像,分级聚类从过分类图像开始,代替原来从单点类开始的方式,这样可以方便获取GFM模型成分密度的初始参数。最后,采用由Gibbs采样器生成的仿真测试图对算法的精度进行了定量评价,通过与K均值聚类和FM聚类的比较说明了本文算法的优越性,同时用荷兰Flevoland农业地区的极化SAR图像验证了本文算法的有效性。 相似文献
15.
CPU/GPU异构混合系统是一种新型高性能计算平台,但现有并行空间插值算法仅依赖CPU或GPU进行加速,迫切需要研究协同并行空间插值算法以充分利用异构计算资源,进一步提升插值效率。以薄板样条函数插值为例,提出一种CPU/GPU协同并行插值算法以加速海量激光雷达(light detector & ranger,LiDAR)点云生成数字高程模型(DEM)。通过插值任务的分解与抽象封装以屏蔽底层硬件执行模式的差异性,同时在多级协同并行框架基础上设计了Greedy-SET动态调度策略,策略顾及底层硬件能力的差异性,以实现异构并行资源的充分利用和良好负载均衡。实验表明,协同并行插值算法在高性能工作站上取得19.6倍的加速比,相比单一CPU或GPU并行算法,其效率提升分别达到54%和44%,实现了高效的协同并行处理。 相似文献
16.
《International Journal of Digital Earth》2013,6(11):1077-1097
ABSTRACTThis paper presents an approach to process raw unmanned aircraft vehicle (UAV) image-derived point clouds for automatically detecting, segmenting and regularizing buildings of complex urban landscapes. For regularizing, we mean the extraction of the building footprints with precise position and details. In the first step, vegetation points were extracted using a support vector machine (SVM) classifier based on vegetation indexes calculated from color information, then the traditional hierarchical stripping classification method was applied to classify and segment individual buildings. In the second step, we first determined the building boundary points with a modified convex hull algorithm. Then, we further segmented these points such that each point was assigned to a fitting line using a line growing algorithm. Then, two mutually perpendicular directions of each individual building were determined through a W-k-means clustering algorithm which used the slop information and principal direction constraints. Eventually, the building edges were regularized to form the final building footprints. Qualitative and quantitative measures were used to evaluate the performance of the proposed approach by comparing the digitized results from ortho images. 相似文献
17.
18.
19.
20.
本文基于高速公路高精度点云数据,首先通过点云数据的分类处理实现对树木点云数据的提取,将树木点云投影到水平面,采用DBSCAN密度聚类算法实现单根树木的提取;然后在数据密集区域存在树木树冠点云重叠的区域,本文结合树干几何特征提取树干的位置信息,计算所有点云到树干中心的欧氏距离,将所有点云归类到最近的树干进行粗分割;最后根据粗分割的树木轮廓特征确定树冠模型与树冠中心,提出了采用基于密度特征的格网竞争算法对重叠的区域进行精细分割。试验表明,本文采用的树木分割方法能够实现单棵树木精确提取。 相似文献