Abstract

Sparse Representation based Classifier (SRC) is widely used in a variety of pattern recognition and machine learning tasks. The kernelized version of the classifier (Kernel SRC) attempts to remove the SRC limitations by a nonlinear mapping of the data through kernel functions. However, the performance of such a method strongly relies on the choice of the kernel function. In this paper, we firstly create composite kernels by combining a set of basis kernels. This process can be seen as a feature level fusion of the single kernel classifiers. In this step, the basis kernels are linearly combined using different rules. Within the framework of the SRC, in the next step, the reconstruction errors of the resulted classifiers are combined in decision level in order to make the final decision. Our experimental results on different datasets show the merit of the proposed method.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.