Answers are grounded in this paper and cite their sources.
Relational models are commonly used in scene analysis systems. Most such systems are experimental and deal with only a small number of models. Unknown objects to be analyzed are usually sequentially compared to each model. In this paper, we present some ideas for organizing a large database of relational models. We define a simple relational distance measure, prove it is a metric, and using this measure, describe two organizational/access methods: clustering and binary search trees. We illustrate these methods with a set of randomly generated graphs.
No takes yet. Share an insight, caveat, or question.
Shapiro et al. (1982) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: