基于链码的分水岭和区域合并算法
DOI:
作者:
作者单位:

河海大学计算机与信息学院 南京 211100

作者简介:

通讯作者:

中图分类号:

TP391.41TN957.54

基金项目:


Watershed and region merging algorithm based on chain code
Author:
Affiliation:

Hohai University, College of Computer and Information, Nanjing 210000, China

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    为了对图像进行快速准确地分割,提出了一种新算法,以链码的形式实现分水岭算法及解决其分割后的过度分割问题。首先,根据传统链码的思想提出了指出链码和指入链码的思想。在灰度图像中,规定链码的指向规则进行区域分割,接着对分割后出现的小区域规定链码合并规则进行区域合并。最后,先用新算法和VS算法进行图像分割对比实验,再用新算法和NGG算法进行区域合并对比实验,并对新算法的实现效果和实现速度进行了分析。结果表明,新算法具有快速分割及合并的效果,且具有一定的准确性和可行性。

    Abstract:

    In order to quickly and accurately segment the image, a new algorithm is proposed, which is based on the form of chain code to solve the excessive segmentation of the watershed algorithm. Firstly, according to the idea of traditional chain code, we put forward the outward chain code and the inward chain code. In the gray image, the rule of the chain code is defined, and it is used to segment the image. And then the rule of the chain code about merging of the small region that is arised after segmentation of the image is set. Finally, using the new algorithm and VS algorithm to segment image, and using the new algorithm and NGG algorithm to achieve the region merging, complete the analysis of result and speed of the implementation about the new algorithm. The results show that the new algorithm has the advantages of fast segmentation and merging, and it has a certain accuracy and feasibility.

    参考文献
    相似文献
    引证文献
引用本文

陈建祥,静大海.基于链码的分水岭和区域合并算法[J].国外电子测量技术,2016,35(12):36-39

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:
  • 最后修改日期:
  • 录用日期:
  • 在线发布日期: 2017-01-12
  • 出版日期: