Graph matching using the interference of discrete-time quantum walks

Image and Vision Computing

Volumn 27, Issue 7, 2009, Pages 934-949

  Emms, David ^a   Wilson, Richard C ^a   Hancock, Edwin R ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

Auxiliary structure; Discrete time quantum walk; Graph matching; Interference amplitude; Probabilistic model

Indexed keywords

AUXILIARY EQUIPMENT; CONTINUOUS TIME SYSTEMS; EDGE DETECTION; PATTERN MATCHING;

AUXILIARY STRUCTURE; DISCRETE TIME QUANTUM WALK; GRAPH MATCHING; INTERFERENCE AMPLITUDE; PROBABILISTIC MODEL;

GRAPH THEORY;

EID: 64849099581     PISSN: 02628856     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.imavis.2008.10.013     Document Type: Article

References (63)

1. Aharonov D., Ambainis A., Kempe J., and Vazirani U. Quantum walks on graphs. STOC'01: Proc ACM Theory of Computing (2001), ACM Press, New York 50-59
2. Ambainis A. Quantum walks and their algorithmic applications. International Journal of Quantum Information 1 (2003) 507-518
3. Ambainis A., Bach E., Nayak A., Vishwanath A., and Watrous J. One-dimensional quantum walks. Proc. 33th STOC (2001), ACM, New York, NY 60-69
4. Babai L., Grigoryev D.Yu., and Mount D.M. Isomorphism of graphs with bounded eigenvalue multiplicity. STOC'82: Proceedings of the Fourteenth Annual ACM symposium on Theory of Computing (1982), ACM Press, New York, NY 310-324
5. Barrow H.G., and Burstall R.M. Subgraph isomorphism, matching relational structures and maximal cliques. Information Processing Letters 4 4 (1976) 83-84
6. Barrow H.G., and Popplestone R.J. Relational descriptions in picture processing. Machine Intelligence 6 (1971) 377-396
7. Borgwardt K., Schnauer S., Vishwanathan S., Smola A., and Kriegel H. Protein function prediction via graph kernels. Bioinformatics (2005) 21
8. Brin S., and Page L. The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems 30 1-7 (1998) 107-117
9. Bunke H. On a relation between graph edit distance and maximum common subgraph. Pattern Recogn. Lett. 18 9 (1997) 689-694
10. Childs A., Farhi E., and Gutmann S. An example of the difference between quantum and classical random walks. Quantum Information Processing 1 (2002) 35
11. Childs A.M., Cleve R., Deotto E., Farhi E., Gutmann S., and Spielman D.A. Exponential algorithmic speedup by a quantum walk. STOC'03: Proc. 35th ACM Symposium on TOC (2003), ACM Press, New York, NY 59-68
12. Christmas W.J., Kittler J., and Petrou M. Structural matching in computer vision using probabilistic relaxation. IEEE Transactions on Pattern Analysis and Machine Intelligence 17 8 (1995) 749-764
13. Cirac J., Zoller P., Kimble H.J., and Mabuchi H. Quantum state transfer and entanglement distribution among distant nodes in a quantum network. Phys. Rev. Lett. 78 (1997) 3221-3224
14. McKay B.D. Practical graph isomorphism. Congressus Numerantium 30 (1981) 45-87
15. Douglas B.L., and Wang J.B. A classical approach to the graph isomorphism problem. J. Phys. A 41 (2008) 1-15
16. Doyle P., and Snell J. Random Walks and Electrical Networks (1984), Mathematical Association of America, Washington
17. Emms D., Wilson R.C., and Hancock E.R. Graph embedding using quantum commute times. Quantum Information and Computation (2009) 9
18. Emms D., Wilson R.C., and Hancock E.R. Graph matching using the interference of continuous-time quantum walks. Pattern Recognition (2009) 42
19. M.A. Eshera, K.S. Fu, A graph distance measure for image analysis, IEEE Transactions on Systems, Man and Cybernetics 14 (3) (1984) 398-408.
20. Farhi E., and Gutmann S. Quantum computation and decision trees. Phys. Rev. A 58 (1998) 915-928
21. Fischler M.A., and Elschlager R.A. The representation and matching of pictorial structures. IEEE Trans. Comput. 22 1 (1973) 67-92
22. Gold S., and Rangarajan A. A graduated assignment algorithm for graph matching. IEEE Trans. Pattern Anal. Mach. Intell. 18 4 (1996) 377-388
23. Grady L. Random walks for image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 28 11 (2006) 1768-1783
24. Grover L. A fast quantum mechanical algorithm for database search. Proc. 28th Annual ACM Symposium on the Theory of Computation (1996), ACM Press, New York, NY 212-219
25. V. Gudkov, S. Nussinov, Graph equivalence and characterization via a continuous evolution of a physical analog, CoRR, cond-mat/0209112, 2002.
26. C. Harris, M. Stephens, A combined corner and edge detector, in: Proc. of 4th Alvey Vision Conference, Manchester, vol. 15, 1988, pp. 147-151.
27. J.E. Hopcroft, J.K. Wong. A linear time algorithm for isomorphism of planar graphs, in: Proc. of the 6th Annual ACM Symposium on the Theory of Computing (STOC'74), 1974, pp. 172-184.
28. Horaud R., and Skordas T. Stereo correspondence through feature grouping and maximal cliques. IEEE Trans. Pattern Anal. Mach. Intell. 11 11 (1989) 1168-1180
29. Kempe J. Quantum random walks-an introductory overview. Contemporary Physics 44 4 (2003) 307-327
30. J. Kempe, Quantum random walks hit exponentially faster, in: Proc. of 7th International Workshop on Randomization and Approximation Techniques in Comput. Sci. (RAN-DOM'03), 2003, pp. 354-369.
31. J. Kobler, On graph isomorphism for restricted graph classes, in: CiE, 2006, pp. 241-256.
32. Kuhn H.W. The Hungarian method for the assignment problem. Naval Research Logistic Quarterly 2 (1955) 83-97
33. Kwiat P., Mitchell J.R., Schwindt P.D.D., and White A.G. Grover's search algorithm: an optical approach. J. Mod. Opt. 47 (2000) 257
34. L. Lovasz, Combinatorics, Paul Erdös is Eighty, vol. 2, Random Walks on Graphs: A Survey, Janos Bolyai Mathematical Society, Budapest, 1996, pp. 353-398.
35. Luo B., and Hancock E.R. Structural graph matching using the em algorithm and singular value decomposition. PAMI 23 10 (2001) 1120-1136
36. M. Meila, J. Shi. A random walks view of spectral segmentation, in: AI and STATISTICS (AISTATS) 2001, 2001.
37. Milne G.W.A., Nicklaus M.C., Driscoll J.S., Wang S., and Zaharevitz. The NCI drug information system 3d database. J. Chem. Inf. Comput. Sci. 34 (1994) 1219-1224
38. T. Miyazaki, The complexity of Mckay's canonical labeling algorithm, in: L. Finkelstein, W.M. Kantor (Eds.), Groups and Computation. II, vol. 28, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, Providence, Rhode Island, 1997, pp. 239-256.
39. Nadler B., Lafon S., Coifman R., and Kevrekidis I. Diffusion maps, spectral clustering and eigenfunctions of Fokker-Planck operators. Advances in Neural Information Processing Systems 18 (2006), MIT Press, Cambridge, MA
40. A. Nayak, A. Vishwanath, Quantum walk on a line, DIMACS Technical Report 2000-43, 2000.
41. S. Nene, S. Nayar, H. Murase, Columbia Object Image Library: COIL, Technical Report CUCS-006-96, Department of Computer Science, Columbia University, 1996.
42. M. Neuhaus, H. Bunke. A random walk kernel derived from graph edit distance, in: SSPR, 2006, pp. 191-199.
43. Nielson M.A., and Chuang I.L. Quantum Computing and Quantum Information (2000), Cambridge University Press, Cambridge
44. Norris J.R. Markov Chains (1998), Cambridge University Press, Cambridge
45. H. Qiu, E. Hancock, Robust multi-body motion tracking using commute time clustering, in: Proc. ECCV, 2006, pp. 160-173.
46. A. Robles-Kelly, E.R. Hancock, Edit distance from graph spectra, in: Proc. of the IEEE International Conference on Computer Vision, 2003, pp. 234-241.
47. Robles-Kelly A., and Hancock E.R. String edit distance, random walks and graph matching. International Journal of Pattern Recognition and Artificial Intelligence 18 3 (2004) 315-327
48. Robles-Kelly A., and Hancock E.R. Graph edit distance from spectral seriation. IEEE Transactions on Pattern Analysis and Machine Intelligence 27 3 (2005) 365-378
49. T. Rudolph, Constructing physically intuitive graph invariants, 2002.
50. Sanfeliu A., and Fu K.S. A distance measure between attributed relational graphs for pattern recognition. IEEE Transactions on Systems, Man and Cybernetics 13 3 (1983) 353-362
51. Sarti L., Maggini M., and Gori M. Exact and approximate graph matching using random walks. IEEE Trans. Pattern Anal. Mach. Intell. 27 7 (2005) 1100-1111
52. Scott G., and Longuet-Higgins H. An algorithm for associating the features of two patterns. Proc. Roy. Soc. London (1991) B244
53. Shapiro L.G., and Haralick R.M. Organization of relational models for scene analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence 4 6 (1982) 595-602
54. Shenvi N., Kempe J., and Whaley K.B. A quantum random walk search algorithm. Phys. Rev. A 67 5 (2003)
55. Shi J., and Malik J. Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 22 8 (2000) 888-905
56. S. Shiau, R. Joynt, S.N. Coppersmith, Algebraic obstructions to the solution of the graph isomorphism problem by dynamical algorithms, Quantum Information and Computation 5, 492-506.
57. Shor P.W. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26 (1997) 1484-1509
58. Sinclair A. Algorithms for Random Generation and Counting: a Markov Chain Approach (1993), Birkhauser, Boston
59. Ullmann J.R. An algorithm for subgraph isomorphism. J. ACM 23 1 (1976) 31-42
60. Umeyama S. An eigen decomposition approach to weighted graph matching problems. PAMI 10 5 (1988) 695-703
61. Ulrike von Luxburg, A tutorial on spectral clustering. CoRR, abs/0711.0189, 2007.
62. Wilson R.C., and Hancock E.R. Structural matching by discrete relaxation. IEEE Trans. Pattern Anal. Mach. Intell. 19 6 (1997) 634-648
63. Zhu X., Ghahramani Z., and Lafferty J. Semi-supervised learning using gaussian fields and harmonic functions. ICML (2003) 1561-1566