Pith

open record

sign in
Browse

arxiv: 2006.08497 · v1 · pith:DVUH6OWE · submitted 2020-06-15 · eess.AS · eess.SP

An Iterative Graph Spectral Subtraction Method for Speech Enhancement

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 reserved pith:DVUH6OWErecord.jsonopen to challenge →

classification eess.AS eess.SP
keywords graphspeechmethodspectralsubtractionenhancementiterativepropose
0
0 comments X
read the original abstract

In this paper, we investigate the application of graph signal processing (GSP) theory in speech enhancement. We first propose a set of shift operators to construct graph speech signals, and then analyze their spectrum in the graph Fourier domain. By leveraging the differences between the spectrum of graph speech and graph noise signals, we further propose the graph spectral subtraction (GSS) method to suppress the noise interference in noisy speech. Moreover, based on GSS, we propose the iterative graph spectral subtraction (IGSS) method to further improve the speech enhancement performance. Our experimental results show that the proposed operators are suitable for graph speech signals, and the proposed methods outperform the traditional basic spectral subtraction (BSS) method and iterative basic spectral subtraction (IBSS) method in terms of both signal-to-noise ratios (SNR) and mean Perceptual Evaluation of Speech Quality (PESQ).

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.