Abstract
In this paper, we define graph compression rules for the graphs representing two-dimensional rectangular grids with black and white pixels by making use of the PCE way of embedding. The compression rules rewrite four nodes having same label and forming a square into a node with the label. It also inserts and deletes nodes with special labels to preserve the neighborhood relations in the original image. Then we introduce an image compression algorithm using the concept of our graph compression rules. We show that the time complexity of our algorithm is O(Nlog2N), where N is the number of the black nodes of input graph, which is same as the case of the best quadtree representation.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Ehrig, H., M. Nagl and G. Rozenberg (ed.): Graph-Grammars and Their Application to Computer Science, Lecture Notes in Computer Science, 153, Springer-Verlag, Berlin, 1983.
Ehrig, H., M. Nagl, G. Rozenberg and A. Rosenfeld (ed.): Graph-Grammars and Their Application to Computer Science, Lecture Notes in Computer Science, 291, Springer-Verlag, Berlin, 1987.
Ehrig, H., H.-J. Kreowski and G. Rozenberg (ed.): Graph Grammars and Their Application to Computer Science, Lecture Notes in Computer Science, 532, Springer-Verlag, 1991.
Aizawa, K. and A. Nakamura: Graph grammars with path controlled embedding, Theoretical Computer Science, 88, pp. 151–170, 1991.
Nagl, M.: Eine praezisierung des Pfaltz/Rosenfeldschen produktionsbegriffs bei mehrdimensionalen grammatiken, Arbeitsber. d. Inst. f. Math. Masch. u. Datenver, 6, 3, pp. 56–71, Universität Erlangen-Nümberg, 1973.
Nagl, M.: Formal sprachen von marikierten graphen, Arbeitsber. d. Inst. f. Math. Masch. u. Datenver., 7, 4, Universität Erlangen-Nürnberg, 1974.
Nagl, M.: Graph-Grammatiken: Theorie Implementierung Anwendeungen, Vieweg, 1979.
Samet, H.: A tutorial on quadtree research, in A. Rosenfeld (ed.), Multiresolution Image Processing and Analysis, Springer-Verlag, Berlin, pp. 1984.
Samet, H.: The Design and Analysis of Spatial Data Structures, Addison Wesley, New York, 1990.
Saudi, A.: Parallel recognition of multidimensional images using regular tree grammars, Lecture Notes in Computer Science, 654, pp. 231–239, 1992.
Shi, Q. Y. and K. S. Fu: Parsing and translation of attributed expansive graph languages for scene analysis, IEEE Transaction on Pattern Analysis and Machine Intelligence, PAMI-5, pp. 472–485, 1983.
Aizawa, K. and A. Nakamura: Pathe-controlled graph grammars for syntactic pattern recognition, Lecture Notes in Conputer Science, 654, pp. 37–53, 1992.
Mylopoulos, J. P. and T. Pavlidis: On the topological properties of quantized spaces, Journal of the Association for Computing Machinery, 18, pp. 239–254, 1971.
Gargantini, I.: An effective way to represent quadtrees, Cmmunications of the ACM, 25, pp. 905–910, 1982.
Hunter, G. M. and K. Steiglitz: Operations on images using quad trees, PAMI-1, pp. 145–153, 1979.
Li, M., W. I. Grosky and R. Jain: Normalized quadtrees with respect to translations, Computer Graphics and Image Processing, 20, pp. 72–81, 1982.
Jones, L. and S. S. Iyengar: Representation of regions as a forest of quadtrees, Proc. of Pattern Recognition and Image Processing Conference, Dallas, pp. 57–59, 1981
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aizawa, K., Nakamura, A. (1994). Path-controlled graph grammars for multiresolution image processing and analysis. In: Schneider, H.J., Ehrig, H. (eds) Graph Transformations in Computer Science. Lecture Notes in Computer Science, vol 776. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57787-4_1
Download citation
DOI: https://doi.org/10.1007/3-540-57787-4_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57787-4
Online ISBN: 978-3-540-48333-5
eBook Packages: Springer Book Archive