| 二维图形的二叉树表示 |
| |
| 引用本文： | 陈礼民,吕士森.二维图形的二叉树表示[J].自动化学报,1990,16(3):238-242. |
| |
| 作者姓名： | 陈礼民 吕士森 |
| |
| 作者单位： | 1.山西大学; |
| |
| 摘 要： | 用二叉树表示二维图形的一个重要优点是层次分明.分层对图形的识别和分析是很有用
的,但是这要求每一分层对原图能保真.本文取弧的惯量为特性值,用线生长法1]来构造二叉
树的方法,取得图形分层表示的好结果.
|
| 关 键 词： | 计算机视觉 2-D图形 图形分析 二叉树 保真性 |
| 收稿时间： | 1987-7-7 |
Binary Tree Representation of 2-D Shape |
| |
| Chen Limin,Lu Shisen.Binary Tree Representation of 2-D Shape[J].Acta Automatica Sinica,1990,16(3):238-242. |
| |
| Authors: | Chen Limin Lu Shisen |
| |
| Affiliation: | 1.Shanxi University;Shanxi Automation Institute |
| |
| Abstract: | Ohe of the important advantages of representing 2-D shape by binary tree its clear hierarchy. This is very useful to a shape analysis and recognition. However, it is required that every level shape of image must be faithful to the shape of the original picture. In this paper, the binary tree representation of 2-D shape is discussed, the arc inertia is taken as a new feature value to merge the edges, and the Line Growing Algorithm is used to build the binary tree. Good results have been achieved by this method. |
| |
| Keywords: | Computer vision image processing 2-D shape shape analysis binary tree |
| 本文献已被 CNKI 维普 等数据库收录！ |
| 点击此处可从《自动化学报》浏览原始摘要信息 |
|
点击此处可从《自动化学报》下载全文 |
|
