摘要
对利用有序二元判定图 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.
出处
《计算机科学与探索》
CSCD
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~~
关键词
有序二元判定图
二值图
集合运算
ordered binary decision diagram （OBDD）
binary images
set operations
