作者: Nian Wang , Jun Tang , Jiang Zhang , Yi-Zheng Fan , Dong Liang
DOI: 10.1007/978-3-540-72524-4_37
关键词: Adjacency list 、 Spectral graph theory 、 Line graph 、 Adjacency matrix 、 Artificial intelligence 、 Pattern recognition 、 Laplacian matrix 、 Computer science 、 Distance matrix 、 Graph energy 、 Incidence matrix
摘要: The spectral graph theories have been widely used in the domain of image clustering where editing distances between graphs are critical. This paper presents a method for edit distance constructed on images. Using feature points each image, we define weighted adjacency matrix relational and obtain covariance based spectra all graphs. Then project vectorized spectrum to eigenspace matrix, derive pairwise We also conduct some theoretical analyses support our method. Experiments both synthetic data real-world images demonstrate effectiveness approach.