A RKHS interpolator-based graph matching algorithm

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn 24, Issue 7, 2002, Pages 988-995

  Van Wyk, Michaël A ^a,b   Durrani, Tariq S ^a,c   Van Wyk, Barend J ^b  

^a IEEE   (South Africa)

^b UNIVERSITY OF JOHANNESBURG   (South Africa)

^c UNIVERSITY OF STRATHCLYDE   (United Kingdom)

Author keywords

Attributed relational graphs; Combinatorial optimization; Graph matching; Image processing; Neural networks; Pattern matching; Reproducing kernel Hilbert space theory

Indexed keywords

FUNCTIONALLY EXPANDED INTERPOLATORS; GRAPH MATCHING; REPRODUCING KERNEL HILBERT SPACE THEORY;

COMBINATORIAL MATHEMATICS; GRAPH THEORY; IMAGE PROCESSING; INTERPOLATION; NEURAL NETWORKS; OPTIMIZATION; PATTERN MATCHING; PROBLEM SOLVING;

ALGORITHMS;

EID: 0036646867     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPAMI.2002.1017624     Document Type: Article

References (56)

1. A framework for multi-scale and hybrid RKHS-based approximators
2. An algorithm for graph optimal isomorphism
3. Error-correcting isomorphisms of attributed relation graphs for pattern recognition
4. Subgraph error-correcting isomorphisms for syntactic pattern recognition
5. Graph matching using a direct classification of node attendance
6. A graph distance measure for image analysis
7. A graph distance metric based on the maximal common subgraph
8. Recent advances in graph matching
9. A parallel algorithm for graph matching and its MarPlas implementaion
10. Polynomial transform for matching pairs of weighted graphs
11. A linear programming approach for the weighted graph matching problem
12. An eigendecomposition approach to weighted graph matching problems
13. A lagrangian relaxation network for graph matching
14. Inexact matching using genetic search
15. Graph partitioning using annealed neural networks
16. Pattern recognition by labelled graph matching
17. Constrained nets for graph matching and other quadratic assignment problems
18. Algebraic transformations of objective functions
19. Relaxing by the Hopfield neural network
20. Invariant and occluded object recognition based on graph matching
21. Multiple elastic modules for visual pattern recognition
22. Optimization in model matching and perceptual organization
23. Relaxation applied to matching quantitative relational structures
24. Discrete relaxation for matching relational structures
25. Structural matching by discrete relaxation
26. Structural descriptions and inexact matching
27. On the foundations of relaxation labelling processes
28. Learning compatibility coefficients for relaxation labelling processes
29. Shape matching using relaxation techniques
30. A new probabilistic relaxation scheme
31. Structural matching in computer vision using probabilistic relaxation
32. A graduated assignment algorithm for graph matching
33. Symbolic matching with the EM algorithm
34. Multiple graph matching with Bayesian inference
35. Graph matching with a dual step EM algorithm
36. A Bayesian compatibility model for graph matching
37. The CGGM algorithm and its DSP implementation
38. An algorithm for approximate least-squares attributed graph matching
39. The spherical approximation graph matching algorithm
40. RKHS interpolator-based graph and subgraph matching algorithm
41. Matching hierarchical structures using association graphs
42. A system for approximate tree matching
43. A tree matching algorithm based on tree merging and node splitting
44. An algorithm for subtree identification
45. An analysis of a good algorithm for the subtree problem
46. Exact and approximate algorithms for unordered tree matching
47. Matching: Invariant to translations rotations and scale changes