Graph Based Shapes Representation and Recognition
By R. Qureshi, Jean-Yves Ramel, Hubert Cardot. 2007
31 citations recorded by the source corpus.
Subfields: Computer Vision and Pattern Recognition, Signal Processing
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Vision and Pattern Recognition
In Signal Processing
Citations in the corpus
- Unsupervised Inductive Whole-Graph Embedding by Preserving Graph Proximity (2019, methodology): “We normalize the GEDs according to the following formula: nGED(G1,G2) = GED(G1,G2) (|G1|+|G2|)/2 , where |Gi| denotes the number of nodes of Gi (Qureshi et al., 2007).”
- SimGNN: A Neural Network Approach to Fast Graph Similarity Computation (2018, background): “to [39]: nGED(G1,G2) = GED(G1,G2) ( |G1 |+ |G2 |)/2 , where |Gi | denotes the number of nodes of Gi .”