检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]华中理工大学电信系图象教研室
出 处:《中国图象图形学报(A辑)》2000年第6期474-478,共5页Journal of Image and Graphics
基 金:国家自然科学基金!( 69672 0 14 );国家"九五"重点科技项目
摘 要:由于实际应用中 ,仅有边缘轮廓信息并不足以准确、有效地描述被检测物体 ,所以如何根据边缘的方向链码来重建二值图象是图象处理应用中的一类常见问题 .人们已经研究过许多不同的方法 ,例如奇偶检测法、种子法等等 .但这些方法或者由于计算量大 ,或者可能出现判别错误的现象 ,因而不能满足实际需求 .为了准确、快速地解决这一类问题 ,因此在方向链码的基础上 ,先将边缘点按照区域填充法则进行分类 ,进而提出了一种依据方向链码和边缘点分类 ,来重建二值图象的新方法 .实践证明 ,该方法可以很好地克服其它算法的缺点 ,并可得到较好的检测效果 ,而且具有准确、快速、计算量小、无漏检等优点 .现已被应用于作者所开发的“电力工业用射线探伤辅助识别系统”中 .Edge extraction is an usual method in the field of image processing. But it's not enough to exactly describe the detected object only using edge information in the practical applications. So how to restore the binary image according to the direction chain codes is an important problem in image processing field. A binary image can be described by using one or several direction chain codes that record the contour of this binary image. Many methods heve been proposed in the literature, but there still exist the drawbacks such as large computation and inaccurate restoration. In this paper, a new and fast method for restoration of binary image is presented to solve the problems, which is based on the sort of edge points and the chain coding of the boundaries. Experimental results show that this method is computationally faster than the previous methods and does not miss any part of the interior. It's a good restoration method, and already has been used in the practical application.
分 类 号:TN919.8[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222