Share Email Print
cover

Proceedings Paper

Application of algebraic graph descriptors for clustering of real-world structures
Author(s): Wojciech Czech
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

We propose several vector graph descriptors created on the basis of vertex rank measures such as PageRank, Hubs and Authorities or Betweenness Centrality. The descriptors are used for clustering artificial and real-world data. We present the comparison of descriptors with the use of criteria such as computational complexity, size and quality of clustering. The experiments were performed mainly on the sets of aerial photos transformed to graphs with the use of Harris corner detection and Delaunay triangulation. The results show that the introduced pattern vectors can be a lower dimensional, less computationally expensive and graph size independent alternative for spectral descriptors, such as defined by Wilson, Hancock and Luo in [1].

Paper Details

Date Published: 28 December 2007
PDF: 12 pages
Proc. SPIE 6937, Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments 2007, 69372N (28 December 2007); doi: 10.1117/12.784774
Show Author Affiliations
Wojciech Czech, AGH Univ. of Science and Technology (Poland)


Published in SPIE Proceedings Vol. 6937:
Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments 2007

© SPIE. Terms of Use
Back to Top