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

Abstract: 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(LQ7)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.

Key words: Gray code, Non-symmetry and anti-packing model, Color image representation, I_incar quadtrec, Bit plane decomposition