Pattern Recognition, International Conference on (2004)
Aug. 23, 2004 to Aug. 26, 2004
Richard C. Wilson , University of York, UK
Edwin R. Hancock , University of York, UK
Graph structures play a critical role in computer vision, but they are inconvenient to use in pattern recognition tasks because of their combinatorial nature and the consequent difficulty in constructing feature vectors. Spectral representations have been used for this task which are based on the eigensystem of the graph Laplacian matrix. However, graphs of different sizes produce eigensystems of different sizes where not all eigenmodes are present in both graphs.<div></div> In this paper we use the Levenshtein distance to compare spectral representations under graph edit operations which add or delete vertices. The spectral representations are therefore of different sizes. We use the concept of the string-edit distance to allow for the missing eigenmodes and compare the correct modes to each other. We evaluate the method by first using generated graphs to compare the effect of vertex deletion operations. We then examine the performance of the method on graphs from a shape database.
R. C. Wilson and E. R. Hancock, "Levenshtein Distance for Graph Spectral Features," Pattern Recognition, International Conference on(ICPR), Cambridge UK, 2004, pp. 489-492.