A Functional Representation for Graph Matching
Graph matching is an important and persistent problem in computer vision and pattern recognition for finding node-to-node correspondence between graphs. However, graph matching that incorporates pairwise constraints can be formulated as a quadratic assignment problem (QAP), which is NP-complete and...
Ausführliche Beschreibung
Bibliographische Detailangaben
| Veröffentlicht in: | IEEE transactions on pattern analysis and machine intelligence. - 1979. - 42(2020), 11 vom: 30. Nov., Seite 2737-2754
|
|---|
| 1. Verfasser: |
Wang, Fu-Dong
(VerfasserIn) |
|---|
| Weitere Verfasser: |
Xue, Nan,
Zhang, Yipeng,
Xia, Gui-Song,
Pelillo, Marcello |
|---|
| Format: | Online-Aufsatz
|
|---|
| Sprache: | English |
|---|
| Veröffentlicht: |
2020
|
|---|
| Zugriff auf das übergeordnete Werk: | IEEE transactions on pattern analysis and machine intelligence
|
|---|
| Schlagworte: | Journal Article |
|---|