论文信息 - A hough transform technique for subgraph isomorphism

A hough transform technique for subgraph isomorphism

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.

Azriel Rosenfeld | Leslie J. Kitchen | Simon Kasif

[1] Azriel Rosenfeld,et al. Cellular Graph Automata. II. Graph and Subgraph Isomorphism, Graph Structure Recognition , 1979, Inf. Control..

[2] Olivier D. Faugeras,et al. Semantic Description of Aerial Images Using Stochastic Labeling , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[3] Azriel Rosenfeld,et al. Cellular Graph Automata. I. Basic Concepts, Graph Property Measurement, Closure Properties , 1979, Inf. Control..

[4] Dana H. Ballard,et al. Computer Vision , 1982 .

[5] Azriel Rosenfeld,et al. Networks of Automata: Some Applications , 1975, IEEE Transactions on Systems, Man, and Cybernetics.

[6] Chuck Rieger,et al. ZMOB: a new computing engine for AI , 1981, IJCAI 1981.

[7] Alan K. Mackworth. Consistency in Networks of Relations , 1977, Artif. Intell..

[8] Scott E. Fahlman,et al. NETL: A System for Representing and Using Real-World Knowledge , 1979, CL.

[9] Dana H. Ballard,et al. Generalizing the Hough transform to detect arbitrary shapes , 1981, Pattern Recognit..

[10] Julian R. Ullmann,et al. An Algorithm for Subgraph Isomorphism , 1976, J. ACM.

[11] Stephen H. Unger,et al. GIT—a heuristic program for testing pairs of directed line graphs for isomorphism , 1964, CACM.

[12] L. Kitchen. Discrete Relaxation for Matching Relational Structures , 1978 .