Algorithmic learning
Using consensus sequence voting to correct OCR errors
Computer Vision and Image Understanding
A New Algorithm for Error-Tolerant Subgraph Isomorphism Detection
IEEE Transactions on Pattern Analysis and Machine Intelligence
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
A String Based Method to Recognize Symbols and Structural Textures in Architectural Plans
GREC '97 Selected Papers from the Second International Workshop on Graphics Recognition, Algorithms and Systems
Genetic-based search for error-correcting graph isomorphism
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Symbol Recognition: Current Advances and Perspectives
GREC '01 Selected Papers from the Fourth International Workshop on Graphics Recognition Algorithms and Applications
Recent Advances in Structural Pattern Recognition with Applications to Visual Form Analysis
IWVF-4 Proceedings of the 4th International Workshop on Visual Form
ICAPR '01 Proceedings of the Second International Conference on Advances in Pattern Recognition
Bounding the Size of the Median Graph
IbPRIA '07 Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part II
Evaluation of Spectral-Based Methods for Median Graph Computation
IbPRIA '07 Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part II
Spectral median graphs applied to graphical symbol recognition
CIARP'06 Proceedings of the 11th Iberoamerican conference on Progress in Pattern Recognition, Image Analysis and Applications
| Hi-index | 0.00 |
Median is a general concept of capturing the essential information of a given set of objects. In this work we adopt this concept to the problem of learning, or synthesis, of representative graphical symbols from given examples. Graphical symbols are represented by graphs. This way the learning task is transformed into that of computing the generalized median of a given set of graphs, which is a novel graph matching problem and solved by a genetic algorithm.