线性四元树到边界链码的一种新转换算法

A New Algorithm For Converting Linear Quadtrees into Boundary Codes

在图象编码过程中，往往需要将四元树转换为边界链码。针对这一问题，本文提出了一种线性四元树到边界链码的新转换算法。与以往一些算法相比，该算法实现起来非常简单而又不失通用性。在该算法中，四元树上所有大于最小黑结点的黑结点被递归划分成最小黑结点大小，随后采用一种堆栈的方式实现结点的邻接寻找。

In the process of image compression, is often needed to convert the quadtree representation into the boundary codes. So we advance a new algorithm, easy to realize which can be generally used as compared with other method, to solve this problem. In our method, those black nodes in a quadtree who are bigger than the smallest are sub-divided recursively till all the black nodes are in the same size . A kind of stack is adapted to realize the adjacency searching step. As soon as the vector set standing for the region's boundary is calculated, the relevant chain code is got.