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.<>


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Information theoretic clustering of large structural modelbases


    Contributors:
    Sengupta, K. (author) / Boyer, K.L. (author)


    Publication date :

    1993-01-01


    Size :

    446372 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Information-theoretic ensemble clustering on web texts

    Wang, Yang / Yuan, Kun / Liu, Hongfu et al. | British Library Online Contents | 2016


    Using Geometric Hashing with Information Theoretic Clustering for Fast Recognition From a Large CAD Modelbase

    Sengupta, K. / Boyer, K. L. / IEEE; Computer Society; Technical Committee for Pattern Analysis and Machine Intelligence | British Library Conference Proceedings | 1995



    An adaptive spatial information-theoretic fuzzy clustering algorithm for image segmentation

    Wang, Z. / Song, Q. / Soh, Y. C. et al. | British Library Online Contents | 2013


    A New Graph-Theoretic Approach to Clustering and Segmentation

    Pavan, M. / Pelillo, M. / IEEE | British Library Conference Proceedings | 2003