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.
Learning with constrained and unlabelled data
01.01.2005
281650 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Bootstrapping SVM Active Learning by Incorporating Unlabelled Images for Image Retrieval
British Library Conference Proceedings | 2003
|New Unlabelled Process Oils for the Tyre and Rubber Industry
British Library Conference Proceedings | 1999
|British Library Conference Proceedings | 2004
|