An efficient data-reusing kernel adaptive filtering algorithm based on Parallel HYperslab Projection along Affine Subspaces

Masa Aki Takizawa, Masahiro Yukawa

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Citations (Scopus)

Abstract

We propose a novel kernel adaptive filtering algorithm, dubbed Parallel HYperslab Projection along Affine Sub-Spaces (Φ-PASS), which reuses observed data efficiently. We first derive its fully-updating version that projects the current filter onto multiple hyperslabs in parallel along the dictionary subspace. Each hyperslab accommodates one of the data observed up to the present time instant. The algorithm is derived with the adaptive projected subgradient method (APSM) based on which a convergence analysis is presented. We then generalize the algorithm so that only a few coefficients, whose associated dictionary-data are coherent to the datum of each hyperslab, can be updated selectively for low complexity. This is accomplished by performing the hyperslab projections along affine subspaces defined with the selected dictionary-data. Numerical examples show the efficacy of the proposed algorithm.

Original languageEnglish
Title of host publicationICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
Pages3557-3561
Number of pages5
DOIs
Publication statusPublished - 2013 Oct 18
Externally publishedYes
Event2013 38th IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2013 - Vancouver, BC, Canada
Duration: 2013 May 262013 May 31

Other

Other2013 38th IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2013
CountryCanada
CityVancouver, BC
Period13/5/2613/5/31

Fingerprint

Adaptive filtering
Glossaries
Parallel algorithms

Keywords

  • kernel adaptive filter
  • projection algorithms
  • reproducing kernel Hilbert space
  • the HYPASS algorithm

ASJC Scopus subject areas

  • Signal Processing
  • Software
  • Electrical and Electronic Engineering

Cite this

Takizawa, M. A., & Yukawa, M. (2013). An efficient data-reusing kernel adaptive filtering algorithm based on Parallel HYperslab Projection along Affine Subspaces. In ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings (pp. 3557-3561). [6638320] https://doi.org/10.1109/ICASSP.2013.6638320

An efficient data-reusing kernel adaptive filtering algorithm based on Parallel HYperslab Projection along Affine Subspaces. / Takizawa, Masa Aki; Yukawa, Masahiro.

ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings. 2013. p. 3557-3561 6638320.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Takizawa, MA & Yukawa, M 2013, An efficient data-reusing kernel adaptive filtering algorithm based on Parallel HYperslab Projection along Affine Subspaces. in ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings., 6638320, pp. 3557-3561, 2013 38th IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2013, Vancouver, BC, Canada, 13/5/26. https://doi.org/10.1109/ICASSP.2013.6638320
Takizawa MA, Yukawa M. An efficient data-reusing kernel adaptive filtering algorithm based on Parallel HYperslab Projection along Affine Subspaces. In ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings. 2013. p. 3557-3561. 6638320 https://doi.org/10.1109/ICASSP.2013.6638320
Takizawa, Masa Aki ; Yukawa, Masahiro. / An efficient data-reusing kernel adaptive filtering algorithm based on Parallel HYperslab Projection along Affine Subspaces. ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings. 2013. pp. 3557-3561
@inproceedings{239abbc82e7a4da480e668664456012e,
title = "An efficient data-reusing kernel adaptive filtering algorithm based on Parallel HYperslab Projection along Affine Subspaces",
abstract = "We propose a novel kernel adaptive filtering algorithm, dubbed Parallel HYperslab Projection along Affine Sub-Spaces (Φ-PASS), which reuses observed data efficiently. We first derive its fully-updating version that projects the current filter onto multiple hyperslabs in parallel along the dictionary subspace. Each hyperslab accommodates one of the data observed up to the present time instant. The algorithm is derived with the adaptive projected subgradient method (APSM) based on which a convergence analysis is presented. We then generalize the algorithm so that only a few coefficients, whose associated dictionary-data are coherent to the datum of each hyperslab, can be updated selectively for low complexity. This is accomplished by performing the hyperslab projections along affine subspaces defined with the selected dictionary-data. Numerical examples show the efficacy of the proposed algorithm.",
keywords = "kernel adaptive filter, projection algorithms, reproducing kernel Hilbert space, the HYPASS algorithm",
author = "Takizawa, {Masa Aki} and Masahiro Yukawa",
year = "2013",
month = "10",
day = "18",
doi = "10.1109/ICASSP.2013.6638320",
language = "English",
isbn = "9781479903566",
pages = "3557--3561",
booktitle = "ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings",

}

TY - GEN

T1 - An efficient data-reusing kernel adaptive filtering algorithm based on Parallel HYperslab Projection along Affine Subspaces

AU - Takizawa, Masa Aki

AU - Yukawa, Masahiro

PY - 2013/10/18

Y1 - 2013/10/18

N2 - We propose a novel kernel adaptive filtering algorithm, dubbed Parallel HYperslab Projection along Affine Sub-Spaces (Φ-PASS), which reuses observed data efficiently. We first derive its fully-updating version that projects the current filter onto multiple hyperslabs in parallel along the dictionary subspace. Each hyperslab accommodates one of the data observed up to the present time instant. The algorithm is derived with the adaptive projected subgradient method (APSM) based on which a convergence analysis is presented. We then generalize the algorithm so that only a few coefficients, whose associated dictionary-data are coherent to the datum of each hyperslab, can be updated selectively for low complexity. This is accomplished by performing the hyperslab projections along affine subspaces defined with the selected dictionary-data. Numerical examples show the efficacy of the proposed algorithm.

AB - We propose a novel kernel adaptive filtering algorithm, dubbed Parallel HYperslab Projection along Affine Sub-Spaces (Φ-PASS), which reuses observed data efficiently. We first derive its fully-updating version that projects the current filter onto multiple hyperslabs in parallel along the dictionary subspace. Each hyperslab accommodates one of the data observed up to the present time instant. The algorithm is derived with the adaptive projected subgradient method (APSM) based on which a convergence analysis is presented. We then generalize the algorithm so that only a few coefficients, whose associated dictionary-data are coherent to the datum of each hyperslab, can be updated selectively for low complexity. This is accomplished by performing the hyperslab projections along affine subspaces defined with the selected dictionary-data. Numerical examples show the efficacy of the proposed algorithm.

KW - kernel adaptive filter

KW - projection algorithms

KW - reproducing kernel Hilbert space

KW - the HYPASS algorithm

UR - http://www.scopus.com/inward/record.url?scp=84890524237&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84890524237&partnerID=8YFLogxK

U2 - 10.1109/ICASSP.2013.6638320

DO - 10.1109/ICASSP.2013.6638320

M3 - Conference contribution

AN - SCOPUS:84890524237

SN - 9781479903566

SP - 3557

EP - 3561

BT - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

ER -