The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Error-Correcting Isomorphisms of Attributed Relational Graphs for Pattern Analysis
Abstract
The pattern deformational model proposed by Tsai and Fu [11] is extended so that numerical attributes and probability or density distributions can be introduced into primitives and relations in a nonhierarchical relational graph. Conventional graph isomorphisms are then generalized to include error-correcting capability for matching deformed patterns represented by such attributed relational graphs. An ordered-search algorithm is proposed for determining error-correcting isomorphisms. Finally, a pattern classification approach using graph isomorphisms is described, which can be considered as a combination of structural and statistical techniques.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
An Algorithm for Subgraph Isomorphism
Ullmann, J. R. (1976) · Journal of the ACM · doi:10.1145/321921.321925 · Cited by 2,277
Problem-Solving Methods in Artificial Intelligence
Nilsson, N. J. (1971) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,607
Structural Pattern Recognition
Pavlidis, T. (1977) · Springer eBooks · doi:10.1007/978-3-642-88304-0 · Cited by 1,055
The Planar Hamiltonian Circuit Problem is NP-Complete
Garey, M. R., Johnson, D. S., & Tarjan, R. E. (1976) · SIAM Journal on Computing · doi:10.1137/0205049 · Cited by 539
Syntactic Methods in Pattern Recognition
Fu, K., & Айзерман, М. А. (1976) · IEEE Transactions on Systems Man and Cybernetics · doi:10.1109/tsmc.1976.4309556 · Cited by 497
Self-citationAn Efficient Algorithm for Graph Isomorphism
Corneil, D. G., & Gotlieb, C. C. (1970) · Journal of the ACM · doi:10.1145/321556.321562 · Cited by 334
A formal picture description scheme as a basis for picture processing systems
Shaw, A. C. (1969) · Information and Control · doi:10.1016/s0019-9958(69)90017-5 · Cited by 249
A relational database system for images
Chang, N.-S., & Fu, K. S. (1980) · Lecture notes in computer science · doi:10.1007/3-540-09757-0_11 · Cited by 73
Self-citationArrangements, Homomorphisms, and Discrete Relaxation
Haralick, R. M., & Kartus, J. S. (1978) · IEEE Transactions on Systems Man and Cybernetics · doi:10.1109/tsmc.1978.4310036 · Cited by 32
Sequential optimization in pattern recognition and pattern description.
Kovalevsky, V. (1968) · IFIP Congress · Cited by 32
Cited by
Kivela, M., Arenas, A., Barthelemy, M., Gleeson, J. P., Moreno, Y., & Porter, M. A. (2014) · Journal of Complex Networks · doi:10.1093/comnet/cnu016 · Cited by 3,235
THIRTY YEARS OF GRAPH MATCHING IN PATTERN RECOGNITION
CONTE, D., FOGGIA, P., SANSONE, C., & VENTO, M. (2004) · International Journal of Pattern Recognition and Artificial Intelligence · doi:10.1142/s0218001404003228 · Cited by 1,370
Relevance feedback in image retrieval: A comprehensive review
Zhou, X. S., & Huang, T. S. (2003) · Multimedia Systems · doi:10.1007/s00530-002-0070-3 · Cited by 826
An eigendecomposition approach to weighted graph matching problems
Umeyama, S. (1988) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.6778 · Cited by 727
Entropy and Distance of Random Graphs with Application to Structural Pattern Recognition
Wong, A. K. C., & You, M. (1985) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1985.4767707 · Cited by 291
Metadata
- Authors
- Tsai, W.-H., & Fu, K.-S.
- Venue
- IEEE Transactions on Systems, Man, and Cybernetics
- Published
- 1979
- Volume
- 9
- Issue
- 12
- Pages
- 757-768
- ISSN
- 0018-9472 (ISSN-L)
- OpenAlex
- W1977866540
- Cited by
- 327
- References
- 11
- FWCI
- 9.80
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Error-Correcting Isomorphisms of Attributed Relational Graphs for Pattern Analysis. https://app.cochat.ai/papers/10.1109/tsmc.1979.4310127
- The paper
- Tsai, W.-H., & Fu, K.-S. (1979). Error-Correcting Isomorphisms of Attributed Relational Graphs for Pattern Analysis. IEEE Transactions on Systems, Man, and Cybernetics. https://doi.org/10.1109/tsmc.1979.4310127
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.