Abstract
Given an adjacency matrix, the problem of finding a simplified version of its associated graph is a challenging one. In this regard, it is desirable to retain the essential connectivity of the original graph in the new representation. To this end, we exploit the magnitude and phase information contained in the Schrödinger Operator of the Laplacian. Recent findings based on continuous-time quantum walks suggest that the long-time averages of both magnitude and phase are sensitive to long-range interactions. In this paper, we depart from this hypothesis to propose a novel representation: skeletal graphs. Using the degree of interaction (or “long-rangedness”) as a criterion we propose a structural level set (i.e. a sequence of graphs) from which it emerges the simplified graph. In addition, since the same theory can be applied to weighted graphs, we can analyze the implications of the new representation in the problems of spectral clustering, hashing and ranking from computer vision. In our experiments we will show how coherent transport phenomenon implemented by quantum walks discovers the long-range interactions without breaking the structure of the manifolds on which the graph or its connected components are embedded.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Zhou, X., Belkin, M., Srebro, N.: An iterated graph laplacian approach for ranking on manifolds. In: Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Diego, CA, USA, August 21-24, pp. 877–885 (2011)
Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 22(8), 888–905 (2000)
Qiu, H., Hancock, E.R.: Clustering and embedding using commute times. IEEE Trans. Pattern Anal. Mach. Intell. 29(11), 1873–1890 (2007)
Arbelaez, P., Maire, M., Fowlkes, C., Malik, J.: Contour detection and hierarchical image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 33(5), 898–916 (2011)
Weiss, Y., Torralba, A., Fergus, R.: Spectral hashing. In: Advances in Neural Information Processing Systems 21, Proceedings of the Twenty-Second Annual Conference on Neural Information Processing Systems, Vancouver, British Columbia, Canada, December 8-11, pp. 1753–1760 (2008)
Weiss, Y., Fergus, R., Torralba, A.: Multidimensional spectral hashing. In: Fitzgibbon, A., Lazebnik, S., Perona, P., Sato, Y., Schmid, C. (eds.) ECCV 2012, Part V. LNCS, vol. 7576, pp. 340–353. Springer, Heidelberg (2012)
Liu, W., Wang, J., Kumar, S., Chang, S.: Hashing with graphs. In: Proceedings of the 28th International Conference on Machine Learning, ICML 2011, Bellevue, Washington, USA, June 28 - July 2, pp. 1–8 (2011)
Grady, L.: Random walks for image segmentation. TPAMI 28(11), 1768–1783 (2006)
Bai, L., Rossi, L., Torsello, A., Hancock, E.R.: A quantum jensen-shannon graph kernel for unattributed graphs. Pattern Recognition 48(2), 344–355 (2015)
Rossi, L., Torsello, A., Hancock, E.R., Wilson, R.C.: Characterizing graph symmetries through quantum jensen-shannon divergence. Phys. Rev. E 88, 032806 (2013)
Mülken, O., Blumen, A.: Continuous-time quantum walks: Models for coherent transport on complex networks. Physics Reports 502(2-3), 37–87 (2011)
Stone, M.: On one-parameter unitary groups in hilbert space. Annals of Mathematics 33(3), 643–648 (1932)
Farhi, E., Gutmann, S.: Quantum computation and decision trees. Phys. Rev. A 58, 915–928 (1998)
Zhou, D., Weston, J., Gretton, A., Bousquet, O., Schlkopf, B.: Ranking on data manifolds. In: Advances in Neural Information Processing Systems 16. MIT Press (2004)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Escolano, F., Hancock, E.R., Lozano, M.A. (2015). Skeletal Graphs from Schrödinger Magnitude and Phase. In: Liu, CL., Luo, B., Kropatsch, W., Cheng, J. (eds) Graph-Based Representations in Pattern Recognition. GbRPR 2015. Lecture Notes in Computer Science(), vol 9069. Springer, Cham. https://doi.org/10.1007/978-3-319-18224-7_33
Download citation
DOI: https://doi.org/10.1007/978-3-319-18224-7_33
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-18223-0
Online ISBN: 978-3-319-18224-7
eBook Packages: Computer ScienceComputer Science (R0)