Abstract
This paper proposes a new possible way to represent a symbolic graph pyramid built by successive applications of some rules. This representation is targeted for learning the rules, since it contains information about which rules were applied, but also because it can be used to easily define the space of all possible pyramids as a reduction tree. We also consider restraining the possible rules to some basic ones in order to make the reduction trees easy to build, and a way to use them for learning will be presented.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Duchesnay, E.: Agents situés dans l’image organisés en pyramide irrégulière, contribution à la segmentation par une approche d’agrégation coopérative et adaptative. PhD thesis, Laboratoire de Traitement du Signal et de l’Image, University of Rennes I, France (2001)
Hancock, E., Vento, M. (eds.): GbRPR 2003. LNCS, vol. 2726. Springer, Heidelberg (2003)
Jolion, J.M., Montanvert, A.: The adaptive pyramid: a framework for 2D image analysis. Computer Vision, Graphics, and Image Processing: Image Understanding 55(3), 339–348 (1992)
Kropatsch, W.G.: Building irregular pyramids by dual graph contraction. IEEE Proc. Vision, Image and Signal Processing 142(6), 366–374 (1995)
Meer, P.: Stochastic image pyramids. Computer Vision, Graphics, and Image Processing 45(3), 269–294 (1989)
Melki, M., Jolion, J.M.: Building of symbolic hierarchical graphs for feature extraction. In: Hancock, E., Vento, M. (eds.) 4th IAPR International Workshop on Graph-Based Representations in Pattern Recognition, pp. 44–58. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Melki, M., Jolion, JM. (2005). Reduction Strings: A Representation of Symbolic Hierarchical Graphs Suitable for Learning. In: Brun, L., Vento, M. (eds) Graph-Based Representations in Pattern Recognition. GbRPR 2005. Lecture Notes in Computer Science, vol 3434. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31988-7_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-31988-7_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25270-2
Online ISBN: 978-3-540-31988-7
eBook Packages: Computer ScienceComputer Science (R0)