Abstract
In this paper, we introduce a novel descriptor of graph complexity which can be computed in real time and has the same qualitative behavior of polytopal (Birkhoff) complexity, which has been successfully tested in the context of Bioinformatics. We also show how the phase-change point may be characterized in terms of the Laplacian spectrum, by analyzing the derivatives of the complexity function. In addition, the new complexity notion (flow complexity) is applied to cluster a database of Reeb graphs coming from analyzing 3D objects.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Robles-Kelly, A., Hancock, E.R.: A riemannian approach to graph embedding. Pattern Recognition (40), 1042–1056 (2007)
Luo, B., Wilson, R.C., Hancock, E.: Spectral embedding of graphs. Pattern Recognition (36), 2213–2223 (2003)
Shokoufandeh, A., Dickinson, S., Siddiqi, K., Zucker, S.: Indexing using a spectral encoding of topological structure. In: IEEE ICPR, pp. 491–497
Torsello, A., Hancock, E.: Learning shape-classes using a mixture of tree-unions. IEEE Trans. on PAMI 28(6), 954–967 (2006)
Lozano, M., Escolano, F.: Protein classification by matching and clustering surface graphs. Pattern Recognition 39(4), 539–551 (2006)
Escolano, F., Hancock, E., Lozano, M.: Birkhoff polytopes, heat kernels, and graph embedding. In: ICPR (2008)
Escolano, F., Hancock, E., Lozano, M.: Graph complexity, matrix permanents, and embedding. In: Proc. SSPR/SPR (2008)
Körner, J.: Coding of an information source having ambiguous alphabet and the entropy of graphs. In: Trans. of the 6th Prague Conference on Information Theory, pp. 411–425 (1973)
Estrada, E.: Graph spectra and structure in complex networks. Technical report, Institute of Complex Systems at Strathclyde, Department of Physics and Department of Mathematics, University of Strathclyde, Glasgow, UK (2008)
Qiu, H., Hancock, E.: Graph simplification and matching using conmute times. Pattern Recognition (40), 2874–2889 (2007)
López-Ruiz, R., Mancini, H., Calbet, X.: A statistical measure of complexity. Physics Letters A 209, 321–326 (1995)
Reeb, G.: Sur les points singuliers d’une forme de Pfaff complètement intégrable ou d’une fonction numérique. Comptes Rendus Hebdomadaires des Séances de l’Académie des Sciences 222, 847–849 (1946)
Shinagawa, Y., Kunii, T.L.: Constructing a Reeb Graph automatically from cross sections. IEEE Computer Graphics and Applications 11(6), 44–51 (1991)
Biasotti, S.: Computational Topology Methods for Shape Modelling Applications. Ph.D thesis, Universitá degli Studi di Genova (May 2004)
Biasotti, S.: Topological coding of surfaces with boundary using Reeb graphs. Computer Graphics and Geometry 7(1), 31–45 (2005)
Hilaga, M., Shinagawa, Y., Kohmura, T., Kunii, T.L.: Topology matching for fully automatic similarity estimation of 3D shapes. In: SIGGRAPH 2001: Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques, Los Angeles, CA, pp. 203–212. ACM Press, New York (2001)
Attene, M., Biasotti, S.: Shape retrieval contest 2008: Stability of watertight models. In: Spagnuolo, M., Cohen-Or, D., Gu, X. (eds.) SMI 2008: Proceedings IEEE International Conference on Shape Modeling and Applications, pp. 219–220 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Escolano, F., Giorgi, D., Hancock, E.R., Lozano, M.A., Falcidieno, B. (2009). Flow Complexity: Fast Polytopal Graph Complexity and 3D Object Clustering. In: Torsello, A., Escolano, F., Brun, L. (eds) Graph-Based Representations in Pattern Recognition. GbRPR 2009. Lecture Notes in Computer Science, vol 5534. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02124-4_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-02124-4_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02123-7
Online ISBN: 978-3-642-02124-4
eBook Packages: Computer ScienceComputer Science (R0)