A hierarchically structured approach to organizing large structural model bases using an information theoretic criterion is presented. Objects (patterns) are modeled in the form of random parametric structural descriptions (RPSDs), an extension of the parametric structural description graph-theoretic formalism. Hierarchically clustering the RPSDs reduces the computational work to O(log N). The node pointers allow a mapping between the observation and a stored representation at one level, and the mapping to all potential models at all subsequent levels is reduced to mere tests, eliminating the exponential search for the best interprimitive mapping function for each stored candidate pattern.<>
Information theoretic clustering of large structural modelbases
1993-01-01
446372 byte
Conference paper
Electronic Resource
English
Information-theoretic ensemble clustering on web texts
British Library Online Contents | 2016
|British Library Conference Proceedings | 1995
|An adaptive spatial information-theoretic fuzzy clustering algorithm for image segmentation
British Library Online Contents | 2013
|A New Graph-Theoretic Approach to Clustering and Segmentation
British Library Conference Proceedings | 2003
|