Flow complexity: Fast polytopal graph complexity and 3d object clustering

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5534 LNCS, Issue , 2009, Pages 253-262

  Escolano, Francisco ^a   Giorgi, Daniela ^b   Hancock, Edwin R ^c   Lozano, Miguel A ^a   Falcidieno, Bianca ^b  

^a UNIVERSITY OF ALICANTE   (Spain)

^b CNR   (Italy)

^c UNIVERSITY OF YORK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

3D OBJECT; DESCRIPTORS; LAPLACIAN SPECTRA; PHASE CHANGES; QUALITATIVE BEHAVIOR; REAL TIME; REEB GRAPH;

BIOINFORMATICS;

PATTERN RECOGNITION;

EID: 70349795198     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02124-4_26     Document Type: Conference Paper

References (17)

1. Robles-Kelly, A., Hancock, E.R.: A riemannian approach to graph embedding. Pattern Recognition (40), 1042-1056 (2007)
2. Luo, B., Wilson, R.C., Hancock, E.: Spectral embedding of graphs. Pattern Recognition (36), 2213-2223 (2003)
3. Shokoufandeh, A., Dickinson, S., Siddiqi, K., Zucker, S.: Indexing using a spectral encoding of topological structure. In: IEEE ICPR, pp. 491-497
4. Torsello, A., Hancock, E.: Learning shape-classes using a mixture of tree-unions. IEEE Trans. on PAMI 28(6), 954-967 (2006)
5. Lozano, M., Escolano, F.: Protein classification by matching and clustering surface graphs. Pattern Recognition 39(4), 539-551 (2006)
6. Escolano, F., Hancock, E., Lozano, M.: Birkhoff polytopes, heat kernels, and graph embedding. In: ICPR (2008)
7. Escolano, F., Hancock, E., Lozano, M.: Graph complexity, matrix permanents, and embedding. In: Proc. SSPR/SPR (2008)
8. 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)
9. 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)
10. Qiu, H., Hancock, E.: Graph simplification and matching using conmute times. Pattern Recognition (40), 2874-2889 (2007)
11. Ĺopez-Ruiz, R., Mancini, H., Calbet, X.: A statistical measure of complexity. Physics Letters A 209, 321-326 (1995)
12. Reeb, G.: Sur les points singuliers d'uneetement egrable ou d'une erique. Comptes Rendus Hebdomadaires desfonction eances de l'Acad́emie des Sciences 222, 847-849 (1946)
13. Shinagawa, Y., Kunii, T.L.: Constructing a Reeb Graph automatically from cross sections. IEEE Computer Graphics and Applications 11(6), 44-51 (1991)
14. Biasotti, S.: Computational Topology Methods for Shape Modelling Applications. Ph.D thesis, Universit́a degli Studi di Genova (May 2004)
15. Biasotti, S.: Topological coding of surfaces with boundary using Reeb graphs. Computer Graphics and Geometry 7(1), 31-45 (2005)
16. Hilaga, M., Shinagawa, Y., Kohmura, T., Kunii, T.L.: Topology matching for fully automatic similarity estimation of 3D shapes. In: SIGGRAPH 2001: Proceedings th of the 28 Annual Conference on Computer Graphics and Interactive Techniques, Los Angeles, CA, pp. 203-212. ACM Press, New York (2001)
17. 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)