摘要
近年来,图象的四元树表示及在四元树上执行图象操作运算已有许多研究,其中图象平移是受到广泛注意的论题之一.但是,至今为止的主要研究工作均需要“排序”或“二分查找”技术实施图象平移操作,因而算法的时间复杂度过高,运行效率较低.本文给出了一个基于四元树的图象平移算法,突破了已有的传统研究方法,采用“活动边(active edge)”数据结构,在图象平移操作时保持“活动块(active block)”的信息,使算法既不需要“排序”也不需要“搜索”,因而大大降低了时间复杂度.大量的对比实验也表明了该算法的可行性和有效性.
In the past few years there had been many research works on representation of an image as well as itsprocessing operations by quadtree.Wherein image translation is a quite interesting topic,but the algorithmsfor it are inefficient.An image translation algorithm based on quadtree is proposed in this paper.It has anunconventional grace of its own.By using“active edge”data structure to keep the information of“activeblocks”,the algorithm requires neither“sorting”nor“searching”technique,and much time is thus saved.
出处
《信息与控制》
CSCD
北大核心
1989年第4期1-7,共7页
Information and Control
关键词
四元树
图象平移
算法
活动边
图象
quadtree representation of images
linear quadtree
depth first expression
active edge data structure
image translation
