Anzeige
Erschienen in:
2009 | OriginalPaper | Buchkapitel
Flow Complexity: Fast Polytopal Graph Complexity and 3D Object Clustering
verfasst von : Francisco Escolano, Daniela Giorgi, Edwin R. Hancock, Miguel A. Lozano, Bianca Falcidieno
Erschienen in: Graph-Based Representations in Pattern Recognition
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.