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

基于生成树的图像完全细化算法
引用本文:李甦,谭永龙. 基于生成树的图像完全细化算法[J]. 计算机工程与设计, 2006, 27(21): 4006-4007,4070
作者姓名:李甦  谭永龙
作者单位:云南大学,信息学院,云南,昆明,650091;云南大学,信息学院,云南,昆明,650091
摘    要:图像细化是图像处理的重要环节,已有的图像细化算法较多,但都存在一些缺陷,限制了算法的使用范围。提出一种基于生成树的图像细化算法,对原图像运用形态学细化算法预处理,对中间结果的连通分支分别建立生成树,利用树的结构特征对图像中各连通分支逐个细化。对指纹图像的实验结果表明,该算法能使图像得到完全细化并能有效的去除毛刺,减小噪声干扰,还能避免交叉点处连通度冗余现象,有较强的适应性。

关 键 词:细化算法  图像生成树  图像处理  图像细化  骨架化
文章编号:1000-7024(2006)21-4006-02
收稿时间:2006-03-31
修稿时间:2006-03-31

Image fully thinning algorithm based on spanning tree
LI Su,TAN Yong-long. Image fully thinning algorithm based on spanning tree[J]. Computer Engineering and Design, 2006, 27(21): 4006-4007,4070
Authors:LI Su  TAN Yong-long
Affiliation:School of Information Science and Engineering, Yunnan University, Kunming 650091, China
Abstract:Image thinning is an important segment in the image processing.There are many image thinning algorithms existing,but nearly all of them have some limitations that limit its usage area.Image's spanning tree thinning algorithm make the image completely thinning which use the characters of the tree,so it can extract the feature of the image accurately.Firstly,the morphological thinning algorithm pretreatment the image is used,secondly,spanning tree of the image is built,and the characters of the tree to thin the image are used.The test result of the fingerprint image enunciate that image's spanning tree thinning algorithm thin the image completely,wipe off the tiny burr,and avoid the redundancy of connectivity in the crossing.This algorithm has a perfect performance and is suitable to a wide range of image.
Keywords:thinning algorithm   image spanning tree   image processing   image thinning   skeleton
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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