Birkhoff polytopes, heat kernels and graph complexity

Proceedings - International Conference on Pattern Recognition

Volumn , Issue , 2008, Pages

  Escolano, Francisco ^a   Hancock, Edwin R ^b   Lozano, Miguel A ^a  

^a UNIVERSITY OF ALICANTE   (Spain)

^b UNIVERSITY OF YORK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

PATTERN RECOGNITION; STOCHASTIC SYSTEMS;

BIRKHOFF-VON NEUMANN DECOMPOSITIONS; DOUBLY STOCHASTIC; GRAPH COMPLEXITY; INTERACTION FACTOR; ITS APPLICATIONS; MULTI DIMENSIONAL; STRUCTURAL SNAPSHOTS; TRAFFIC AND TRANSPORTATION;

TOPOLOGY;

EID: 77957943881     PISSN: 10514651     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/icpr.2008.4761921     Document Type: Conference Paper

References (12)

1. G. D. Birkhoff. Tres observaciones sobre el algebra lineal. Universidad Nacional de Tucuman Revista, Serie A, 5:147-151, 1946.
2. B.Luo, R.C.Wilson, and E. Hancock. Spectral embedding of graphs. Pattern Recognition, (36):2213-2223, 2003.
3. C. Chang, W. Chen, and H. Huang. On service guarangees for input buffered crossbar switches: A capacity decomposition approach by birkhoff and von neumann. In IEEE IWQoS, pages 79-86, 1998.
4. R. I. Kondor and J. Lafferty. Diffusion kernels on graphs and other discrete structures. In Proc. ICML, 2002.
5. J. Körner. Coding of an information source having ambiguous alphabet and the entropy of graphs. In Trans. of the 6th Prague Conference on Information Theory, page 411425, 1973.
6. M. Lozano and F. Escolano. Protein classification by matching and clustering surface graphs. Pattern Recognition, 39(4):539-551, 2006.
7. L. Mirsky. Proofs of two theorems on doubly stochastic matrices. Proc. Amer. Math. Soc., 9:371-374, 1958.
8. H. Qiu and E. Hancock. Graph simplification and matching using conmute times. Pattern Recognition, (40):2874-2889, 2007.
9. A. Robles-Kelly and E.R.Hancock. A riemannian approach to graph embedding. Pattern Recognition, (40):1042-1056, 2007.
10. A. Shokoufandeh, S. Dickinson, K. Siddiqi, and S. Zucker. Indexing using a spectral encoding of topological structure. In IEEE ICPR, pages 491-497.
11. P. B. Slater. Maximum-entropy representations in convex polytopes. Environment and Planning, 21:1541- 1546, 1989.
12. A. Torsello and E. Hancock. Learning shape-classes using a mixture of tree-unions. IEEE Trans. on PAMI, 28(6):954-967, 2006.