2018Unpublished venueRequires access

Reproducing Kernel Hilbert Space Models for Signal Processing

José Luis Rojo-Álvarez, Manel Martínez-Ramón, Jordi Muñoz-Marí, Gustau Camps-Valls

Open publisher page 0 citations

Abstract

This chapter introduces a set of signal models properly defined in a reproducing kernel Hilbert space (RKHS). Also, it focuses on a class of support vector machine (SVM) for digital signal processing (DSP) algorithms that consists of stating the signal model of the time-series structure in the RKHS, and hence they are called RSM algorithms. The use of the theory of reproducing kernels can circumvent this problem by defining nonlinear algorithms by simply replacing dot products in the feature space by an appropriate Mercer kernel function. The most famous example of this kind of approaches is the support vector classification (SVC) algorithm. The chapter pays attention to the fundamental elements of the RSM approach and concentrate on particular signal structures which have been previously studied. Finally, it discusses the use of bootstrap resampling techniques (BRTs) in SVM for RSM models.

About this research paper

What this paper is about

This chapter introduces a set of signal models properly defined in a reproducing kernel Hilbert space (RKHS). Also, it focuses on a class of support vector machine (SVM) for digital signal processing (DSP) algorithms that consists of stating the signal model of the time-series structure in the RKHS, and hence they are called RSM algorithms. The use of the theory of reproducing kernels can circumvent this problem by defining nonlinear algorithms by simply replacing dot products in the feature space by an appropriate Mercer kernel function. The most famous example of this kind of approaches is the support vector classification (SVC) algorithm. The chapter pays attention to the fundamental elements of the RSM approach and concentrate on particular signal structures which have been previously studied. Finally, it discusses the use of bootstrap resampling techniques (BRTs) in SVM for RSM models.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

This chapter introduces a set of signal models properly defined in a reproducing kernel Hilbert space (RKHS). Also, it focuses on a class of support vector machine (SVM) for digital signal processing (DSP) algorithms that consists of stating the signal model of the time-series structure in the RKHS, and hence they are called RSM algorithms. The use of the theory of reproducing kernels can circumvent this problem by defining nonlinear algorithms by simply replacing dot products in the feature space by an appropriate Mercer kernel function. The most famous example of this kind of approaches is the support vector classification (SVC) algorithm. The chapter pays attention to the fundamental elements of the RSM approach and concentrate on particular signal structures which have been previously studied. Finally, it discusses the use of bootstrap resampling techniques (BRTs) in SVM for RSM models.

Key concepts: Reproducing kernel Hilbert space, Kernel method, Kernel (algebra), Digital signal processing, Support vector machine, Feature vector, Computer science, Kernel embedding of distributions

Related papers

Back to paper searchBrowse research topicsOriginal source
Reproducing Kernel Hilbert Space Models for Signal Processing — Research Paper | ScholarLens