利用OBDD编码的快速二值图算法(英文)  

Fast Operations on Binary Images Encoded by OBDDs

作　　者：吕关锋[1] 苏开乐[2] 陈清亮[3] 徐旭东[1] 

机构地区：[1]北京工业大学计算机学院,北京100022 [2]北京大学高可信软件技术教育部重点实验室,北京100871 [3]暨南大学计算机科学系,广州510632

出　　处：《计算机科学与探索》2009年第3期303-308,共6页Journal of Frontiers of Computer Science and Technology

基　　金：The National Grand Fundamental Research 973 Program of China under Grant No.2005CB321900;the National Science Foundation for Distinguished Young Scholars of China under Grant No.60725207;the International Joint Research Project of National Science Foundation under Grant No.60911130005;the Start-up Research Fund for Introduced Talents in Jinan University;the Start-up Research Fund for Introduced Talents in Beijing University of Technology;the Discipline and Graduate Education Development Project Fund of Beijing Education Committee;the Distinguished Young Reseacher Nurturing Program in Univeristies of Guangdong under Grant No.LYM08017~~

摘　　要：对利用有序二元判定图 OBDD 编码二值图像进行了研究,该方法可以节约大量的空间,并在此基础上,提出了各种二值图的算法,包括解码和集合运算(并、交、差、对称差、包含和互补)。实验结果表明这种基于OBDD 编码的方法比现有的二值图编码方法效率更高。The ordered binary decision diagram （OBDD） is proposed to encode binary images, which can lead to a considerable amount of storage-saving. Based on it, various operations on binary images encoded as OBDDs are presented, i.e., decoding and set operations （union, intersection, difference, symmetric-difference, inclusion and complement）. encode binary Experimental results show that those OBDD-based operations are faster than other schemes used to images.

关 键 词：有序二元判定图 二值图 集合运算 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]