Subgraph error-correcting isomorphisms for syntactic pattern recognition
- 1 January 1983
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics
- Vol. SMC-13 (1) , 48-62
- https://doi.org/10.1109/TSMC.1983.6313029
Abstract
The structure-preserved error-correcting graph isomorphism proposed by Tsai and Fu (1979) for matching patterns represented by attributed relational graphs is extended to the case of subgraphs. The resulting subgraph error-correcting isomorphism, which includes the structure-preserved error-correcting graph isomorphism as a special case, is useful for recognizing partially viewed or structurally distorted patterns. After formulating a subgraph error-correcting isomorphism as a state-space tree-search problem, heuristic information useful for speeding up the search is suggested and an ordered-search algorithm is proposed for finding an optimal subgraph error-correcting isomorphism.Keywords
This publication has 0 references indexed in Scilit: