论文部分内容阅读
本文叙述了图像数据结构的一种变换算法。近年发展起来的四叉树数据结构,是描述图像结构、压缩存储空间等方面的一种好方法;而链式码向量在检测和描述图像区域边界及其形状方面有很多长处。但两种结构各有其缺点,它们互相补充,才能得到较好效果。本文提出并分析了一个从2DRE四叉树得到图像中的区域边界的算法,即2DRE四叉树一链式码向量变换算法(简称Q—V算法)。文中介绍了算法的基础和算法本身,并对其特点和效果进行评价和分析。
This paper describes a transformation algorithm of image data structure. The quadtree data structure developed in recent years is a good way to describe the image structure and compress the storage space. The chain code vector has many advantages in detecting and describing the boundary and the shape of the image area. However, each of the two structures has its own drawbacks, which complement each other in order to achieve better results. This paper presents and analyzes an algorithm for obtaining the region boundary in 2D image from 2DRE quadtree, that is, 2DRE quadtree-chain code vector transformation algorithm (Q-V algorithm for short). In this paper, the basis of the algorithm and the algorithm itself are introduced, and its characteristics and effects are evaluated and analyzed.