An efficient sparse kernel adaptive filtering algorithm based on isomorphism between functional subspace and Euclidean space

Masa Aki Takizawa, Masahiro Yukawa

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

    8 Citations (Scopus)

    Abstract

    The existing kernel filtering algorithms are classified into two categories depending on what space the optimization is formulated in. This paper bridges the two different approaches by focusing on the isomorphism between the dictionary subspace and a Euclidean space with the inner product defined by the kernel matrix. Based on the isomorphism, we propose a novel kernel adaptive filtering algorithm which adaptively refines the dictionary and thereby achieves excellent performance with a small dictionary size. Numerical examples show the efficacy of the proposed algorithm.

    Original languageEnglish
    Title of host publication2014 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2014
    PublisherInstitute of Electrical and Electronics Engineers Inc.
    Pages4508-4512
    Number of pages5
    ISBN (Print)9781479928927
    DOIs
    Publication statusPublished - 2014 Jan 1
    Event2014 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2014 - Florence, Italy
    Duration: 2014 May 42014 May 9

    Publication series

    NameICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
    ISSN (Print)1520-6149

    Other

    Other2014 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2014
    Country/TerritoryItaly
    CityFlorence
    Period14/5/414/5/9

    ASJC Scopus subject areas

    • Software
    • Signal Processing
    • Electrical and Electronic Engineering

    Fingerprint

    Dive into the research topics of 'An efficient sparse kernel adaptive filtering algorithm based on isomorphism between functional subspace and Euclidean space'. Together they form a unique fingerprint.

    Cite this