摘要
本文提出一种方法实现二值图象的二元数组表示转换成线性四元树描述。它包括两个算法:(1)二元数组转换成0-四分形集合,和(2)平移-合并0-四分形。对于二元数组,算法(1)需要O(2^(2n))时间。算法(2)以0-四分形数目的线性时间运行。
A method is presented for converting the array representation of a binary image into the linear quadtree description. Two algorithms, (1) Conversion of a binary array into the set of 0-quadrants and (2) translation-merging of the 0-quadrants. are described. For the binary array A = [aij]2n×2n, algorithm (1) requires O(22n)time. Algorithm (2) can be excuted in linear time with respect to the total number of 0-quadrants.
出处
《计算机学报》
EI
CSCD
北大核心
1990年第9期685-691,共7页
Chinese Journal of Computers
