图 书 馆
图使用离散的量子漫步匹配的对应措施A Correspondence Measure for Graph Matching using the Discrete Quantum Walk |
|
| 课程网址: | http://videolectures.net/gbr07_emms_acm/ |
| 主讲教师: | David Emms |
| 开课单位: | 约克大学 |
| 开课时间: | 2007-07-04 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | In this paper we consider how coined quantum walks can be applied to graph matching problems. The matching problem is ab- stracted 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 to- gether 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 match- ings 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. |
| 关 键 词: | 匹配问题; 精确匹配; 量子游走的分析 |
| 课程来源: | 视频讲座网 |
| 最后编审: | 2020-10-01：yumf |
| 阅读次数: | 64 |