梁梦霞,郭斯羽,刘敏,凌志刚,温和.二值图像截断四叉树编码及快速逻辑运算方法[J].电子测量与仪器学报,2017,31(11):1702-1710
二值图像截断四叉树编码及快速逻辑运算方法
Encoding and fast logical operation method for binary image based on truncated quadtree
  
DOI:10.13382/j.jemi.2017.11.002
中文关键词:  四叉树  截断四叉树  二值图像  逻辑运算  深度搜索
英文关键词:quadtree  truncated quadtree  binary image  logical operations  depth first search
基金项目:国家自然科学基金(61471167,61301254,61471166)资助项目
作者单位
梁梦霞 湖南大学电气与信息工程学院长沙410082 
郭斯羽 湖南大学电气与信息工程学院长沙410082 
刘敏 湖南大学电气与信息工程学院长沙410082 
凌志刚 湖南大学电气与信息工程学院长沙410082 
温和 湖南大学电气与信息工程学院长沙410082 
AuthorInstitution
Liang Mengxia College of Electrical and Information Engineering, Hunan University, Changsha 410082, China 
Guo Siyu College of Electrical and Information Engineering, Hunan University, Changsha 410082, China 
Liu Min College of Electrical and Information Engineering, Hunan University, Changsha 410082, China 
Ling Zhigang College of Electrical and Information Engineering, Hunan University, Changsha 410082, China 
Wen He College of Electrical and Information Engineering, Hunan University, Changsha 410082, China 
摘要点击次数: 368
全文下载次数: 298
中文摘要:
      提出了二值图像的截断四叉树结构,限定四叉树展开到指定的小图像块而非单像素水平;二值图像主体结构通过较少的树节点表示,而非单色小图像块则利用原始图像像素表达。通过四叉树和小图像块的结合,使得截断四叉树表达的总空间效率高于完全四叉树和原始二值图像。按深度优先的方式遍历截断四叉树,并分别对四叉树节点和小图像块的原始像素进行编码以获得基于截断四叉树的二值图像编码。给出了用于截断四叉树编码的逻辑运算方法。在实际图像上的实验表明,选择适当的截断层数,可以使截断四叉树编码的空间开销降到原始二值图像的1/10~1/3,而逻辑运算的运行时间则普遍降到了逐像素逻辑运算的1/5以下。所提方法适用于二值图像待进行的逻辑运算次数远大于编解码次数的应用场合。
英文摘要:
      The structure of truncated quadtree for binary image is proposed. The collapse of quadtree is performed until the level of small image block of a given size rather than single pixel. The main structure of a binary image is represented by a relative small number of quadtree nodes, and for the small image blocks with mixed colors, they are represented by their raw image pixels. The combination of quadtree and raw image blocks leads to the higher representation efficiency of the truncated quadtree. The truncated quadtree is traversed in a depth first manner, and the quadtree nodes and raw image blocks are respectively encoded in the order of traversal, resulting in the truncated quadtree based codes of the binary image. The equivalent forms of binary image logical operations on the codes are presented. The experimental results on real world images show that, with a proper truncating level setting, the memory cost of the truncated quadtree based code is 1/10 to 1/3 of the cost of the raw binary image, and the logical operation time on the code is below 1/5 of that of the pixel by pixel approach. The proposed methods are suitable for applications where the number of logical operation is significantly larger than the number of encoding and decoding.
查看全文  查看/发表评论  下载PDF阅读器