Multi-category classification by kernel based nonlinear subspace method
نویسندگان
چکیده
The Kernel based Nonlinear Subspace (KNS) method is proposed for multi-class pattern classi cation. This method consists of the nonlinear transformation of feature spaces de ned by kernel functions and subspace method in transformed high-dimensional spaces. The Support Vector Machine, a nonlinear classi er based on a kernel function technique, shows excellent classi cation performance, however, its computational cost increases exponentially with the number of patterns and classes. The linear subspace method is a technique for multi-category classi cation, but it fails when the pattern distribution has nonlinear characteristics or the feature space dimension is low compared to the number of classes. The proposed method combines the advantages of both techniques and realizes multi-class nonlinear classi ers with better performance in less computational time. In this paper, we show that a nonlinear subspace method can be formulated by nonlinear transformations de ned through kernel functions and that its performance is better than that obtained by conventional methods.
منابع مشابه
Solving multi-order fractional differential equations by reproducing kernel Hilbert space method
In this paper we propose a relatively new semi-analytical technique to approximate the solution of nonlinear multi-order fractional differential equations (FDEs). We present some results concerning to the uniqueness of solution of nonlinear multi-order FDEs and discuss the existence of solution for nonlinear multi-order FDEs in reproducing kernel Hilbert space (RKHS). We further give an error a...
متن کاملLarge-scale Kernel-based Feature Extraction via Budgeted Nonlinear Subspace Tracking
Kernel-based methods enjoy powerful generalization capabilities in handling a variety of learning tasks. When such methods are provided with sufficient training data, broadly-applicable classes of nonlinear functions can be approximated with desired accuracy. Nevertheless, inherent to the nonparametric nature of kernel-based estimators are computational and memory requirements that become prohi...
متن کاملKernel Discriminant Analysis Based on Canonical Differences for Face Recognition in Image Sets
A novel kernel discriminant transformation (KDT) algorithm based on the concept of canonical differences is presented for automatic face recognition applications. For each individual, the face recognition system compiles a multi-view facial image set comprising images with different facial expressions, poses and illumination conditions. Since the multi-view facial images are non-linearly distri...
متن کاملThe Kernel Orthogonal Mutual Subspace Method and Its Application to 3D Object Recognition
This paper proposes the kernel orthogonal mutual subspace method (KOMSM) for 3D object recognition. KOMSM is a kernel-based method for classifying sets of patterns such as video frames or multi-view images. It classifies objects based on the canonical angles between the nonlinear subspaces, which are generated from the image patterns of each object class by kernel PCA. This methodology has been...
متن کاملFeature space locality constraint for kernel based nonlinear discriminant analysis
Subspace learning is an important approach in pattern recognition. Nonlinear discriminant analysis (NDA), due to its capability of describing nonlinear manifold structure of samples, is considered to be more powerful to undertake classification tasks in image related problems. In kernel based NDA representation, there are three spaces involved, i.e., original data space, implicitly mapped high ...
متن کامل