基于格雷码的NAM彩色图像表示方法  

Color Image Representation Method Using NAM Based on Gray Code

作　　者：郑运平[1] 

机构地区：[1]华南理工大学计算机科学与工程学院,广州510006

出　　处：《计算机科学》2010年第10期263-266,270,共5页Computer Science

基　　金：863国家重点基金项目(2006AA04Z211)资助

摘　　要：提出了一个重要定理,即所有格雷码(GrayCode)位面图的复杂性之和小于所有二值位面图的复杂性之和,并将格雷码应用到基于NAM的彩色图像表示方法中,提出了一种基于格雷码的NAM彩色图像表示方法(简称为GNAM表示方法)。给出了GNAM表示算法的形式化描述,并对其存储结构、总数据量和时空复杂性进行了详细的分析。理论分析和实验结果均表明,与无格雷码的NAM表示方法和经典的线性四元树表示方法相比,GNAM表示方法具有更少的子模式数(或节点数),能够更有效地减少数据存储空间,是一种有效的彩色图像表示方法。An important theorem was proposed which proves that the complexity sum of all bit-plane images based on the gray code is less than that based on the binary code.A new color image representation method using the Non-symmetry and Anti-packing pattern representation Model（NAM）based on the gray code,which is called the GNAM representation method,was proposed by applying the gray code to the NAM-based color image representation method.Also,a concrete algorithm of the GNAM for color images was presented and the storage structure,the total data amount,and the time and space complexities of the proposed algorithm were analyzed in detail.By comparing the algorithm of the GNAM with those of the classic linear quadtree（LQT）and the latest NAM which is not based on the gray code,the theoretical and experimental results show that the former can greatly reduce the numbers of subpatterns or nodes and simultaneously save the storage room much more effectively than the latters,and therefore it is a better method to represent color images.

关 键 词：格雷码 NAM 彩色图像表示 线性四元树 位平面分解 

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