Reduction strings: a representation of symbolic hierarchical graphs suitable for learning

Authors:
Mickaël Melki;Jean-Michel Jolion
Affiliations:
Lyon Research Center for Images and Information Systems (LIRIS), Bât. J. Verne, INSA Lyon, Villeurbanne Cedex, France;Lyon Research Center for Images and Information Systems (LIRIS), Bât. J. Verne, INSA Lyon, Villeurbanne Cedex, France
Venue:
GbRPR'05 Proceedings of the 5th IAPR international conference on Graph-Based Representations in Pattern Recognition
Year:
2005

Citing 4
Cited 0

Stochastic image pyramids

Computer Vision, Graphics, and Image Processing
The adaptive pyramid: a framework for 2D image analysis

CVGIP: Image Understanding
Proceedings of the 4th IAPR international conference on Graph based representations in pattern recognition

GbRPR'03 Proceedings of the 4th IAPR international conference on Graph based representations in pattern recognition
Building of symbolic hierarchical graphs for feature extraction

GbRPR'03 Proceedings of the 4th IAPR international conference on Graph based representations in pattern recognition

Quantified Score

Hi-index	0.00

Visualization

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.