Kernel-induced sampling theorem

Authors:
Akira Tanaka;Hideyuki Imai;Masaaki Miyakoshi
Affiliations:
Division of Computer Science, Graduate School of Information Science and Technology, Hokkaido University, Sapporo, Japan;Division of Computer Science, Graduate School of Information Science and Technology, Hokkaido University, Sapporo, Japan;Division of Computer Science, Graduate School of Information Science and Technology, Hokkaido University, Sapporo, Japan
Venue:
IEEE Transactions on Signal Processing
Year:
2010

Citing 2
Cited 0

A mathematical theory of communication

ACM SIGMOBILE Mobile Computing and Communications Review
An introduction to kernel-based learning algorithms

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	35.68

Visualization

Abstract

A perfect reconstruction of functions in a reproducing kernel Hilbert space from a given set of sampling points is discussed. A necessary and sufficient condition for the corresponding reproducing kernel and the given set of sampling points to perfectly recover the functions is obtained in this paper. The key idea of our work is adopting the reproducing kernel Hilbert space corresponding to the Gramian matrix of the kernel and the given set of sampling points as the range space of a sampling operator and considering the orthogonal projector, defined via the range space, onto the closed linear subspace spanned by the kernel functions corresponding to the given sampling points. We also give an error analysis of a reconstructed function by incomplete sampling points.