scispace - formally typeset
Search or ask a question

Showing papers by "Charles R. Dyer published in 2005"


Journal ArticleDOI
01 Jun 2005
TL;DR: A new technique based on linear programming for both feature selection and classifier training is introduced and a pairwise framework for feature selection, instead of using all classes simultaneously, is presented.
Abstract: Example-based learning for computer vision can be difficult when a large number of examples to represent each pattern or object class is not available. In such situations, learning from a small number of samples is of practical value. To study this issue, the task of face expression recognition with a small number of training images of each expression is considered. A new technique based on linear programming for both feature selection and classifier training is introduced. A pairwise framework for feature selection, instead of using all classes simultaneously, is presented. Experimental results compare the method with three others: a simplified Bayes classifier, support vector machine, and AdaBoost. Finally, each algorithm is analyzed and a new categorization of these algorithms is given, especially for learning from examples in the small sample case.

200 citations


Proceedings ArticleDOI
20 Jun 2005
TL;DR: It is shown that Ullman and Basri's linear combination (LC) representation can be used for outlier detection in motion tracking with an affine camera and can use SVR in a straightforward manner while previous factorization-based or subspace separation methods cannot.
Abstract: In this paper we show that Ullman and Basri's linear combination (LC) representation, which was originally proposed for alignment-based object recognition, can be used for outlier detection in motion tracking with an affine camera. For this task LC can be realized either on image frames or feature trajectories, and therefore two methods are developed which we call linear combination of frames and linear combination of trajectories. For robust estimation of the linear combination coefficients, the support vector regression (SVR) algorithm is used and compared with the RANSAC method. SVR based on quadratic programming optimization can efficiently deal with more than 50 percent outliers and delivers more consistent results than RANSAC in our experiments. The linear combination representation can use SVR in a straightforward manner while previous factorization-based or subspace separation methods cannot. Experimental results are presented using real video sequences to demonstrate the effectiveness of our LC+SVR approaches, including a quantitative comparison of SVR and RANSAC.

9 citations