Open AccessPerformance Analysis of Kernel Adaptive Filters based on LMS Algorithm
Author(s) -
Ibtissam Constantin,
Régis Lengelle
Publication year - 2013
Publication title -
procedia computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.334
H-Index - 76
ISSN - 1877-0509
DOI - 10.1016/j.procs.2013.09.236
Subject(s) - kernel (algebra) , algorithm , adaptive filter , kernel adaptive filter , least mean squares filter , convergence (economics) , key (lock) , series (stratigraphy) , variable kernel density estimation , computer science , nonlinear system , kernel method , filter (signal processing) , mathematics , feature (linguistics) , pattern recognition (psychology) , artificial intelligence , filter design , support vector machine , computer vision , computer security , economic growth , biology , paleontology , quantum mechanics , physics , combinatorics , economics , philosophy , linguistics
The design of adaptive nonlinear filters has sparked a great interest in the machine learning community. The present paper aims to present some recent developments in nonlinear adaptive filtering. It provides an in-depth analysis of the performance and complexity of a class of kernel filters based on the least-mean-squares algorithm. A key feature that underlies kernel algorithms is that they map the data in a high-dimensional feature space where linear filtering is performed. The arithmetic operations are carried out in the initial space via evaluation of inner products between pairs of input patterns called kernels. The SNR improvement and the convergence speed of kernel-based least-mean-squares filters are evaluated on two types of applications: time series prediction and cardiac artifacts extraction from magnetoencephalographic data
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom