Paper
28 December 2007 Application of algebraic graph descriptors for clustering of real-world structures
Wojciech Czech
Author Affiliations +
Proceedings Volume 6937, Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments 2007; 69372N (2007) https://doi.org/10.1117/12.784774
Event: Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments 2007, 2007, Wilga, Poland
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].
© (2007) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Wojciech Czech "Application of algebraic graph descriptors for clustering of real-world structures", Proc. SPIE 6937, Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments 2007, 69372N (28 December 2007); https://doi.org/10.1117/12.784774
Lens.org Logo
CITATIONS
Cited by 1 scholarly publication.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Genetic algorithms

Detection and tracking algorithms

Principal component analysis

Adaptive optics

Corner detection

Distance measurement

Stochastic processes

Back to Top