Kernel-blending connection approximated by a neural network for image classification

18Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

This paper proposes a kernel-blending connection approximated by a neural network (KBNN) for image classification. A kernel mapping connection structure, guaranteed by the function approximation theorem, is devised to blend feature extraction and feature classification through neural network learning. First, a feature extractor learns features from the raw images. Next, an automatically constructed kernel mapping connection maps the feature vectors into a feature space. Finally, a linear classifier is used as an output layer of the neural network to provide classification results. Furthermore, a novel loss function involving a cross-entropy loss and a hinge loss is proposed to improve the generalizability of the neural network. Experimental results on three well-known image datasets illustrate that the proposed method has good classification accuracy and generalizability.

Cite

CITATION STYLE

APA

Liu, X., Zhang, Y., Bao, F., Shao, K., Sun, Z., & Zhang, C. (2020). Kernel-blending connection approximated by a neural network for image classification. Computational Visual Media, 6(4), 467–476. https://doi.org/10.1007/s41095-020-0181-9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free