A novel algorithm for triangle non-symmetry and anti-packing pattern representation model of gray images

22Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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 Nonsymmetry 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. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Zheng, Y., Chen, C., & Sarem, M. (2007). A novel algorithm for triangle non-symmetry and anti-packing pattern representation model of gray images. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4681 LNCS, pp. 832–841). Springer Verlag. https://doi.org/10.1007/978-3-540-74171-8_83

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free