Pattern spaces from graph polynomials

Proceedings - 12th International Conference on Image Analysis and Processing, ICIAP 2003

Volumn , Issue , 2003, Pages 480-485

  Wilson, Richard C ^a   Hancock, Edwin R ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EXPERIMENTAL EVALUATION; GRAPH CHARACTERIZATIONS; GRAPH POLYNOMIALS; GRAPH STRUCTURES; HIGH-LEVEL VISIONS; REPEATED EIGENVALUES; SPECTRAL MATRICES; SYMMETRIC POLYNOMIAL;

EIGENVALUES AND EIGENFUNCTIONS; GRAPHIC METHODS; IMAGE ANALYSIS; OBJECT RECOGNITION; POLYNOMIALS;

GRAPH THEORY;

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

References (11)

1. A.Torsello and E.R.Hancock. Efficiently computing weighted tree edit distance using relaxation labeling. Lecture Notes in Computer Science, 2134:438453, 2001.
2. H. Bunke. On a relation between graph edit distance and maximum common subgraph. Pattern Recognition Letters, 18:689-694, 1997.
3. 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.
4. F. R. K. Chung. Spectral Graph Theory. AMS, 1997. A. Mowshowitz. The group of a graph whose adjacency matrix has all distinct eigenvalues. Proof Techniques in Graph Theory, Academic Press, New York, pages 109-110, 1969.
5. A. Sanfeliu and K. S. Pu. A distance measure between attributed relational graphs for pattern-recognition. IEEE Transactions on Systems, Man and Cybernetics, 13(3):353-362, 1983.
6. S. Sarkar and K. L. Boyer. Preceptual organization in computer vision. IEEE Trans. Systems, Man and Cybernetics, 23:382-399, 1993.
7. G. Scott and H. Longuet-Higgins. An algorithm for associating the features of two images. Proceedings of the Royal Society of London Series B-Biological, 244:2126, 1991.
8. L. G. Shapiro and R. M. Haralick. Structural descriptions and inexact matching. IEEE Transations on Pattern Analysis and Machine Intelligence, 3(5):504-519, 1981.
9. J. Shi and J. Malik. Normalized cuts and image segmentation. CVPR, pages 731-737, 1997.
10. W. H. Tsai and K. S. Fu. Subgraph error-correcting isomorphisms for syntactic pattern-recognition. IEEE Transations on Systems, Man and Cybernetics, 13(l):48-62, 1983.
11. S. Umeyama. An eigendecompostion approach to weighted graph matching problems. IEEE Transactions on Pattern Analysis and Machine Intelligence, 10(5):695-703, 1988.