Improved Achievability and Converse Bounds for Erdős-Rényi Graph Matching.
Daniel CullinaNegar KiyavashPublished in: CoRR (2016)
Keyphrases
- graph matching
- graph matching algorithm
- pattern recognition
- graph edit distance
- error tolerant
- lower bound
- pairwise
- object recognition
- matching algorithm
- matching accuracy
- tree matching
- pattern matching
- edit distance
- inexact graph matching
- upper bound
- point sets
- image matching
- subgraph isomorphism
- adjacency matrix
- replicator dynamics
- computer vision and machine learning
- vector space
- object representation
- attributed graphs
- viewpoint
- computer vision
- machine learning
- data mining