A Comparative Study of Kernel Adaptive Filtering Algorithms
| Title | A Comparative Study of Kernel Adaptive Filtering Algorithms |
| Publication Type | Conference Paper |
| Year of Publication | 2013 |
| Authors | Van Vaerenbergh, S., and I. Santamaría |
| Conference Name | 2013 IEEE Digital Signal Processing (DSP) Workshop and IEEE Signal Processing Education (SPE) |
| Month Published | August |
| Publisher | IEEE |
| ISBN Number | 978-1-4799-1616-0 |
| Keywords | kernel adaptive filtering |
| Abstract | Kernel adaptive filtering is a growing field of signal processing that is concerned with nonlinear adaptive filtering. When implemented naively, the time and memory complexities of these algorithms grow at least linearly with the amount of data processed. A large number of practical solutions have been proposed throughout the last decade, based on sparsification or pruning mechanisms. Nevertheless, there is a lack of understanding of their relative merits, which often depend on the data they operate on. We propose to study the quality of the solution as a function of either the time or the memory complexity. We empirically test six different kernel adaptive filtering algorithms on three different benchmark data sets. We make our code available through an open source toolbox that includes additional algorithms and allows to measure the complexities explicitly in number of floating point operations and bytes needed, respectively. |
| DOI | 10.1109/DSP-SPE.2013.6642587 |
PDF version:
Supplementary material or Matlab code: