Combinatorial Learning of Robust Deep Graph Matching : An Embedding Based Approach
Graph matching aims to establish node correspondence between two graphs, which has been a fundamental problem for its NP-hard nature. One practical consideration is the effective modeling of the affinity function in the presence of noise, such that the mathematically optimal matching result is also...
| Publié dans: | IEEE transactions on pattern analysis and machine intelligence. - 1979. - 45(2023), 6 vom: 30. Juni, Seite 6984-7000 |
|---|---|
| Auteur principal: | |
| Autres auteurs: | , |
| Format: | Article en ligne |
| Langue: | English |
| Publié: |
2023
|
| Accès à la collection: | IEEE transactions on pattern analysis and machine intelligence |
| Sujets: | Journal Article |
| Accès en ligne |
Volltext |