Arrangements, Homomorphisms, and Discrete Relaxation
- 1 January 1978
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics
- Vol. 8 (8) , 600-612
- https://doi.org/10.1109/tsmc.1978.4310036
Abstract
We show how homomorphisms between arrangements, which are labeled N-ary relations, are the natural solutions to some problems requiring the integration of low-level and high-level information. Examples are given for problems in point matching, graph isomorphism, image matching, scene labeling, and spectral temporal classification of remotely sensed agricultural data. We develop characterization and representation theorems for N-ary relation homomorphisms, and we develop an algorithm consisting of a discrete relaxation method combined with a depth-first search to find such homomorphisms.Keywords
This publication has 7 references indexed in Scilit:
- THE CHARACTERIZATION OF BINARY RELATION HOMOMORPHISMSInternational Journal of General Systems, 1978
- Representation of structured events and efficient procedures for their recognitionPattern Recognition, 1976
- Scene Labeling by Relaxation OperationsIEEE Transactions on Systems, Man, and Cybernetics, 1976
- An Algorithm for Subgraph IsomorphismJournal of the ACM, 1976
- SOME TECHNIQUES FOR RECOGNISING STRUCTURES IN PICTURESPublished by Elsevier ,1972
- A relational model of data for large shared data banksCommunications of the ACM, 1970
- Information processing of remotely sensed agricultural dataProceedings of the IEEE, 1969