摘要
本文叙述了图像数据结构的一种变换算法。近年发展起来的四叉树数据结构,是描述图像结构、压缩存储空间等方面的一种好方法;而链式码向量在检测和描述图像区域边界及其形状方面有很多长处。但两种结构各有其缺点,它们互相补充,才能得到较好效果。本文提出并分析了一个从2DRE四叉树得到图像中的区域边界的算法,即2DRE四叉树一链式码向量变换算法(简称Q—V算法)。文中介绍了算法的基础和算法本身,并对其特点和效果进行评价和分析。
Quadtrees, the data structure developed in recent years, have advantages in expressing structure and compressing the space of storage while Chaincode-Vector are the data structure used to detect and describe the edges and shapes of fields in an image, so both of them have their own advantages and disadvantages in different situations. This paper advances and analyses an algorithm of converting 2DRE Quadtree to Vector, which abstracts the edges of fields in an image from its 2DRE Quadtree. The fields' edges are represented in the form of coordinates of vectors for displaying the fields' shape and outputting the vectors easily. In this paper,the base of the algorithm is introduced first; then the algorithm is described in detail; finally the features and practical results of the algorithm are estimated and analysed.
出处
《环境遥感》
CSCD
1992年第3期208-215,共8页
关键词
图像处理
数据结构
四叉树
向量
Image processing Data structure Quadtree Vector Field's edge
