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

基于阈值约束最小生成树算法的区域合并方法
引用本文:边钊,唐娉,陈趁新.基于阈值约束最小生成树算法的区域合并方法[J].计算机工程与设计,2012,33(1):229-232,242.
作者姓名:边钊  唐娉  陈趁新
作者单位:中国科学院遥感应用研究所,北京,100101
基金项目:国家863高技术研究发展计划基金
摘    要:为了解决基于形态学的分水岭分割算法受噪声影响而产生的“过分割”问题,提出了基于阈值约束最小生成树算法的区域合并方法.利用图论中最小生成树算法(prim算法、kruskal算法和boruvka算法),把分割后的区域看作是图的顶点,有相邻关系的区域看作是图的边,相邻区域的特征差异看作是边的权值,通过设置合适的阈值和迭代次数进行区域合并.实验结果表明,该方法保持地物边界的同时能够快速有效地合并“过分割”区域,尤其适用于地物复杂、尺寸较大的遥感图像.

关 键 词:分水岭分割  区域合并    最小生成树  过分割

Region merging method based on threshold constrained minimum spanning tree
BIAN Zhao , TANG Ping , CHEN Chen-xin.Region merging method based on threshold constrained minimum spanning tree[J].Computer Engineering and Design,2012,33(1):229-232,242.
Authors:BIAN Zhao  TANG Ping  CHEN Chen-xin
Affiliation:(Institute of Remote Sensing Application,Chinese Academy of Sciences,Beijing 100101,China)
Abstract:To solve the problem of over-segmentation caused by noise when applying watershed segmentation based on morpho-logy,a new regions merging method is proposed.Based on the minimum spanning tree algorithm(prim,kruskal,boruvka),segmented region is regarded as the vertex of a graph,adjacent regions are regarded as the edges whose weight is determined by the difference between the segmented region and adjacent region,regions merging is completed by setting the appropriate threshold and iteration times.Experiment indicated that the method can keep the boundary of region while merging"over-segmentation" regions quickly and effectively,and it is effective for remote sensing images of complex and large size.
Keywords:watershed segmentation  region merge  graph  minimum spanning tree  over-segmentation
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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