Fast and scalable approximate spectral graph matching for correspondence problems.
U KangMartial HebertSoonyong ParkPublished in: Inf. Sci. (2013)
Keyphrases
- graph matching
- inexact graph matching
- graph matching algorithm
- pairwise
- feature matching
- edit distance
- graph edit distance
- error tolerant
- matching algorithm
- object recognition
- pattern matching
- point matching
- matching accuracy
- pattern recognition
- neural network
- high dimensional
- adjacency matrix
- training set
- computer vision and machine learning
- feature selection