Inexact graph matching for model-based recognition: Evaluation and comparison of optimization algorithms

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.

[1]  Maja Pantic,et al.  Automatic Analysis of Facial Expressions: The State of the Art , 2000, IEEE Trans. Pattern Anal. Mach. Intell..

[2]  Horst Bunke,et al.  Error Correcting Graph Matching: On the Influence of the Underlying Cost Function , 1999, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[4]  H. Muhlenbein,et al.  The Factorized Distribution Algorithm for additively decomposed functions , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[5]  Hyeonjoon Moon,et al.  The FERET evaluation methodology for face-recognition algorithms , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[6]  Rainer Herpers,et al.  An Attentive Processing Strategy for the Analysis of Facial Features , 1998 .

[7]  Max Henrion,et al.  Propagating uncertainty in bayesian networks by probabilistic logic sampling , 1986, UAI.

[8]  Isabelle Bloch,et al.  Fuzzy morphisms between graphs , 2002, Fuzzy Sets Syst..

[9]  Edwin R. Hancock,et al.  Deterministic search for relational graph matching , 1999, Pattern Recognit..

[10]  Paul A. Viola,et al.  MIMIC: Finding Optima by Estimating Probability Densities , 1996, NIPS.

[11]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[12]  J. A. Lozano,et al.  Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation , 2001 .

[13]  Steven Gold,et al.  A Graduated Assignment Algorithm for Graph Matching , 1996, IEEE Trans. Pattern Anal. Mach. Intell..

[14]  Aline Deruyver,et al.  Constraint Satisfaction Problem with Bilevel Constraint: Application to Interpretation of Over-Segmented Images , 1997, Artif. Intell..

[15]  Roberto Marcondes Cesar Junior,et al.  Inexact graph matching using stochastic optimization techniques for facial feature recognition , 2002, Object recognition supported by user interaction for service robots.

[16]  G. Sommer,et al.  Affine real-time face tracking using a wavelet network , 1999, Proceedings International Workshop on Recognition, Analysis, and Tracking of Faces and Gestures in Real-Time Systems. In Conjunction with ICCV'99 (Cat. No.PR00378).

[17]  Marek Skomorowski.  Use of random graph parsing for scene labelling by probabilistic relaxation , 1999, Pattern Recognit. Lett..

[18]  Celso C. Ribeiro,et al.  Model-Based Scene Recognition Using Graph Fuzzy Homomorphism Solved By Genetic Algorithm , 1999 .

[19]  Edwin R. Hancock,et al.  Matching delaunay graphs , 1997, Pattern Recognit..

[20]  Edwin R. Hancock,et al.  Symbolic graph matching with the EM algorithm , 1998, Pattern Recognit..

[21]  Heinz Mühlenbein,et al.  The Equation for Response to Selection and Its Use for Prediction , 1997, Evolutionary Computation.

[22]  Edwin R. Hancock,et al.  Graph Matching With a Dual-Step EM Algorithm , 1998, IEEE Trans. Pattern Anal. Mach. Intell..

[23]  Horst Bunke,et al.  Efficient Subgraph Isomorphism Detection: A Decomposition Approach , 2000, IEEE Trans. Knowl. Data Eng..

[24]  Andrew P. Sage,et al.  Uncertainty in Artificial Intelligence , 1987, IEEE Transactions on Systems, Man, and Cybernetics.

[25]  Isabelle Bloch,et al.  Solving Graph Matching with EDAs Using a Permutation-Based Representation , 2002, Estimation of Distribution Algorithms.

[26]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[27]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[28]  S. Baluja,et al.  Using Optimal Dependency-Trees for Combinatorial Optimization: Learning the Structure of the Search Space , 1997 .

[29]  Roberto Brunelli,et al.  Face Recognition: Features Versus Templates , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[30]  Isabelle Bloch,et al.  Inexact graph matching by means of estimation of distribution algorithms , 2002, Pattern Recognit..

[31]  Edwin R. Hancock,et al.  Convergence of a hill-climbing genetic algorithm for graph matching , 2000, Pattern Recognit..

[32]  Luciano da Fontoura Costa,et al.  Shape Analysis and Classification: Theory and Practice , 2000 .

[33]  Darrell Whitley,et al.  Genitor: a different genetic algorithm , 1988 .

[34]  Pedro Larrañaga,et al.  Estimation of Distribution Algorithms , 2002, Genetic Algorithms and Evolutionary Computation.

[35]  H. Mühlenbein,et al.  From Recombination of Genes to the Estimation of Distributions I. Binary Parameters , 1996, PPSN.

[36]  Luc Brun,et al.  Image Segmentation with Topological Maps and Inter-pixel Representation , 1998, J. Vis. Commun. Image Represent..

[37]  Edwin R. Hancock,et al.  A Bayesian compatibility model for graph matching , 1996, Pattern Recognit. Lett..

[38]  I. Bloch,et al.  A new definition for fuzzy attributed graph homomorphism with application to structural shape recognition in brain imaging , 1999, IMTC/99. Proceedings of the 16th IEEE Instrumentation and Measurement Technology Conference (Cat. No.99CH36309).

[39]  R.S. Feris,et al.  Efficient real-time face tracking in wavelet subspace , 2001, Proceedings IEEE ICCV Workshop on Recognition, Analysis, and Tracking of Faces and Gestures in Real-Time Systems.

[40]  Shumeet Baluja,et al.  A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning , 1994 .

[41]  Isabelle Bloch,et al.  First Results on Facial Feature Segmentation and Recognition using Graph Homomorphisms , 2001 .