|
|
|
|
| LEADER |
01000caa a22002652 4500 |
| 001 |
NLM156508346 |
| 003 |
DE-627 |
| 005 |
20250206131045.0 |
| 007 |
tu |
| 008 |
231223s2005 xx ||||| 00| ||eng c |
| 028 |
5 |
2 |
|a pubmed25n0522.xml
|
| 035 |
|
|
|a (DE-627)NLM156508346
|
| 035 |
|
|
|a (NLM)16013757
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Gori, Marco
|e verfasserin
|4 aut
|
| 245 |
1 |
0 |
|a Exact and approximate graph matching using random walks
|
| 264 |
|
1 |
|c 2005
|
| 336 |
|
|
|a Text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a ohne Hilfsmittel zu benutzen
|b n
|2 rdamedia
|
| 338 |
|
|
|a Band
|b nc
|2 rdacarrier
|
| 500 |
|
|
|a Date Completed 11.08.2005
|
| 500 |
|
|
|a Date Revised 10.12.2019
|
| 500 |
|
|
|a published: Print
|
| 500 |
|
|
|a Citation Status MEDLINE
|
| 520 |
|
|
|a In this paper, we propose a general framework for graph matching which is suitable for different problems of pattern recognition. The pattern representation we assume is at the same time highly structured, like for classic syntactic and structural approaches, and of subsymbolic nature with real-valued features, like for connectionist and statistic approaches. We show that random walk based models, inspired by Google's PageRank, give rise to a spectral theory that nicely enhances the graph topological features at node level. As a straightforward consequence, we derive a polynomial algorithm for the classic graph isomorphism problem, under the restriction of dealing with Markovian spectrally distinguishable graphs (MSD), a class of graphs that does not seem to be easily reducible to others proposed in the literature. The experimental results that we found on different test-beds of the TC-15 graph database show that the defined MSD class "almost always" covers the database, and that the proposed algorithm is significantly more efficient than top scoring VF algorithm on the same data. Most interestingly, the proposed approach is very well-suited for dealing with partial and approximate graph matching problems, derived for instance from image retrieval tasks. We consider the objects of the COIL-100 visual collection and provide a graph-based representation, whose node's labels contain appropriate visual features. We show that the adoption of classic bipartite graph matching algorithms offers a straightforward generalization of the algorithm given for graph isomorphism and, finally, we report very promising experimental results on the COIL-100 visual collection
|
| 650 |
|
4 |
|a Comparative Study
|
| 650 |
|
4 |
|a Evaluation Study
|
| 650 |
|
4 |
|a Journal Article
|
| 650 |
|
4 |
|a Research Support, Non-U.S. Gov't
|
| 700 |
1 |
|
|a Maggini, Marco
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Sarti, Lorenzo
|e verfasserin
|4 aut
|
| 773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on pattern analysis and machine intelligence
|d 1998
|g 27(2005), 7 vom: 01. Juli, Seite 1100-11
|w (DE-627)NLM098212257
|x 0162-8828
|7 nnns
|
| 773 |
1 |
8 |
|g volume:27
|g year:2005
|g number:7
|g day:01
|g month:07
|g pages:1100-11
|
| 912 |
|
|
|a GBV_USEFLAG_A
|
| 912 |
|
|
|a SYSFLAG_A
|
| 912 |
|
|
|a GBV_NLM
|
| 912 |
|
|
|a GBV_ILN_350
|
| 951 |
|
|
|a AR
|
| 952 |
|
|
|d 27
|j 2005
|e 7
|b 01
|c 07
|h 1100-11
|