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

基于Gomory-Hu算法有效实现的图像区域分割
引用本文:周强锋,田铮,李小斌,刘丙涛.基于Gomory-Hu算法有效实现的图像区域分割[J].计算机应用,2008,28(3):671-673.
作者姓名:周强锋  田铮  李小斌  刘丙涛
作者单位:西北工业大学,应用数学系,西安,710072;西北工业大学,应用数学系,西安,710072;中国科学院,遥感科学国家重点实验室,北京,100101
基金项目:国家自然科学基金 , 国家航空基础科学基金
摘    要:提出一种基于图的图像区域分割方法。算法首先对原图像利用区域生长技术产生初始分割;其次以初始分割区域作为顶点构造赋权无向图;最后以Minimum Cut为准则,利用改进的Gomory-Hu算法得到图像的最终分割。该方法既减少了构造图的顶点又利用了全局信息来对区域分割。实验结果表明了该算法的有效性。

关 键 词:最小割  区域分割  Gomory-Hu算法  图论  图像分割
文章编号:1001-9081(2008)03-0671-03
收稿时间:2007-09-17
修稿时间:2007-12-11

Effective implementation of image region segmentation based on Gomory-Hu algorithm
ZHOU Qiang-feng,TIAN Zheng,LI Xiao-bin,LIU Bing-tao.Effective implementation of image region segmentation based on Gomory-Hu algorithm[J].journal of Computer Applications,2008,28(3):671-673.
Authors:ZHOU Qiang-feng  TIAN Zheng  LI Xiao-bin  LIU Bing-tao
Affiliation:ZHOU Qiang-feng1,TIAN Zheng1,2,LI Xiao-bin1,LIU Bing-tao1(1.Department of Applied Mathematics,Northwest Polytechnical University,Xi'an Shaanxi 710072,China,2.State Key Laboratory of Remote Sensing Science,Chinese Academy of Sciences,Beijing 100101,China)
Abstract:A graph-based image segmentation method was presented. Firstly, use region growing technique to find initial over-segmentation. Secondly, use these regions as nodes to create the graph. Finally, use minimum cut method to merge these regions. The proposed method has two advantages: one is using minimum cut criterion to merge regions, which can contain global information; the other is using regions as nodes to create the graph, which can greatly reduce nodes of the graph. The experimental results show the effectiveness of the approach.
Keywords:minimum cut  region segmentation  Gomory-Hu algorithm  graph theory  image segmentation
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机应用》浏览原始摘要信息
点击此处可从《计算机应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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