UNSUPERVISED MONAURAL SPEECH ENHANCEMENT USING ROBUST NMF WITH LOW-RANK AND SPARSE CONSTRAINTS

被引:0
|
作者
Li, Yinan [1 ]
Zhang, Xiongwei [1 ]
Sun, Meng [1 ]
Min, Gang [1 ]
机构
[1] PLA Univ Sci & Technol, Lab Intelligent Informat Proc, Nanjing, Jiangsu, Peoples R China
来源
2015 IEEE CHINA SUMMIT & INTERNATIONAL CONFERENCE ON SIGNAL AND INFORMATION PROCESSING | 2015年
关键词
speech enhancement; low-rank and sparse decomposition; non-negative matrix factorization;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Non-negative spectrogram decomposition and its variants have been extensively investigated for speech enhancement due to their efficiency in extracting perceptually meaningful components from mixtures. Usually, these approaches are implemented on the condition that training samples for one or more sources are available beforehand. However, in many real-world scenarios, it is always impossible for conducting any prior training. To solve this problem, we proposed an approach which directly extracts the representations of background noises from the noisy speech via imposing non-negative constraints on the low-rank and sparse decomposition of the noisy spectrogram. The noise representations are subsequently utilized when estimating the clean speech. In this technique, potential spectral structural regularity could be discovered for better reconstruction of clean speech. Evaluations on the Noisex-92 and TIMIT database showed that the proposed method achieves significant improvements over the state-of-the-art methods in unsupervised speech enhancement.
引用
收藏
页码:1 / 4
页数:4
相关论文
共 50 条
  • [31] Speech Enhancement Based on Constrained Low-rank Sparse Matrix Decomposition Integrated with Temporal Continuity Regularisation
    Sun, Chengli
    Yuan, Conglin
    ARCHIVES OF ACOUSTICS, 2019, 44 (04) : 681 - 692
  • [32] Low-Rank Approximation of Data Matrices Using Robust Sparse Principal Component Analysis
    Pfeiffer, Pia
    Filzmoser, Peter
    COMBINING, MODELLING AND ANALYZING IMPRECISION, RANDOMNESS AND DEPENDENCE, SMPS 2024, 2024, 1458 : 357 - 362
  • [33] Robust low-rank training via approximate orthonormal constraints
    Savostianova, Dayana
    Zangrando, Emanuele
    Ceruti, Gianluca
    Tudisco, Francesco
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 36 (NEURIPS 2023), 2023,
  • [34] Low-Rank Representation with Graph Constraints for Robust Visual Tracking
    Liu, Jieyan
    Ma, Ao
    Li, Jingjing
    Lu, Ke
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2017, E100D (06) : 1325 - 1338
  • [35] Low-rank and sparse matrices fitting algorithm for low-rank representation
    Zhao, Jianxi
    Zhao, Lina
    COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2020, 79 (02) : 407 - 425
  • [36] LOW-RANK AND SPARSE NMF FOR JOINT ENDMEMBERS' NUMBER ESTIMATION AND BLIND UNMIXING OF HYPERSPECTRAL IMAGES
    Giampouras, Paris V.
    Rontogiannis, Athanasios A.
    Koutroumbas, Konstantinos D.
    2017 25TH EUROPEAN SIGNAL PROCESSING CONFERENCE (EUSIPCO), 2017, : 1430 - 1434
  • [37] Unsupervised deep learning of foreground objects from low-rank and sparse dataset
    Takeda, Keita
    Sakai, Tomoya
    COMPUTER VISION AND IMAGE UNDERSTANDING, 2024, 240
  • [38] Bi-Endmember Semi-NMF Based on Low-Rank and Sparse Matrix Decomposition
    Song, Meiping
    Yang, Tingting
    Cao, Hongju
    Li, Fang
    Xue, Bai
    Li, Sen
    Chein-I Chang
    IEEE TRANSACTIONS ON GEOSCIENCE AND REMOTE SENSING, 2022, 60
  • [39] Sparse and low-rank recovery using adaptive thresholding
    Zarmehi, Nematollah
    Marvasti, Farokh
    DIGITAL SIGNAL PROCESSING, 2018, 73 : 145 - 152
  • [40] Robust Neighborhood Preserving Low-Rank Sparse CNN Features for Classification
    Tang, Zemin
    Zhang, Zhao
    Ma, Xiaohu
    Qin, Jie
    Zhao, Mingbo
    ADVANCES IN MULTIMEDIA INFORMATION PROCESSING, PT I, 2018, 11164 : 357 - 369