Anisotropic Gaussian kernel adaptive filtering by Lie-group dictionary learning.
Ontology highlight
ABSTRACT: The present paper proposes a novel kernel adaptive filtering algorithm, where each Gaussian kernel is parameterized by a center vector and a symmetric positive definite (SPD) precision matrix, which is regarded as a generalization of scalar width parameter. In fact, different from conventional kernel adaptive systems, the proposed filter is structured as a superposition of non-isotropic Gaussian kernels, whose non-isotropy makes the filter more flexible. The adaptation algorithm will search for optimal parameters in a wider parameter space. This generalization brings the need of special treatment of parameters that have a geometric structure. In fact, the main contribution of this paper is to establish update rules for precision matrices on the Lie group of SPD matrices in order to ensure
SUBMITTER: Wada T
PROVIDER: S-EPMC7428144 | biostudies-literature | 2020
REPOSITORIES: biostudies-literature
ACCESS DATA