Graph attribute embedding via Riemannian submersion learning

In this paper, we tackle the problem of embedding a set of relational structures into a metric space for purposes of matching and categorisation. To this end, we view the problem from a Riemannian perspective and make use of the concepts of charts on the manifold to define the embedding as a mixture of class-specific submersions. Formulated in this manner, the mixture weights are recovered using a probability density estimation on the embedded graph node coordinates. Further, we recover these class-specific submersions making use of an iterative trust-region method so as to minimise the L2 norm between the hard limit of the graph-vertex posterior probabilities and their estimated values. The method presented here is quite general in nature and allows tasks such as matching, categorisation and retrieval. We show results on graph matching, shape categorisation and digit classification on synthetic data, the MNIST dataset and the MPEG-7 database.

[1]  Shun-ichi Amari,et al.  Methods of information geometry , 2000 .

[2]  Shigeo Abe DrEng.  Pattern Classification , 2001, Springer London.

[3]  S. Ullman,et al.  Filling-in the gaps: The shape of subjective contours and a model for their generation , 1976, Biological Cybernetics.

[4]  Andrew K. C. Wong,et al.  Entropy and Distance of Random Graphs with Application to Structural Pattern Recognition , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  D. Marquardt.  An Algorithm for Least-Squares Estimation of Nonlinear Parameters , 1963 .

[6]  Edwin R. Hancock,et al.  Structural Graph Matching Using the EM Algorithm and Singular Value Decomposition , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[7]  Yoshua Bengio,et al.  Gradient-based learning applied to document recognition , 1998, Proc. IEEE.

[8]  Mihran Tuceryan,et al.  Relative sensitivity of a family of closest-point graphs in computer vision applications , 1991, Pattern Recognit..

[9]  Andrew Ranicki,et al.  Algebraic L-theory and Topological Manifolds , 1993 .

[10]  U. Feige,et al.  Spectral Graph Theory , 2015 .

[11]  Stephan R. Sain,et al.  Multi-dimensional Density Estimation , 2004 .

[12]  Edwin R. Hancock,et al.  Bayesian graph edit distance , 1999, Proceedings 10th International Conference on Image Analysis and Processing.

[13]  Ulrich Eckhardt,et al.  Shape descriptors for non-rigid shapes with a single closed contour , 2000, Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No.PR00662).

[14]  Sven J. Dickinson,et al.  Many-to-Many Feature Matching Using Spherical Coding of Directed Graphs , 2004, ECCV.

[15]  Kenneth Levenberg.  A METHOD FOR THE SOLUTION OF CERTAIN NON – LINEAR PROBLEMS IN LEAST SQUARES , 1944 .

[16]  Shinji Umeyama,et al.  An Eigendecomposition Approach to Weighted Graph Matching Problems , 1988, IEEE Trans. Pattern Anal. Mach. Intell..

[17]  S T Roweis,et al.  Nonlinear dimensionality reduction by locally linear embedding. , 2000, Science.

[18]  N. Otsu.  A threshold selection method from gray level histograms , 1979 .

[19]  Horst Bunke,et al.  A decision tree approach to graph and subgraph isomorphism detection , 1999, Pattern Recognit..

[20]  Pietro Perona,et al.  A Bayesian hierarchical model for learning natural scene categories , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[21]  Richard O. Duda,et al.  Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.

[22]  Jitendra Malik,et al.  Shape matching and object recognition using shape contexts , 2010, 2010 3rd International Conference on Computer Science and Information Technology.

[23]  Heinrich Niemann,et al.  2D-Object Tracking Based on Projection-Histograms , 1998, ECCV.

[24]  John Odentrantz,et al.  Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues , 2000, Technometrics.

[25]  Brian L. Joiner,et al.  Evaluation of Cryogenic Flow Meters: An Example in Non-Standard Experimental Design and Analysis , 1977 .

[26]  King-Sun Fu,et al.  A graph distance measure for image analysis , 1984, IEEE Transactions on Systems, Man, and Cybernetics.

[27]  Josef Kittler,et al.  Discrete relaxation , 1990, Pattern Recognit..

[28]  Tao Jiang,et al.  Efficient and robust feature extraction by maximum margin criterion , 2003, IEEE Transactions on Neural Networks.

[29]  Jonathan L. Gross,et al.  Topological Graph Theory , 1987, Handbook of Graph Theory.

[30]  Philip N. Klein,et al.  Shock-Based Indexing into Large Shape Databases , 2002, ECCV.

[31]  Pavel Pudil,et al.  Introduction to Statistical Pattern Recognition , 2006 .

[32]  Edwin R. Hancock,et al.  An expectation-maximisation framework for segmentation and grouping , 2002, Image Vis. Comput..

[33]  Alla Sheffer,et al.  Fundamentals of spherical parameterization for 3D meshes , 2003, ACM Trans. Graph..

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

[35]  Robert M. Haralick,et al.  A Metric for Comparing Relational Descriptions , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[36]  Ben Taskar,et al.  Learning associative Markov networks , 2004, ICML.

[37]  J. J. McGregor,et al.  Backtrack search algorithms and the maximal common subgraph problem , 1982, Softw. Pract. Exp..

[38]  G. Levi.  A note on the derivation of maximal common subgraphs of two directed or undirected graphs , 1973 .

[39]  Mikhail Belkin,et al.  Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering , 2001, NIPS.

[40]  R. Levinson.  PATTERN ASSOCIATIVITY AND THE RETRIEVAL OF SEMANTIC NETWORKS , 1991 .

[41]  I. Chavel.  Riemannian Geometry: Subject Index , 2006 .

[42]  Horst Bunke,et al.  Classes of cost functions for string edit distance , 2006, Algorithmica.

[43]  Edwin R. Hancock,et al.  A Riemannian approach to graph embedding , 2007, Pattern Recognit..

[44]  H. C. Longuet-Higgins,et al.  An algorithm for associating the features of two images , 1991, Proceedings of the Royal Society of London. Series B: Biological Sciences.

[45]  Philip H. S. Torr,et al.  The Development and Comparison of Robust Methods for Estimating the Fundamental Matrix , 1997, International Journal of Computer Vision.

[46]  Timothy F. Cootes,et al.  Active Shape Models-Their Training and Application , 1995, Comput. Vis. Image Underst..

[47]  Radu Horaud,et al.  Stereo Correspondence Through Feature Grouping and Maximal Cliques , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[48]  Zhi-Hua Zhou,et al.  On the relation between multi-instance learning and semi-supervised learning , 2007, ICML '07.

[49]  David G. Stork,et al.  Pattern Classification , 1973 .

[50]  J. Tenenbaum,et al.  A global geometric framework for nonlinear dimensionality reduction. , 2000, Science.

[51]  P. Ryan.  Euclidean and Non-Euclidean Geometry: An Analytic Approach , 1986 .

[52]  L. Breiman,et al.  Variable Kernel Estimates of Multivariate Densities , 1977 .

[53]  Patrick J. F. Groenen,et al.  Modern Multidimensional Scaling: Theory and Applications , 2003 .

[54]  Edwin R. Hancock,et al.  Structural Matching by Discrete Relaxation , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[55]  D K Smith,et al.  Numerical Optimization , 2001, J. Oper. Res. Soc..

[56]  Herbert Busemann,et al.  The geometry of geodesics , 1955 .

[57]  T. Willmore.  Algebraic Geometry , 1973, Nature.

[58]  Terry Caelli,et al.  An eigenspace projection clustering method for inexact graph matching , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[59]  Yoav Freund,et al.  A decision-theoretic generalization of on-line learning and an application to boosting , 1995, EuroCOLT.

[60]  Mubarak Shah,et al.  Shape matching and modeling using skeletal context , 2008, Pattern Recognit..

[61]  William J. Christmas,et al.  Structural Matching in Computer Vision Using Probabilistic Relaxation , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[62]  P. Kohli,et al.  Efficiently solving dynamic Markov random fields using graph cuts , 2005, Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1.

[63]  Alexander J. Smola,et al.  Learning Graph Matching , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[64]  Keinosuke Fukunaga,et al.  Introduction to statistical pattern recognition (2nd ed.) , 1990 .

[65]  Robert E. Mahony,et al.  Optimization Algorithms on Matrix Manifolds , 2007 .

[66]  Michael Brady,et al.  Feature-based correspondence: an eigenvector approach , 1992, Image Vis. Comput..

[67]  King-Sun Fu,et al.  A distance measure between attributed relational graphs for pattern recognition , 1983, IEEE Transactions on Systems, Man, and Cybernetics.