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

基于最短路径的分水岭分割算法的研究
引用本文:杨本胜.基于最短路径的分水岭分割算法的研究[J].数字社区&智能家居,2011(13).
作者姓名:杨本胜
作者单位:广州松田职业学院机电与信息工程系;
摘    要:该提出了一种基于最短路径的分水岭分割算法,该方法受到水在地形表面自由流动的启发,把一幅数字图像当成是一个地形表面,然后根据图论中的最短路径思想进行分水岭变换。通过该方法在数字图像分割中的应用,实验结果表明基于最短路径的分水岭变换分割算法能够在一定程度上克服传统分水岭变换算法导致的过度分割,而且加快了分水岭变换的速度,提高的了分割效率,同时该算法能够准确地刻画目标区域的轮廓,能够保证分割目标的完整,有利于后续的图像分析,模式识别。

关 键 词:图像分割  最短路径  分水岭  图论  

The Shortest Path-based Watershed Segmentation Algorithm
YANG Ben-sheng.The Shortest Path-based Watershed Segmentation Algorithm[J].Digital Community & Smart Home,2011(13).
Authors:YANG Ben-sheng
Affiliation:YANG Ben-sheng(Guangzhou Songtian Polytechnic College,Electrical and Information Engineering,Guangzhou 511370,China)
Abstract:In this article,we proposed a image division method based on the shortest path of a watershed dividing algorithm,the method was enlightened by the water freedom movement on the surface,we see digital image as a land surface,then according to the ideas of the shortest path in the graph theory,watershed changing was done.By the way in the application of digital image division,The experimental results show that the algorithm based on the shortest path of watershed can overcome over division problem caused by t...
Keywords:image division  shortest path  watershed  graph theory  
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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