A Direct Non-Symmetry and Anti-Packing Model for Color Images

The representation methods of the hierarchical data structures have been widely applied in many important fields, such as computer visualization, robotics, computer graphics, image processing, and pattern recognition. Since these methods put too much emphasis upon the symmetry of segmentation, they are not the optimal representation methods. In this paper, we present a direct non-symmetry and anti-packing model (DNAM) for color images. Also, we propose a novel algorithm of the DNAM for color images and analyze the data amount of the proposed algorithm. By taking a rectangle subpattern for example, we implement the proposed algorithm and make a comparison with the algorithm of the popular linear quadtree. The theoretical and experimental results presented in this paper show that our proposed algorithm can reduce the data storage much more effectively than that of the linear quadtree and it is a better method to represent color images.