一种基于标记的并行细化算法

任金昌;赵荣椿;David D.Feng;

电子学报 ›› 2000, Vol. 28 ›› Issue (11) : 9-11.

PDF(169 KB)
PDF(169 KB)
电子学报 ›› 2000, Vol. 28 ›› Issue (11) : 9-11.
论文

一种基于标记的并行细化算法

  • 任金昌1,2, 赵荣椿1, David D.Feng2,3
作者信息 +

A Parallel Thinning Method Based on Image Marking

  • REN Jin-chang1,2, ZHAO Rong-chun1, David D.Feng2,3
Author information +
文章历史 +

摘要

本文提出了一种基于图像标记的并行细化算法.首先计算图像中像素和轮廓距离的标记信息,并将标记图像作为细化算法的输入.通过综合利用标记信息,保留了几何特性,提高了细化算法的鲁棒性,同时为进一步图元识别/拟合奠定了基础.

Abstract

A new parallel thinning method based on image marking is proposed in this paper.First,the distance from every pixel to its nearest contour is calculated.Then these distances will be constructed as a marking image of the original one and inputted for thinning.The experimental results have demonstrated that the proposed approach can achieve comparable satisfactory performance in terms of keeping geometrical properties and robustness to single-pixel noise by the integrative usage of the marking information.Moreover,the method presented will also benefit the basis for further graph recognition.

关键词

图像标记:并行细化 / 模板匹配 / 轮廓距离

Key words

image marking / parallel thinning / template matching / contour distance

引用本文

导出引用
任金昌;赵荣椿;David D.Feng;. 一种基于标记的并行细化算法[J]. 电子学报, 2000, 28(11): 9-11.
REN Jin-chang;ZHAO Rong-chun;David D.Feng;. A Parallel Thinning Method Based on Image Marking[J]. Acta Electronica Sinica, 2000, 28(11): 9-11.
中图分类号: TP391.4   

基金

"八五"攻关项目 (No.85-102-01-10-02); 西北工业大学青年基金及香港理工大学UGC基金 (No.119/96E及Polyu1.42.37.A050)
PDF(169 KB)

1966

Accesses

0

Citation

Detail

"八五"攻关项目(No.85-102-01-10-02);西北工业大学青年基金及香港理工大学UGC基金(No.119/96E及Polyu1.42.37.A050)
段落导航
相关文章

/