Speech enhancement method based on low-rank approximation in a reproducing kernel Hilbert space

被引:5
|
作者
Zhao, Yanping [1 ]
Qiu, Robert Caiming [2 ]
Zhao, Xiaohui [1 ]
Wang, Bo [1 ]
机构
[1] Jilin Univ, Coll Commun Engn, Changchun 130012, Peoples R China
[2] Tennessee Technol Univ, Dept Elect & Comp Engn, Cookeville, TN 38505 USA
关键词
Speech enhancement; Kernel function; Low-rank approximation; Error bound; NOISE;
D O I
10.1016/j.apacoust.2016.05.008
中图分类号
O42 [声学];
学科分类号
070206 ; 082403 ;
摘要
Speech signal is corrupted unavoidably by noisy environment in subway, factory, and restaurant or speech from other speakers in speech communication. Speech enhancement methods have been widely studied to minimize noise influence in different linear transform domain, such as discrete Fourier transform domain, Karhunen-Loeve transform domain or discrete cosine transform domain. Kernel method as a nonlinear transform has received a lot of interest recently and is commonly used in many applications including audio signal processing. However this kind of method typically suffers from the computational complexity. In this paper, we propose a speech enhancement algorithm using low-rank approximation in a reproducing kernel Hilbert space to reduce storage space and running time with very little performance loss in the enhanced speech. We also analyze the root mean squared error bound between the enhanced vectors obtained by the approximation kernel matrix and the full kernel matrix. Simulations show that the proposed method can improve the computation speed of the algorithm with the approximate performance compared with that of the full kernel matrix. (C) 2016 Elsevier Ltd. All rights reserved.
引用
收藏
页码:79 / 83
页数:5
相关论文
共 50 条
  • [21] Low-Rank Kernel Space Representations in Prototype Learning
    Bunte, Kerstin
    Kaden, Marika
    Schleif, Frank-Michael
    ADVANCES IN SELF-ORGANIZING MAPS AND LEARNING VECTOR QUANTIZATION, WSOM 2016, 2016, 428 : 341 - 353
  • [22] Robust speech feature extraction by growth transformation in Reproducing Kernel Hilbert Space
    Chakrabartty, S
    Deng, YB
    Cauwenberghs, G
    2004 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, VOL I, PROCEEDINGS: SPEECH PROCESSING, 2004, : 133 - 136
  • [23] Robust speech feature extraction by growth transformation in reproducing kernel Hilbert space
    Chakrabartty, Shantanu
    Deng, Yunbin
    Cauwenberghs, Gert
    IEEE TRANSACTIONS ON AUDIO SPEECH AND LANGUAGE PROCESSING, 2007, 15 (06): : 1842 - 1849
  • [24] Is Input Sparsity Time Possible for Kernel Low-Rank Approximation?
    Musco, Cameron
    Woodruff, David P.
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 30 (NIPS 2017), 2017, 30
  • [25] Kernel embedding of measures and low-rank approximation of integral operators
    Gauthier, Bertrand
    POSITIVITY, 2024, 28 (02)
  • [26] A Schur method for low-rank matrix approximation
    vanderVeen, AJ
    SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 1996, 17 (01) : 139 - 160
  • [27] Stochastic dynamical low-rank approximation method
    Cao, Yu
    Lu, Jianfeng
    JOURNAL OF COMPUTATIONAL PHYSICS, 2018, 372 : 564 - 586
  • [28] Sampling based approximation of linear functionals in reproducing kernel Hilbert spaces
    Gabriele Santin
    Toni Karvonen
    Bernard Haasdonk
    BIT Numerical Mathematics, 2022, 62 : 279 - 310
  • [29] FEDERATED CLASSIFICATION WITH LOW COMPLEXITY REPRODUCING KERNEL HILBERT SPACE REPRESENTATIONS
    Peifer, Maria
    Ribeiro, Alejandro
    2020 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, 2020, : 4187 - 4191
  • [30] Sampling based approximation of linear functionals in reproducing kernel Hilbert spaces
    Santin, Gabriele
    Karvonen, Toni
    Haasdonk, Bernard
    BIT NUMERICAL MATHEMATICS, 2022, 62 (01) : 279 - 310