A Bayesian compatibility model for graph matching
Pattern Recognition Letters
A Graduated Assignment Algorithm for Graph Matching
IEEE Transactions on Pattern Analysis and Machine Intelligence
Graph Matching With a Dual-Step EM Algorithm
IEEE Transactions on Pattern Analysis and Machine Intelligence
Error Correcting Graph Matching: On the Influence of the Underlying Cost Function
IEEE Transactions on Pattern Analysis and Machine Intelligence
Use of random graph parsing for scene labelling by probabilistic relaxation
Pattern Recognition Letters
The FERET Evaluation Methodology for Face-Recognition Algorithms
IEEE Transactions on Pattern Analysis and Machine Intelligence
Automatic Analysis of Facial Expressions: The State of the Art
IEEE Transactions on Pattern Analysis and Machine Intelligence
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Shape Analysis and Classification: Theory and Practice
Shape Analysis and Classification: Theory and Practice
Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation
Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation
Fuzzy morphisms between graphs
Fuzzy Sets and Systems
Efficient Subgraph Isomorphism Detection: A Decomposition Approach
IEEE Transactions on Knowledge and Data Engineering
Face Recognition: Features Versus Templates
IEEE Transactions on Pattern Analysis and Machine Intelligence
From Recombination of Genes to the Estimation of Distributions I. Binary Parameters
PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
Affine Real-Time Face Tracking Using a Wavelet Network
RATFG-RTS '99 Proceedings of the International Workshop on Recognition, Analysis, and Tracking of Faces and Gestures in Real-Time Systems
Population-Based Incremental Learning: A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning
Efficient Real-Time Face Tracking in Wavelet Subspace
RATFG-RTS '01 Proceedings of the IEEE ICCV Workshop on Recognition, Analysis, and Tracking of Faces and Gestures in Real-Time Systems (RATFG-RTS'01)
The equation for response to selection and its use for prediction
Evolutionary Computation
Exploiting temporal statistics for events analysis and understanding
Image and Vision Computing
Structural matching of 2D electrophoresis gels using deformed graphs
Pattern Recognition Letters
Estimation of distribution algorithm for permutation flow shops with total flowtime minimization
Computers and Industrial Engineering
Computers and Operations Research
Isomorphism Testing via Polynomial-Time Graph Extensions
Journal of Mathematical Modelling and Algorithms
Segmentation of similar images using graph matching and community detection
GbRPR'11 Proceedings of the 8th international conference on Graph-based representations in pattern recognition
Interactive image segmentation by matching attributed relational graphs
Pattern Recognition
Expert Systems with Applications: An International Journal
Computer Vision and Image Understanding
Social networks profile mapping using games
WebApps'12 Proceedings of the 3rd USENIX conference on Web Application Development
A constraint propagation approach to structural model based image segmentation and recognition
Information Sciences: an International Journal
Near-duplicate document image matching: A graphical perspective
Pattern Recognition
Hi-index | 0.01 |
A method for segmentation and recognition of image structures based on graph homomorphisms is presented in this paper. It is a model-based recognition method where the input image is over-segmented and the obtained regions are represented by an attributed relational graph (ARG). This graph is then matched against a model graph thus accomplishing the model-based recognition task. This type of problem calls for inexact graph matching through a homomorphism between the graphs since no bijective correspondence can be expected, because of the over-segmentation of the image with respect to the model. The search for the best homomorphism is carried out by optimizing an objective function based on similarities between object and relational attributes defined on the graphs. The following optimization procedures are compared and discussed: deterministic tree search, for which new algorithms are detailed, genetic algorithms and estimation of distribution algorithms. In order to assess the performance of these algorithms using real data, experimental results on supervised classification of facial features using face images from public databases are presented.