A hough transform technique for subgraph isomorphism

Authors:
Simon Kasif;Les Kitchen;Azriel Rosenfeld
Affiliations:
Center for Automation Research, University of Maryland, College Park, MD 20742, USA;Center for Automation Research, University of Maryland, College Park, MD 20742, USA;Center for Automation Research, University of Maryland, College Park, MD 20742, USA
Venue:
Pattern Recognition Letters
Year:
1983

Citing 4
Cited 0

An Algorithm for Subgraph Isomorphism

Journal of the ACM (JACM)
GIT—a heuristic program for testing pairs of directed line graphs for isomorphism

Communications of the ACM
ZMOB: a new computing engine for AI

IJCAI'81 Proceedings of the 7th international joint conference on Artificial intelligence - Volume 2
Semantic Description of Aerial Images Using Stochastic Labeling

IEEE Transactions on Pattern Analysis and Machine Intelligence

Quantified Score

Hi-index	0.10

Visualization

Abstract

The Generalized Hough Transform is an established technique for geometric shape matching. An analogous technique is presented here for approximate solution of subgraph isomorphism problems. Its chief advantages are that it can also be used to find partial isomorphisms and that it can be readily implemented in parallel on a network of simple processors.