|
Scheda bibliografica proveniente da importazione di metadati da altro sistema |
| Tipo: |
Testo a stampa, Risorsa analitica |
| É contributo di: |
Graph-based representations in pattern recognition |
| Titolo: |
A Correspondence Measure for Graph Matching Using the Discrete Quantum Walk |
| Pubblicazione: |
Berlin ; Heidelberg ; New York : Springer, ©2007 |
| Descrizione fisica: |
81-91 |
| Titolo uniforme: |
Graph-based representations in pattern recognition |
| Numeri standard: |
DOI 10.1007/978-3-540-72903-7_8  |
| Sommario o abstract: |
In this paper we consider how coined quantum walks can be applied to graph matching problems. The matching problem is abstracted using an auxiliary graph that connects pairs of vertices from the graphs to be matched by way of auxiliary vertices. A coined quantum walk is simulated on this auxiliary graph and the quantum interference on the auxiliary vertices indicates possible matches. When dealing with graphs for which there is no exact match, the interference amplitudes together with edge consistencies are used to define a consistency measure. We have tested the algorithm on graphs derived from the NCI molecule database and found it to significantly reduce the space of possible matchings thereby allowing the graphs to be matched directly. An analysis of the quantum walk in the presence of structural errors between graphs is used as the basis of the consistency measure. We test the performance of this measure on graphs derived from images in the COIL-100 database |
| Altre responsabilitą: |
David Emms
Edwin Hancock
Richard Wilson |
| Classificazione Dewey: |
006 ed.22 Metodi speciali di elaborazione |
| Lingua della pubblicazione: |
Inglese |
| Paese di pubblicazione: |
Germania ; Stati Uniti d'America |
| Codice identificativo: |
IT/ItRC/00017348 |
| data di importazione: |
01-01-2014 |
|
Full text |
Lista sintetica
Prossima
CNR - Area della Ricerca di Genova Servizio di Documentazione Scientifica
SEI QUI: HOME
SCHEDA BIBLIOGRAFICA
