An efficient \(A^*\) based algorithm for optimal graph matching applied to computer vision (Q2781538)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An efficient \(A^*\) based algorithm for optimal graph matching applied to computer vision |
scientific article; zbMATH DE number 1721536
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient \(A^*\) based algorithm for optimal graph matching applied to computer vision |
scientific article; zbMATH DE number 1721536 |
Statements
20 March 2002
0 references
graph matching
0 references
\(A^*\) algorithm
0 references
computer vision
0 references
An efficient \(A^*\) based algorithm for optimal graph matching applied to computer vision (English)
0 references
