二维图形的二叉树表示
Binary Tree Representation of 2-D Shape
-
摘要: 用二叉树表示二维图形的一个重要优点是层次分明.分层对图形的识别和分析是很有用 的,但是这要求每一分层对原图能保真.本文取弧的惯量为特性值,用线生长法[1]来构造二叉 树的方法,取得图形分层表示的好结果.Abstract: One 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.
-
Key words:
- Computer vision /
- image processing /
- 2-D shape /
- shape analysis /
- binary tree
-
计量
- 文章访问数: 2967
- HTML全文浏览量: 119
- PDF下载量: 1111
- 被引次数: 0
下载:
