Spectral generative models for graphs

Proceedings - 14th International conference on Image Analysis and Processing, ICIAP 2007

Volumn , Issue , 2007, Pages 35-40

  White, David ^a   Wilson, Richard C ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

DATA FUSION; IMAGE ANALYSIS; IMAGE RETRIEVAL; IMAGE SEGMENTATION; PATTERN RECOGNITION; PROBABILITY DISTRIBUTIONS; SUPPORT VECTOR MACHINES;

DO-MAINS; DUAL VECTORS; GENERATIVE MODELS; OF GRAPHS; SPECTRAL DECOMPOSITIONS; SPECTRAL REPRESENTATIONS; STATISTICAL PATTERN RECOGNITIONS; STATISTICAL QUANTITIES; VECTOR SPACES;

VECTORS;

EID: 48149091382     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICIAP.2007.4362754     Document Type: Conference Paper

References (17)

1. H. Bunke. On a relation between graph edit distance and maximum common subgraph. Pattern Recognition Letters, 18:689-694, 1997.
2. H. Bunke. Error correcting graph matching: On the influence of the underlying cost function. IEEE Transactions on Pattern Analysis and Machine Intelligence, 21:917-922, 1999.
3. F. R. K. Chung. Spectral Graph Theory. AMS, 1997.
4. M. Ferrer, F. Serratosa, and A. Sanfeliu. Synthesis of median spectral graph. In IbPRIA, pages 139-146, 2005.
5. X. Jiang, A. Münger, and H. Bunke. Computing the generalized median of a set of graphs. In Proc. 2nd IAPR workshop on Graph Based representations, pages 115-124, 1999.
6. X. Jiang, A. Münger, and H. Bunke. On median graphs: Properties, algorithms and applications. IEEE Transations on Pattern Analysis and Machine Intelligence, 23( 10): 1144-1151, 2001.
7. S. Kosinov and T. Caelli. Inexact multisubgraph matching using graph eigenspace and clustering models. Structural, Syntatic and Statistical Pattern Recognition, LNCS, 2396:133-142, 2002.
8. L. Lovász. Random walks on graphs: A survey. In Combinatorics, Paul Erdõs is Eighty, Vol. 2. János Bolyai Mathematical Society, Budapest, 1996.
9. B. Luo, R. C. Wilson, and E. R. Hancock. A linear generative model for graph structure. In Graph-based Representations in Pattern Recognition, 2005.
10. A. Sanfeliu and K. S. Fu. A distance measure between attributed relational graphs for pattern-recognition. IEEE Transactions on Systems, Man and Cybernetics, 13(3):353-362, 1983.
11. S. Sarkar and K. L. Boyer. Preceptual organization in computer vision. IEEE Trans. Systems, Man and Cybernetics, 23:382-399, 1993.
12. J. Shi and J. Malik. Normalized cuts and image segmentation. CVPR, pages 731-737, 1997.
13. A. Shokoufandeh, S. Dickinson, K. Siddiqi, and S. Zucker. Indexing using a spectral coding of topological structure. In Proceedings IEEE Conference on Computer Vision and Pattern Recognition, number 491-497, 1999.
14. S. Umeyama. An eigendecompostion approach to weighted graph matching problems. IEEE Transactions on Pattern Analysis and Machine Intelligence, 10(5):695-703, 1988.
15. E. R. van Dam and W. H. Haemers. Which graphs are determined by their spectrum? Linear Algebra and its Applications, 356:241-272, 2003.
16. R. C. Wilson, E. R. Hancock, and B. Luo. Pattern vectors from algebraic graph theory. IEEE Transactions on Pattern Analysis and Machine Intelligence, 27(7): 111 2-1125, 2005.
17. B. Xiao and E. R. Hancock. A spectral generative model for graph structure. In International Workshop on Structural and Syntactic Pattern Recognition, 2006.