The Object Partition Problem
We provide a theoretical framework for the "object partition problem". We begin by considering this problem In a rather abstract context. Consider the semantic domain of physical objects, and the syntactic domain of picture graphs. The object partition problem can be viewed In terms of specifying syntactic operations that yield partitions of the picture graph, which when interpreted In the semantic domaih correspond to possible partitions of the scene into physical objects. We term such syntactic partitions "physically realizable partitions" or simply "realizable partitions". The problem has several aspects. We may seek all possible partitions, the one "best" partition, several plausible partitions, judge or rank proposed partitions, and so forth. The most Important aspect of the problem, In sone sense, is determining the "best" or most likely realizable partition. Guzman's SEE attempts to deal with this problem. Guzman uses his understanding of the semantic physical world of objects to make local choices on the best partition of a given picture graph. These choices are somewhat Interrelated. They are combined to inform global decisions which may also be interrelated. Guzman's SEE is a remarkable heuristic programming achievement. However, as might be expected of tho germinal achievement in its field, It lacks a satisfactory theoretical framework. There Is some difficulty in determining the motivations and implications of Gukian's heuristic decisions.