| 利用四叉树编码的快速二值图像逻辑运算方法 |
| |
| 引用本文： | 郭斯羽,周卫方,温和,梁梦霞.利用四叉树编码的快速二值图像逻辑运算方法[J].电子测量与仪器学报,2016,30(6):845-853. |
| |
| 作者姓名： | 郭斯羽 周卫方 温和 梁梦霞 |
| |
| 作者单位： | 湖南大学 电气与信息工程学院 长沙410082 |
| |
| 基金项目： | 国家自然科学基金(61471167 |
| |
| 摘 要： | 提出了一种快速的二值图像逻辑运算方法。二值图像被转换为四叉树,然后对四叉树进行深度优先遍历,根据遍历顺序将每个四叉树节点编码,避免树结构中指针带来的额外开销。在四叉树编码上给出了二值图像常用逻辑运算的等价操作。在自然场景实验图像集上,所提方法的速度比逐像素逻辑运算快5倍,比基于二值图像块表示和插值二分树表示的方法分别快3个和5个数量级;在叶片中轴检测应用中,利用所提方法的检测速度比利用逐像素运算的检测速度快3倍。所提出的方法适用于二值图像已被表达为四叉树或四叉树编码的情况,以及所需逻辑运算次数远大于表达形式转换次数的情况。
|
| 关 键 词： | 二值图像 逻辑运算 四叉树 深度搜索 中轴检测 |
Fast binary image logical operation method using quadtree coding |
| |
| Guo Siyu,Zhou Weifang,Wen He and Liang Mengxia.Fast binary image logical operation method using quadtree coding[J].Journal of Electronic Measurement and Instrument,2016,30(6):845-853. |
| |
| Authors: | Guo Siyu Zhou Weifang Wen He and Liang Mengxia |
| |
| Affiliation: | College of Electrical and Information Engineering, Hunan University, Changsha 410082, China,College of Electrical and Information Engineering, Hunan University, Changsha 410082, China,College of Electrical and Information Engineering, Hunan University, Changsha 410082, China and College of Electrical and Information Engineering, Hunan University, Changsha 410082, China |
| |
| Abstract: | A fast binary image logical operation method is proposed. The binary images are converted into the quadtree representations, which are subsequently traversed by a depth first search strategy. The tree nodes of the quadtree are encoded in the traversal order, the use of the pointers in the tree structure is spared. The manipulations on the quadtree based codes that are equivalent to the binary image logical operations are presented. On a natural scene image set, the proposed method is 5 times faster than the commonly used pixel by pixel logical operations, and is faster than a block representation based method and an interpolation based bintree based method by 3 and 5 magnitudes, respectively. In a plant leaf medial axis detection application, the proposed method is 3 times faster than the pixel by pixel approach. The presented method is suitable for applications where the binary images are already represented in quadtree or quadtree based codes, as well as for applications where the number of required logical operations is much larger than the number of conversions between binary images and quadtree based codes. |
| |
| Keywords: | binary image logical operations quadtree depth-first search medial axis detection |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《电子测量与仪器学报》浏览原始摘要信息 |
|
点击此处可从《电子测量与仪器学报》下载全文 |
|
