Abstract
The triangle packing problem has yielded many significant theories and applications such as textile cutting and container stuffing. Although the representation method of the popular linear quadtree has many merits, it puts too much emphasis upon the symmetry of image segmentation. Therefore, it is not the optimal representation method. In this paper, inspired by the concept of the triangle packing problem, we present a Triangle Non-symmetry and Anti-packing pattern representation Model (TNAM). Also, we propose a novel algorithm for the TNAM of the gray images. By comparing the algorithm for the TNAM with that for the linear quadtree, the theoretical and experimental results show that the former is much more effective than the latter and is a better method to represent the gray images. The algorithm for the TNAM of the gray images is valuable for the theoretical research and potential business foreground.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chen, C.B., He, D.H.: The Computational Complexity of Packing Problems. Computer Engineering and Science 27, 46–48 (2005)
Chen, C.B., He, D.H.: Heuristic Method for Solving Triangle Packing Problem. Journal of Zhejiang University 6, 565–570 (2005)
Krivelevich, M.: On a Conjecture of Tuza about Packing and Covering of Triangles. Discrete Mathematics 142, 281–286 (1995)
Chen, C.B., He, D.H., Huang, W.Q.: An Approximation Algorithm for Solving the Problem of Packing Unit Equilateral Triangles in a Square. Chinese Journal of Computers 26, 212–220 (2003)
Laguardia, J.J., Cueto, E., Doblare, M.: A Natural Neighbour Galerkin Method with Quadtree Structure. International Journal for Numerical Methods in Engineering 63, 789–812 (2005)
Minglun, G., Yee-Hong, Y.: Quadtree-based Genetic Algorithm and its Applications to Computer Vision. Pattern Recognition 37, 1723–1733 (2004)
Klinger, A.: Data Structure and Pattern Recognition. In: Proceeding of IJCPR. Washington, DC, pp. 497-498 (1973)
Gargantini, I.: An Effective Way to Represent Quadtrees. Comm. ACM. 25, 905–910 (1982)
Wang, C.L., Wu, S.C., Chang, Y.K.: Quadtree and Statistical Model-based Lossless Binary Image Compression Method. Imaging Science Journal 53, 95–103 (2005)
Laszlo, M., Mukherjee, S.: A Genetic Algorithm Using Hyper-quadtrees for Low-dimensional K-means Clustering. IEEE Transactions on Pattern Analysis and Machine Intelligence 28, 533–543 (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Zheng, Y., Chen, C., Sarem, M. (2007). A Novel Algorithm for Triangle Non-symmetry and Anti-packing Pattern Representation Model of Gray Images. In: Huang, DS., Heutte, L., Loog, M. (eds) Advanced Intelligent Computing Theories and Applications. With Aspects of Theoretical and Methodological Issues. ICIC 2007. Lecture Notes in Computer Science, vol 4681. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74171-8_83
Download citation
DOI: https://doi.org/10.1007/978-3-540-74171-8_83
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74170-1
Online ISBN: 978-3-540-74171-8
eBook Packages: Computer ScienceComputer Science (R0)