Cart (Loading....) | Create Account
Close category search window
 

Structural Matching Via Optimal Basis Graphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
DePiero, F.W. ; CalPoly State Univ., San Luis Obispo, CA ; Carlin, J.K.

The 'basis graph' approach to structural matching uses a fixed set of small (4 node) graphs to characterize local structure. We compute mapping probabilities by first finding the probability of a basis graph being an induced subgraph of the input graph. The similarity of these probabilities is used to compare nodes of the input graphs. The method permits common subgraphs to be identified without the use of any node or edge coloring. We report on an improved, simpler, version of the algorithm, which has also been optimized. Performance is compared with the LeRP method, which is based on length-r paths. Both methods are approximate with polynomial bounds on both memory and on the worst-case compute effort. These methods work on arbitrary types of undirected graphs, and tests with strongly regular graphs are included. Monte Carlo test trials (3000+) included up to 100% additional (noise) nodes

Published in:

Pattern Recognition, 2006. ICPR 2006. 18th International Conference on  (Volume:3 )

Date of Conference:

0-0 0

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.