Eigenspaces for graphs from spectral features

Bin Luo; Richard C. Wilson; Edwin R. Hancock

doi:10.1117/12.477068

31 July 2002 Eigenspaces for graphs from spectral features

Bin Luo, Richard C. Wilson, Edwin R. Hancock

Proceedings Volume 4875, Second International Conference on Image and Graphics; (2002) https://doi.org/10.1117/12.477068
Event: Second International Conference on Image and Graphics, 2002, Hefei, China

Abstract

In this paper we explore how to embed symbolic relational graphs with unweighted edges in eigenspaces. We adopt a graph-spectral approach. The leading eigenvectors of the graph adjacency matrix are used to define clusters of nodes. For each cluster, we compute vectors of spectral properties. We embed these vectors in a pattern-space using principal components analysis and multidimensional scaling techniques. We demonstrate both methods result in well-structured view spaces for graph-data extracted from 2D views of 3D objects.

Citation Download Citation

Bin Luo, Richard C. Wilson, and Edwin R. Hancock "Eigenspaces for graphs from spectral features", Proc. SPIE 4875, Second International Conference on Image and Graphics, (31 July 2002); https://doi.org/10.1117/12.477068

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available