We approach the task of object discrimination as that of learning efficient "codes" for each object class in terms of responses to a set of chosen discriminants. We formulate this approach in an energy minimization framework. The "code" is built incrementally by successively constructing discriminants that focus on pairs of training images of objects that are currently hard to classify. The particular discriminants that we use partition the set of objects of interest into two well-separated groups. We find the optimal discriminant as well as partition by formulating an objective criteria that measures the well-separateness of the partition. We derive an iterative solution that alternates between the solutions for two generalized eigenproblems, one for the discriminant parameters and the other for the indicator variables denoting the partition. We show how the optimization can easily be biased to focus on hard to classify pairs, which enables us to choose new discriminants one by one in a sequential manner We validate our approach on a challenging face discrimination task using parts as features and show that it compares favorably with the performance of an eigenspace method.
Object recognition using boosted discriminants
2001-01-01
874145 byte
Conference paper
Electronic Resource
English
Object Recognition Using Boosted Discriminants
British Library Conference Proceedings | 2001
|Human action recognition using boosted EigenActions
British Library Online Contents | 2010
|Shape Recognition using Fast Boosted Filtering
British Library Conference Proceedings | 2005
|Shape recognition using fast boosted filtering
IEEE | 2005
|Improving object detection with boosted histograms
British Library Online Contents | 2009
|