An eigendecomposition approach to weighted graph matching problems
From MaRDI portal
Publication:3834090
DOI10.1109/34.6778zbMath0678.05049OpenAlexW2108182844MaRDI QIDQ3834090
Publication date: 1988
Published in: IEEE Transactions on Pattern Analysis and Machine Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/34.6778
Related Items
Graph simplification and matching using commute times, A dynamical systems approach to weighted graph matching, Statistical shape analysis of brain arterial networks (BAN), A polynomial transform for matching pairs of weighted graphs, A Riemannian approach to graph embedding, Attributed relational graph matching based on the nested assignment structure, Measuring similarity between connected graphs: the role of induced subgraphs and complementarity eigenvalues, An algorithm for weighted sub-graph matching based on gradient flows, A long trip in the charming world of graphs for pattern recognition, Approximation of graph edit distance based on Hausdorff matching, A quantum Jensen-Shannon graph kernel for unattributed graphs, Graph-based point drift: graph centrality on the registration of point-sets, A spectral-multiplicity-tolerant approach to robust graph matching, Shape-based object detection via boundary structure segmentation, Statistical graph space analysis, A fast projected fixed-point algorithm for large graph matching, Spectral graph matching and regularized quadratic relaxations. I: Algorithm and Gaussian analysis, NON-RIGID SPECTRAL CORRESPONDENCE OF TRIANGLE MESHES, Heat kernel embeddings, differential geometry and graph structure, Unsupervised learning for graph matching, Quantum walk inspired algorithm for graph similarity and isomorphism, Kronecker product graph matching., Efficient feature matching via nonnegative orthogonal relaxation, Graph matching by simplified convex-concave relaxation procedure, On spectral properties for graph matching and graph isomorphism problems, \texttt{Procrustes}: a python library to find transformations that maximize the similarity between matrices, sGDML: constructing accurate and data efficient molecular force fields using machine learning, Quadratic nonnegative matrix factorization, A gradient-type algorithm optimizing the coupling between matrices, Image categorization: Graph edit distance \(+\) edge direction histogram, A study of graph spectra for comparing graphs and trees, A general system for heuristic minimization of convex functions over non-convex sets, Graph Similarity and Approximate Isomorphism, Using local similarity measures to efficiently address approximate graph matching, On searching and indexing sequences of temporal intervals, Unnamed Item, Graph similarity scoring and matching, Spatial Pattern Discovering by Learning the Isomorphic Subgraph from Multiple Attributed Relational Graphs, A distance measure for large graphs based on prime graphs, Fuzzy morphisms between graphs, Spectral graph features for the classification of graphs and graph sequences, Algorithm for cataloging topologies in the common information model (CIM), A survey of graph edit distance, Generalized median graphs and applications, Correspondence matching using kernel principal components analysis and label consistency constraints, A spectral approach to learning structural variations in graphs, Machine learning problems from optimization perspective, Graph Similarity through Entropic Manifold Alignment, A quotient space formulation for generative statistical analysis of graphical data, Recognition of structure similarities in proteins, Sequential Monte Carlo for maximum weight subgraphs with application to solving image jigsaw puzzles, Graph matching using the interference of continuous-time quantum walks, Image matching from handcrafted to deep features: a survey, Efficient Suboptimal Graph Isomorphism, Inexact Matching of Large and Sparse Graphs Using Laplacian Eigenvectors, A new matching algorithm between trees of shapes and its application to brain tumor segmentation, APPROXIMATELY ISOMETRIC SHAPE CORRESPONDENCE BY MATCHING POINTWISE SPECTRAL FEATURES AND GLOBAL GEODESIC STRUCTURES, Toward Quantifying Vertex Similarity in Networks, Spatial pattern discovery by learning a probabilistic parametric model from multiple attributed relational graphs, Tail bounds for gaps between eigenvalues of sparse random matrices, Spectral correspondence for point pattern matching, Matching the LBO eigenspace of non-rigid shapes via high order statistics, Graph comparison via nonlinear quantum search
