Kronecker product graph matching.
From MaRDI portal
Recommendations
- Orthonormal kernel Kronecker product graph matching
- Non-Bayesian graph matching without explicit compatibility calculations
- Edit distance based kernel functions for attributed graph matching
- Graph matching based on dot product representation of graphs
- Subgraph transformations for the inexact matching of attributed relational graphs
Cites work
- A generalized Fock space framework for nonlinear system and signal analysis
- A graph distance measure for image analysis
- A New Probabilistic Relaxation Scheme
- A polynomial transform for matching pairs of weighted graphs
- A shortest augmenting path algorithm for dense and sparse linear assignment problems
- A surface-based approach to 3-D object recognition using a mean field annealing neural network
- An Algorithm for Subgraph Isomorphism
- An eigendecomposition approach to weighted graph matching problems
- Efficient subgraph isomorphism with `a priori' knowledge. Application to 3D reconstruction of buildings for cartography
- Graph matching: Fast candidate elimination using machine learning techniques
- Graph theory
- scientific article; zbMATH DE number 51019 (Why is no real title available?)
- Non-Bayesian graph matching without explicit compatibility calculations
- Nonlinear System Identification Based on a Fock Space Framework
- On the Foundations of Relaxation Labeling Processes
- Scene Labeling by Relaxation Operations
- Shape Matching Using Relaxation Techniques
- Subgraph error-correcting isomorphisms for syntactic pattern recognition
- Video indexing and similarity retrieval by largest common subgraph detection using decision trees
Cited in
(4)
This page was built for publication: Kronecker product graph matching.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1400491)