The Consistent Labeling Problem: Part I

Authors:
Robert M. Haralick;Linda G. Shapiro
Affiliations:
SENIOR MEMBER, IEEE, Department of Electrical Engineering, Virginia Polytechnic Institute and State University, Blacksburg, VA 24061.;Department of Computer Science, Kansas State University, Manhattan, KS 66506/ Department of Computer Science, Virginia Polytechnic Institute and State University, Blacksburg, VA 24
Venue:
IEEE Transactions on Pattern Analysis and Machine Intelligence
Year:
1979

Citing 0
Cited 7

Local and global microcode compaction using reduction operators

ACM SIGMICRO Newsletter
Efficient graph automorphism by vertex partitioning

Artificial Intelligence
Consistent-labeling problems and their algorithms: Expected-complexities and theory-based heuristics

Artificial Intelligence
Graph transduction as a noncooperative game

Neural Computation
Relational consistency in on-line signature validation

Pattern Recognition Letters
Semi-supervised clustering with discriminative random fields

Pattern Recognition
Effective Procedures for Handling Possible Equivalence Relations in Non-deterministic Information Systems

Fundamenta Informaticae

Quantified Score

Hi-index	0.14

Visualization

Abstract

In this first part of a two-part paper we introduce a general consistent labeling problem based on a unit constraint relation T containing N-tuples of units which constrain one another, and a compatibility relation R containing N-tuples of unit-label pairs specifying which N-tuples of units are compatible with which N-tuples of labels. We show that Latin square puzzles, finding N-ary relations, graph or auto-mata homomorphisms, graph colorings, as well as determining satisfiability of propositional logic statements and solving scene and edge labeling problems, are all special cases of the general consistent labeling problem. We then discuss the various approaches that researchers have used to speed up the tree search required to find consistent labelings. Each of these approaches uses a particular look-ahead operator to help eliminate backtracking in the tree search. Finally, we define the 驴KP two-parameter class of look-ahead operators which includes, as special cases, the operators other researchers have used.