直接三角形和矩形NAM的灰度图像表示算法  

A gray image representation algorithm by using the direct triangle and rectangle non-symmetry and anti-packing model

作　　者：郑运平[1] 陈传波[1] 

机构地区：[1]华中科技大学计算机科学与技术学院,湖北武汉430074

出　　处：《华中科技大学学报（自然科学版）》2008年第9期1-4,共4页Journal of Huazhong University of Science and Technology(Natural Science Edition)

基　　金：国家高技术研究发展计划资助项目(2006AA04Z211)

摘　　要：分析了三角形非对称递布局模型(NAM)、矩形NAM和线性四元树表示算法,借助于三角形和矩形布局问题的思想,提出了一种直接三角形和矩形NAM(TRNAM)的灰度图像表示算法.通过描述三角形和矩形子模式的存储结构,给出了该算法数据量的理论分析.实验结果表明:与直接三角形NAM表示、直接矩形NAM表示和线性四元树表示算法相比,直接三角形和矩形NAM表示算法能够更有效地减少子模式数(节点数)和数据存储空间,是灰度图像模式的一种更优的表示方法,这种表示方法在降低存储空间、加快传输速度、提高模式匹配效率等方面具有理论参考意义和实际应用价值.A gray image representation algorithm by using the direct triangle and rectangle non-symmetry and anti-packing model （NAM） is proposed after the algorithms of the direct triangle NAM （TNAM）, the direct rectangle NAM （RNAM）, and the linear quadtree were analyzed. The storage structures of the triangle and the rectangle are described and the total data amount of the proposed al- gorithm is analyzed. The experimental results show that the proposed algorithm can greatly reduce the numbers of subpatterns or nodes and simultaneously save the storage room much more effectively than the algorithms of the popular linear quadtree, the TNAM, and the RNAM. Therefore, the proposed algorithm is a better method to represent the gray image pattern. The method is valuable for the theoretical research and potential practical values such as reducing storage room, increasing transmission speed, improving pattern match efficiency and so on.

关 键 词：图像表示 灰度图像 非对称逆布局模型 图像复杂度 线性四元树 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]