PATTERN-CLASSIFICATION BY CONVEX-ANALYSIS

A useful discriminant vector for pattern classification is one that maximizes the minimum separation of discriminant function values for two pattern classes. This optimality criterion can prove valuable in many situations because is emphasizes the class elements that are most difficult to classify. A method for computing this discriminant vector by quadratic programming is derived. The resulting calculation scales with training set size rather than number of input variables and hence is well suited to the high dimensionality of image classification tasks. Digitized images are used to demonstrate application of the approach to two-class and multiple-class image classification tasks.