Classification problems abundantly arise in many computer vision tasks eing of supervised, semi-supervised or unsupervised nature. Even when class labels are not available, a user still might favor certain grouping solutions over others. This bias can be expressed either by providing a clustering criterion or cost function and, in addition to that, by specifying pairwise constraints on the assignment of objects to classes. In this work, we discuss a unifying formulation for labelled and unlabelled data that can incorporate constrained data for model fitting. Our approach models the constraint information by the maximum entropy principle. This modeling strategy allows us (i) to handle constraint violations and soft constraints, and, at the same time, (ii) to speed up the optimization process. Experimental results on face classification and image segmentation indicates that the proposed algorithm is computationally efficient and generates superior groupings when compared with alternative techniques.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Learning with constrained and unlabelled data


    Contributors:
    Lange, T. (author) / Law, M.H.C. (author) / Jain, A.K. (author) / Buhmann, J.M. (author)


    Publication date :

    2005-01-01


    Size :

    281650 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    Bootstrapping SVM Active Learning by Incorporating Unlabelled Images for Image Retrieval

    Wang, L. / Chan, K. / Zhang, Z. et al. | British Library Conference Proceedings | 2003


    New Unlabelled Process Oils for the Tyre and Rubber Industry

    Wadie, J. | British Library Conference Proceedings | 1999