We propose a novel binary image representation algorithm using the non-symmetry and anti-packing model and the coordinate encoding procedure （NAMCEP）. By tak- ing some idiomatic standard binary images in the field o...We propose a novel binary image representation algorithm using the non-symmetry and anti-packing model and the coordinate encoding procedure （NAMCEP）. By tak- ing some idiomatic standard binary images in the field of image processing as typical test objects, and by comparing our proposed NAMCEP representation with linear quadtree （LQT）, binary tree （Bintree）, non-symmetry and anti-packing model （NAM） with K-lines （NAMK）, and NAM representa- tions, we show that NAMCEP can not only reduce the aver- age node, but also simultaneously improve the average com- pression. We also present a novel NAMCEP-based algorithm for area calculation and show experimentally that our algo- rithm offers significant improvements.展开更多
Computing moments on images is very important in the fields of image processing and pattern recognition. The non-symmetry and anti-packing model （NAM） is a general pattern representation model that has been develope...Computing moments on images is very important in the fields of image processing and pattern recognition. The non-symmetry and anti-packing model （NAM） is a general pattern representation model that has been developed to help design some efficient image representation methods. In this paper, inspired by the idea of computing moments based on the S-Tree coding （STC） representation and by using the NAM and extended shading （NAMES） approach, we propose a fast algorithm for computing lower order moments based on the NAMES representation, which takes O（N） time where N is the number of NAM blocks. By taking three idiomatic standard gray images ＇Lena＇, ＇F16＇, and ＇Peppers＇ in tile field of image processing as typical test objects, and by comparing our proposed algorithm with the conventional algorithm and the popular STC representation algorithm for computing the lower order moments, the theoretical and experimental results presented in this paper show that the average execution time improvement ratios of the proposed NAMES approach over the STC approach, and also the conventional approach are 26.63%, and 82.57% respectively while maintaining the image quality.展开更多
非，对称和反收拾行李模式表示当模特儿(NAM ) ，由收拾行李的问题的概念启发了，使用一套子模式代表一个原来的模式。因为它集中于一幅图象的有趣的子集的能力， NAM 是为图象表示的一个有希望的方法。在这篇论文，我们基于 NAM 为灰...非，对称和反收拾行李模式表示当模特儿(NAM ) ，由收拾行李的问题的概念启发了，使用一套子模式代表一个原来的模式。因为它集中于一幅图象的有趣的子集的能力， NAM 是为图象表示的一个有希望的方法。在这篇论文，我们基于 NAM 为灰阶的图象表示开发一个新方法，叫的组织 NAM 的飞机分解(NAMPD ) ，在哪个每个子模式在图象与一个矩形的区域被联系。在这个区域的象素的发光性函数被一个倾斜的飞机模型接近。然后，我们基于 NAMPD 建议一个新、快的边察觉算法。因为它在子模式上允许操作的实行而不是象素，在这篇论文介绍的理论分析和试验性的结果证明用 NAMPD 的边察觉算法比古典的快表现。展开更多
基金We thank the anonymous reviewers and editors for their valuable comments on improving this paper. This work was supported by the National Natural Science Foundation of China （Grant No. 61300134）, the Research Fund for the Doctoral Program of Higher Education of China （20120172120036）, the Natural Science Foundation of Guangdong Province of China （S2011040005815 and S2013010012515）, the Foundation for Dis- tinguished Young Talents in Higher Education of Guangdong of China （LYM11015）, and the Fundamental Research Funds for the Central Universities of China （2011ZM0074 and 2013ZZ0050）.
文摘We propose a novel binary image representation algorithm using the non-symmetry and anti-packing model and the coordinate encoding procedure （NAMCEP）. By tak- ing some idiomatic standard binary images in the field of image processing as typical test objects, and by comparing our proposed NAMCEP representation with linear quadtree （LQT）, binary tree （Bintree）, non-symmetry and anti-packing model （NAM） with K-lines （NAMK）, and NAM representa- tions, we show that NAMCEP can not only reduce the aver- age node, but also simultaneously improve the average com- pression. We also present a novel NAMCEP-based algorithm for area calculation and show experimentally that our algo- rithm offers significant improvements.
文摘Computing moments on images is very important in the fields of image processing and pattern recognition. The non-symmetry and anti-packing model （NAM） is a general pattern representation model that has been developed to help design some efficient image representation methods. In this paper, inspired by the idea of computing moments based on the S-Tree coding （STC） representation and by using the NAM and extended shading （NAMES） approach, we propose a fast algorithm for computing lower order moments based on the NAMES representation, which takes O（N） time where N is the number of NAM blocks. By taking three idiomatic standard gray images ＇Lena＇, ＇F16＇, and ＇Peppers＇ in tile field of image processing as typical test objects, and by comparing our proposed algorithm with the conventional algorithm and the popular STC representation algorithm for computing the lower order moments, the theoretical and experimental results presented in this paper show that the average execution time improvement ratios of the proposed NAMES approach over the STC approach, and also the conventional approach are 26.63%, and 82.57% respectively while maintaining the image quality.
基金Supported by the National High Technology Research and Development Program of China (No. 2006AA04Z211)
文摘非，对称和反收拾行李模式表示当模特儿(NAM ) ，由收拾行李的问题的概念启发了，使用一套子模式代表一个原来的模式。因为它集中于一幅图象的有趣的子集的能力， NAM 是为图象表示的一个有希望的方法。在这篇论文，我们基于 NAM 为灰阶的图象表示开发一个新方法，叫的组织 NAM 的飞机分解(NAMPD ) ，在哪个每个子模式在图象与一个矩形的区域被联系。在这个区域的象素的发光性函数被一个倾斜的飞机模型接近。然后，我们基于 NAMPD 建议一个新、快的边察觉算法。因为它在子模式上允许操作的实行而不是象素，在这篇论文介绍的理论分析和试验性的结果证明用 NAMPD 的边察觉算法比古典的快表现。
