Graph matching by simplified convex-concave relaxation procedure (Q903552)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6526792
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graph matching by simplified convex-concave relaxation procedure |
scientific article; zbMATH DE number 6526792 |
Statements
Graph matching by simplified convex-concave relaxation procedure (English)
0 references
6 January 2016
0 references
graph matching
0 references
combinatorial optimization
0 references
deterministic annealing
0 references
graduated optimization
0 references
feature correspondence
0 references
0 references
0.8032246828079224
0 references
0.7869981527328491
0 references
0.7620825171470642
0 references
0.7463465929031372
0 references
