Kronecker product graph matching.

DOI10.1016/S0031-3203(03)00009-8zbMath1035.68110MaRDI QIDQ1400491

Barend Jacobus Van Wyk, Michaël Antonie Van Wyk

Publication date: 13 August 2003

Published in: Pattern Recognition (Search for Journal in Brave)

zbMATH Keywords

Pattern matchingGraph isomorphismGraph matchingImage matching

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Related Items (2)

Attributed relational graph matching based on the nested assignment structure ⋮ A spectral-multiplicity-tolerant approach to robust graph matching

Cites Work

• A shortest augmenting path algorithm for dense and sparse linear assignment problems
• Video indexing and similarity retrieval by largest common subgraph detection using decision trees
• A polynomial transform for matching pairs of weighted graphs
• On the Foundations of Relaxation Labeling Processes
• Nonlinear System Identification Based on a Fock Space Framework
• A graph distance measure for image analysis
• A generalized Fock space framework for nonlinear system and signal analysis
• An eigendecomposition approach to weighted graph matching problems
• Shape Matching Using Relaxation Techniques
• A New Probabilistic Relaxation Scheme
• Subgraph error-correcting isomorphisms for syntactic pattern recognition
• An Algorithm for Subgraph Isomorphism
• Scene Labeling by Relaxation Operations
• A surface-based approach to 3-D object recognition using a mean field annealing neural network
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Kronecker product graph matching.