TY - CONF
AB - Signal dereverberation using the Weighted Prediction Error (WPE) method has been proven to be an effective means to raise the accuracy of far-field speech recognition. First proposed as an iterative algorithm, follow-up works have reformulated it as a recursive least squares algorithm and therefore enabled its use in online applications. For this algorithm, the estimation of the power spectral density (PSD) of the anechoic signal plays an important role and strongly influences its performance. Recently, we showed that using a neural network PSD estimator leads to improved performance for online automatic speech recognition. This, however, comes at a price. To train the network, we require parallel data, i.e., utterances simultaneously available in clean and reverberated form. Here we propose to overcome this limitation by training the network jointly with the acoustic model of the speech recognizer. To be specific, the gradients computed from the cross-entropy loss between the target senone sequence and the acoustic model network output is backpropagated through the complex-valued dereverberation filter estimation to the neural network for PSD estimation. Evaluation on two databases demonstrates improved performance for on-line processing scenarios while imposing fewer requirements on the available training data and thus widening the range of applications.
AU - Heymann, Jahn
AU - Drude, Lukas
AU - Haeb-Umbach, Reinhold
AU - Kinoshita, Keisuke
AU - Nakatani, Tomohiro
ID - 12875
T2 - ICASSP 2019, Brighton, UK
TI - Joint Optimization of Neural Network-based WPE Dereverberation and Acoustic Model for Robust Online ASR
ER -
TY - CONF
AB - In this paper, we present libDirectional, a MATLAB library for directional statistics and directional estimation. It supports a variety of commonly used distributions on the unit circle, such as the von Mises, wrapped normal, and wrapped Cauchy distributions. Furthermore, various distributions on higher-dimensional manifolds such as the unit hypersphere and the hypertorus are available. Based on these distributions, several recursive filtering algorithms in libDirectional allow estimation on these manifolds. The functionality is implemented in a clear, well-documented, and object-oriented structure that is both easy to use and easy to extend.
AU - Kurz, Gerhard
AU - Gilitschenski, Igor
AU - Pfaff, Florian
AU - Drude, Lukas
AU - Hanebeck, Uwe D.
AU - Haeb-Umbach, Reinhold
AU - Siegwart, Roland Y.
ID - 12876
T2 - Journal of Statistical Software 89(4)
TI - Directional Statistics and Filtering Using libDirectional
ER -
TY - JOUR
AB - We formulate a generic framework for blind source separation (BSS), which allows integrating data-driven spectro-temporal methods, such as deep clustering and deep attractor networks, with physically motivated probabilistic spatial methods, such as complex angular central Gaussian mixture models. The integrated model exploits the complementary strengths of the two approaches to BSS: the strong modeling power of neural networks, which, however, is based on supervised learning, and the ease of unsupervised learning of the spatial mixture models whose few parameters can be estimated on as little as a single segment of a real mixture of speech. Experiments are carried out on both artificially mixed speech and true recordings of speech mixtures. The experiments verify that the integrated models consistently outperform the individual components. We further extend the models to cope with noisy, reverberant speech and introduce a cross-domain teacher–student training where the mixture model serves as the teacher to provide training targets for the student neural network.
AU - Drude, Lukas
AU - Haeb-Umbach, Reinhold
ID - 12890
JF - IEEE Journal of Selected Topics in Signal Processing
TI - Integration of Neural Networks and Probabilistic Spatial Models for Acoustic Blind Source Separation
ER -
TY - CONF
AB - We propose a training scheme to train neural network-based source separation algorithms from scratch when parallel clean data is unavailable. In particular, we demonstrate that an unsupervised spatial clustering algorithm is sufficient to guide the training of a deep clustering system. We argue that previous work on deep clustering requires strong supervision and elaborate on why this is a limitation. We demonstrate that (a) the single-channel deep clustering system trained according to the proposed scheme alone is able to achieve a similar performance as the multi-channel teacher in terms of word error rates and (b) initializing the spatial clustering approach with the deep clustering result yields a relative word error rate reduction of 26% over the unsupervised teacher.
AU - Drude, Lukas
AU - Hasenklever, Daniel
AU - Haeb-Umbach, Reinhold
ID - 12874
T2 - ICASSP 2019, Brighton, UK
TI - Unsupervised Training of a Deep Clustering Model for Multichannel Blind Source Separation
ER -
TY - CONF
AB - We present an unsupervised training approach for a neural network-based mask estimator in an acoustic beamforming application. The network is trained to maximize a likelihood criterion derived from a spatial mixture model of the observations. It is trained from scratch without requiring any parallel data consisting of degraded input and clean training targets. Thus, training can be carried out on real recordings of noisy speech rather than simulated ones. In contrast to previous work on unsupervised training of neural mask estimators, our approach avoids the need for a possibly pre-trained teacher model entirely. We demonstrate the effectiveness of our approach by speech recognition experiments on two different datasets: one mainly deteriorated by noise (CHiME 4) and one by reverberation (REVERB). The results show that the performance of the proposed system is on par with a supervised system using oracle target masks for training and with a system trained using a model-based teacher.
AU - Drude, Lukas
AU - Heymann, Jahn
AU - Haeb-Umbach, Reinhold
ID - 11965
T2 - INTERSPEECH 2019, Graz, Austria
TI - Unsupervised training of neural mask-based beamforming
ER -
TY - CONF
AB - In this paper we consider human daily activity recognition using an acoustic sensor network (ASN) which consists of nodes distributed in a home environment. Assuming that the ASN is permanently recording, the vast majority of recordings is silence. Therefore, we propose to employ a computationally efficient two-stage sound recognition system, consisting of an initial sound activity detection (SAD) and a subsequent sound event classification (SEC), which is only activated once sound activity has been detected. We show how a low-latency activity detector with high temporal resolution can be trained from weak labels with low temporal resolution. We further demonstrate the advantage of using spatial features for the subsequent event classification task.
AU - Ebbers, Janek
AU - Drude, Lukas
AU - Haeb-Umbach, Reinhold
AU - Brendel, Andreas
AU - Kellermann, Walter
ID - 15796
T2 - CAMSAP 2019, Guadeloupe, West Indies
TI - Weakly Supervised Sound Activity Detection and Event Classification in Acoustic Sensor Networks
ER -
TY - CONF
AB - This contribution presents a speech enhancement system for the CHiME-5 Dinner Party Scenario. The front-end employs multi-channel linear time-variant filtering and achieves its gains without the use of a neural network. We present an adaptation of blind source separation techniques to the CHiME-5 database which we call Guided Source Separation (GSS). Using the baseline acoustic and language model, the combination of Weighted Prediction Error based dereverberation, guided source separation, and beamforming reduces the WER by 10:54% (relative) for the single array track and by 21:12% (relative) on the multiple array track.
AU - Boeddeker, Christoph
AU - Heitkaemper, Jens
AU - Schmalenstroeer, Joerg
AU - Drude, Lukas
AU - Heymann, Jahn
AU - Haeb-Umbach, Reinhold
ID - 12899
T2 - INTERSPEECH 2018, Hyderabad, India
TI - Front-End Processing for the CHiME-5 Dinner Party Scenario
ER -
TY - CONF
AB - The weighted prediction error (WPE) algorithm has proven to be a very successful dereverberation method for the REVERB challenge. Likewise, neural network based mask estimation for beamforming demonstrated very good noise suppression in the CHiME 3 and CHiME 4 challenges. Recently, it has been shown that this estimator can also be trained to perform dereverberation and denoising jointly. However, up to now a comparison of a neural beamformer and WPE is still missing, so is an investigation into a combination of the two. Therefore, we here provide an extensive evaluation of both and consequently propose variants to integrate deep neural network based beamforming with WPE. For these integrated variants we identify a consistent word error rate (WER) reduction on two distinct databases. In particular, our study shows that deep learning based beamforming benefits from a model-based dereverberation technique (i.e. WPE) and vice versa. Our key findings are: (a) Neural beamforming yields the lower WERs in comparison to WPE the more channels and noise are present. (b) Integration of WPE and a neural beamformer consistently outperforms all stand-alone systems.
AU - Drude, Lukas
AU - Boeddeker, Christoph
AU - Heymann, Jahn
AU - Kinoshita, Keisuke
AU - Delcroix, Marc
AU - Nakatani, Tomohiro
AU - Haeb-Umbach, Reinhold
ID - 11872
T2 - INTERSPEECH 2018, Hyderabad, India
TI - Integration neural network based beamforming and weighted prediction error dereverberation
ER -
TY - CONF
AB - Signal dereverberation using the weighted prediction error (WPE) method has been proven to be an effective means to raise the accuracy of far-field speech recognition. But in its original formulation, WPE requires multiple iterations over a sufficiently long utterance, rendering it unsuitable for online low-latency applications. Recently, two methods have been proposed to overcome this limitation. One utilizes a neural network to estimate the power spectral density (PSD) of the target signal and works in a block-online fashion. The other method relies on a rather simple PSD estimation which smoothes the observed PSD and utilizes a recursive formulation which enables it to work on a frame-by-frame basis. In this paper, we integrate a deep neural network (DNN) based estimator into the recursive frame-online formulation. We evaluate the performance of the recursive system with different PSD estimators in comparison to the block-online and offline variant on two distinct corpora. The REVERB challenge data, where the signal is mainly deteriorated by reverberation, and a database which combines WSJ and VoiceHome to also consider (directed) noise sources. The results show that although smoothing works surprisingly well, the more sophisticated DNN based estimator shows promising improvements and shortens the performance gap between online and offline processing.
AU - Heymann, Jahn
AU - Drude, Lukas
AU - Haeb-Umbach, Reinhold
AU - Kinoshita, Keisuke
AU - Nakatani, Tomohiro
ID - 11835
T2 - IWAENC 2018, Tokio, Japan
TI - Frame-Online DNN-WPE Dereverberation
ER -
TY - CONF
AB - NARA-WPE is a Python software package providing implementations of the weighted prediction error (WPE) dereverberation algorithm. WPE has been shown to be a highly effective tool for speech dereverberation, thus improving the perceptual quality of the signal and improving the recognition performance of downstream automatic speech recognition (ASR). It is suitable both for single-channel and multi-channel applications. The package consist of (1) a Numpy implementation which can easily be integrated into a custom Python toolchain, and (2) a TensorFlow implementation which allows integration into larger computational graphs and enables backpropagation through WPE to train more advanced front-ends. This package comprises of an iterative offline (batch) version, a block-online version, and a frame-online version which can be used in moderately low latency applications, e.g. digital speech assistants.
AU - Drude, Lukas
AU - Heymann, Jahn
AU - Boeddeker, Christoph
AU - Haeb-Umbach, Reinhold
ID - 11873
T2 - ITG 2018, Oldenburg, Germany
TI - NARA-WPE: A Python package for weighted prediction error dereverberation in Numpy and Tensorflow for online and offline processing
ER -
TY - CONF
AB - Deep attractor networks (DANs) are a recently introduced method to blindly separate sources from spectral features of a monaural recording using bidirectional long short-term memory networks (BLSTMs). Due to the nature of BLSTMs, this is inherently not online-ready and resorting to operating on blocks yields a block permutation problem in that the index of each speaker may change between blocks. We here propose the joint modeling of spatial and spectral features to solve the block permutation problem and generalize DANs to multi-channel meeting recordings: The DAN acts as a spectral feature extractor for a subsequent model-based clustering approach. We first analyze different joint models in batch-processing scenarios and finally propose a block-online blind source separation algorithm. The efficacy of the proposed models is demonstrated on reverberant mixtures corrupted by real recordings of multi-channel background noise. We demonstrate that both the proposed batch-processing and the proposed block-online system outperform (a) a spatial-only model with a state-of-the-art frequency permutation solver and (b) a spectral-only model with an oracle block permutation solver in terms of signal to distortion ratio (SDR) gains.
AU - Drude, Lukas
AU - Higuchi,, Takuya
AU - Kinoshita, Keisuke
AU - Nakatani, Tomohiro
AU - Haeb-Umbach, Reinhold
ID - 12900
T2 - ICASSP 2018, Calgary, Canada
TI - Dual Frequency- and Block-Permutation Alignment for Deep Learning Based Block-Online Blind Source Separation
ER -
TY - CONF
AB - This paper describes the systems for the single-array track and the multiple-array track of the 5th CHiME Challenge. The final system is a combination of multiple systems, using Confusion Network Combination (CNC). The different systems presented here are utilizing different front-ends and training sets for a Bidirectional Long Short-Term Memory (BLSTM) Acoustic Model (AM). The front-end was replaced by enhancements provided by Paderborn University [1]. The back-end has been implemented using RASR [2] and RETURNN [3]. Additionally, a system combination including the hypothesis word graphs from the system of the submission [1] has been performed, which results in the final best system.
AU - Kitza, Markus
AU - Michel, Wilfried
AU - Boeddeker, Christoph
AU - Heitkaemper, Jens
AU - Menne, Tobias
AU - Schlüter, Ralf
AU - Ney, Hermann
AU - Schmalenstroeer, Joerg
AU - Drude, Lukas
AU - Heymann, Jahn
AU - Haeb-Umbach, Reinhold
ID - 11876
T2 - INTERSPEECH 2018, Hyderabad, India
TI - The RWTH/UPB System Combination for the CHiME 2018 Workshop
ER -
TY - CONF
AB - Deep clustering (DC) and deep attractor networks (DANs) are a data-driven way to monaural blind source separation. Both approaches provide astonishing single channel performance but have not yet been generalized to block-online processing. When separating speech in a continuous stream with a block-online algorithm, it needs to be determined in each block which of the output streams belongs to whom. In this contribution we solve this block permutation problem by introducing an additional speaker identification embedding to the DAN model structure. We motivate this model decision by analyzing the embedding topology of DC and DANs and show, that DC and DANs themselves are not sufficient for speaker identification. This model structure (a) improves the signal to distortion ratio (SDR) over a DAN baseline and (b) provides up to 61% and up to 34% relative reduction in permutation error rate and re-identification error rate compared to an i-vector baseline, respectively.
AU - Drude, Lukas
AU - von Neumann, Thilo
AU - Haeb-Umbach, Reinhold
ID - 12898
T2 - ICASSP 2018, Calgary, Canada
TI - Deep Attractor Networks for Speaker Re-Identifikation and Blind Source Separation
ER -
TY - JOUR
AB - Acoustic beamforming can greatly improve the performance of Automatic Speech Recognition (ASR) and speech enhancement systems when multiple channels are available. We recently proposed a way to support the model-based Generalized Eigenvalue beamforming operation with a powerful neural network for spectral mask estimation. The enhancement system has a number of desirable properties. In particular, neither assumptions need to be made about the nature of the acoustic transfer function (e.g., being anechonic), nor does the array configuration need to be known. While the system has been originally developed to enhance speech in noisy environments, we show in this article that it is also effective in suppressing reverberation, thus leading to a generic trainable multi-channel speech enhancement system for robust speech processing. To support this claim, we consider two distinct datasets: The CHiME 3 challenge, which features challenging real-world noise distortions, and the Reverb challenge, which focuses on distortions caused by reverberation. We evaluate the system both with respect to a speech enhancement and a recognition task. For the first task we propose a new way to cope with the distortions introduced by the Generalized Eigenvalue beamformer by renormalizing the target energy for each frequency bin, and measure its effectiveness in terms of the PESQ score. For the latter we feed the enhanced signal to a strong DNN back-end and achieve state-of-the-art ASR results on both datasets. We further experiment with different network architectures for spectral mask estimation: One small feed-forward network with only one hidden layer, one Convolutional Neural Network and one bi-directional Long Short-Term Memory network, showing that even a small network is capable of delivering significant performance improvements.
AU - Heymann, Jahn
AU - Drude, Lukas
AU - Haeb-Umbach, Reinhold
ID - 11811
JF - Computer Speech and Language
TI - A Generic Neural Acoustic Beamforming Architecture for Robust Multi-Channel Speech Processing
ER -
TY - CONF
AB - This paper presents an end-to-end training approach for a beamformer-supported multi-channel ASR system. A neural network which estimates masks for a statistically optimum beamformer is jointly trained with a network for acoustic modeling. To update its parameters, we propagate the gradients from the acoustic model all the way through feature extraction and the complex valued beamforming operation. Besides avoiding a mismatch between the front-end and the back-end, this approach also eliminates the need for stereo data, i.e., the parallel availability of clean and noisy versions of the signals. Instead, it can be trained with real noisy multichannel data only. Also, relying on the signal statistics for beamforming, the approach makes no assumptions on the configuration of the microphone array. We further observe a performance gain through joint training in terms of word error rate in an evaluation of the system on the CHiME 4 dataset.
AU - Heymann, Jahn
AU - Drude, Lukas
AU - Boeddeker, Christoph
AU - Hanebrink, Patrick
AU - Haeb-Umbach, Reinhold
ID - 11809
T2 - Proc. IEEE Intl. Conf. on Acoustics, Speech and Signal Processing (ICASSP)
TI - BEAMNET: End-to-End Training of a Beamformer-Supported Multi-Channel ASR System
ER -
TY - CONF
AB - Recent advances in discriminatively trained mask estimation networks to extract a single source utilizing beamforming techniques demonstrate, that the integration of statistical models and deep neural networks (DNNs) are a promising approach for robust automatic speech recognition (ASR) applications. In this contribution we demonstrate how discriminatively trained embeddings on spectral features can be tightly integrated into statistical model-based source separation to separate and transcribe overlapping speech. Good generalization to unseen spatial configurations is achieved by estimating a statistical model at test time, while still leveraging discriminative training of deep clustering embeddings on a separate training set. We formulate an expectation maximization (EM) algorithm which jointly estimates a model for deep clustering embeddings and complex-valued spatial observations in the short time Fourier transform (STFT) domain at test time. Extensive simulations confirm, that the integrated model outperforms (a) a deep clustering model with a subsequent beamforming step and (b) an EM-based model with a beamforming step alone in terms of signal to distortion ratio (SDR) and perceptually motivated metric (PESQ) gains. ASR results on a reverberated dataset further show, that the aforementioned gains translate to reduced word error rates (WERs) even in reverberant environments.
AU - Drude, Lukas
AU - Haeb-Umbach, Reinhold
ID - 11754
T2 - INTERSPEECH 2017, Stockholm, Schweden
TI - Tight integration of spatial and spectral features for BSS with Deep Clustering embeddings
ER -
TY - CONF
AB - Variational Autoencoders (VAEs) have been shown to provide efficient neural-network-based approximate Bayesian inference for observation models for which exact inference is intractable. Its extension, the so-called Structured VAE (SVAE) allows inference in the presence of both discrete and continuous latent variables. Inspired by this extension, we developed a VAE with Hidden Markov Models (HMMs) as latent models. We applied the resulting HMM-VAE to the task of acoustic unit discovery in a zero resource scenario. Starting from an initial model based on variational inference in an HMM with Gaussian Mixture Model (GMM) emission probabilities, the accuracy of the acoustic unit discovery could be significantly improved by the HMM-VAE. In doing so we were able to demonstrate for an unsupervised learning task what is well-known in the supervised learning case: Neural networks provide superior modeling power compared to GMMs.
AU - Ebbers, Janek
AU - Heymann, Jahn
AU - Drude, Lukas
AU - Glarner, Thomas
AU - Haeb-Umbach, Reinhold
AU - Raj, Bhiksha
ID - 11759
T2 - INTERSPEECH 2017, Stockholm, Schweden
TI - Hidden Markov Model Variational Autoencoder for Acoustic Unit Discovery
ER -
TY - GEN
AB - This report describes the computation of gradients by algorithmic differentiation for statistically optimum beamforming operations. Especially the derivation of complex-valued functions is a key component of this approach. Therefore the real-valued algorithmic differentiation is extended via the complex-valued chain rule. In addition to the basic mathematic operations the derivative of the eigenvalue problem with complex-valued eigenvectors is one of the key results of this report. The potential of this approach is shown with experimental results on the CHiME-3 challenge database. There, the beamforming task is used as a front-end for an ASR system. With the developed derivatives a joint optimization of a speech enhancement and speech recognition system w.r.t. the recognition optimization criterion is possible.
AU - Boeddeker, Christoph
AU - Hanebrink, Patrick
AU - Drude, Lukas
AU - Heymann, Jahn
AU - Haeb-Umbach, Reinhold
ID - 11735
TI - On the Computation of Complex-valued Gradients with Application to Statistically Optimum Beamforming
ER -
TY - CONF
AB - In this paper we show how a neural network for spectral mask estimation for an acoustic beamformer can be optimized by algorithmic differentiation. Using the beamformer output SNR as the objective function to maximize, the gradient is propagated through the beamformer all the way to the neural network which provides the clean speech and noise masks from which the beamformer coefficients are estimated by eigenvalue decomposition. A key theoretical result is the derivative of an eigenvalue problem involving complex-valued eigenvectors. Experimental results on the CHiME-3 challenge database demonstrate the effectiveness of the approach. The tools developed in this paper are a key component for an end-to-end optimization of speech enhancement and speech recognition.
AU - Boeddeker, Christoph
AU - Hanebrink, Patrick
AU - Drude, Lukas
AU - Heymann, Jahn
AU - Haeb-Umbach, Reinhold
ID - 11736
T2 - Proc. IEEE Intl. Conf. on Acoustics, Speech and Signal Processing (ICASSP)
TI - Optimizing Neural-Network Supported Acoustic Beamforming by Algorithmic Differentiation
ER -
TY - CONF
AB - Multi-channel speech enhancement algorithms rely on a synchronous sampling of the microphone signals. This, however, cannot always be guaranteed, especially if the sensors are distributed in an environment. To avoid performance degradation the sampling rate offset needs to be estimated and compensated for. In this contribution we extend the recently proposed coherence drift based method in two important directions. First, the increasing phase shift in the short-time Fourier transform domain is estimated from the coherence drift in a Matched Filterlike fashion, where intermediate estimates are weighted by their instantaneous SNR. Second, an observed bias is removed by iterating between offset estimation and compensation by resampling a couple of times. The effectiveness of the proposed method is demonstrated by speech recognition results on the output of a beamformer with and without sampling rate offset compensation between the input channels. We compare MVDR and maximum-SNR beamformers in reverberant environments and further show that both benefit from a novel phase normalization, which we also propose in this contribution.
AU - Schmalenstroeer, Joerg
AU - Heymann, Jahn
AU - Drude, Lukas
AU - Boeddeker, Christoph
AU - Haeb-Umbach, Reinhold
ID - 11895
T2 - IEEE 19th International Workshop on Multimedia Signal Processing (MMSP)
TI - Multi-Stage Coherence Drift Based Sampling Rate Synchronization for Acoustic Beamforming
ER -
TY - CONF
AB - This paper is concerned with speech presence probability estimation employing an explicit model of the temporal and spectral correlations of speech. An undirected graphical model is introduced, based on a Factor Graph formulation. It is shown that this undirected model cures some of the theoretical issues of an earlier directed graphical model. Furthermore, we formulate a message passing inference scheme based on an approximate graph factorization, identify this inference scheme as a particular message passing schedule based on the turbo principle and suggest further alternative schedules. The experiments show an improved performance over speech presence probability estimation based on an IID assumption, and a slightly better performance of the turbo schedule over the alternatives.
AU - Glarner, Thomas
AU - Mahdi Momenzadeh, Mohammad
AU - Drude, Lukas
AU - Haeb-Umbach, Reinhold
ID - 11771
T2 - 12. ITG Fachtagung Sprachkommunikation (ITG 2016)
TI - Factor Graph Decoding for Speech Presence Probability Estimation
ER -
TY - CONF
AB - We present a system for the 4th CHiME challenge which significantly increases the performance for all three tracks with respect to the provided baseline system. The front-end uses a bi-directional Long Short-Term Memory (BLSTM)-based neural network to estimate signal statistics. These then steer a Generalized Eigenvalue beamformer. The back-end consists of a 22 layer deep Wide Residual Network and two extra BLSTM layers. Working on a whole utterance instead of frames allows us to refine Batch-Normalization. We also train our own BLSTM-based language model. Adding a discriminative speaker adaptation leads to further gains. The final system achieves a word error rate on the six channel real test data of 3.48%. For the two channel track we achieve 5.96% and for the one channel track 9.34%. This is the best reported performance on the challenge achieved by a single system, i.e., a configuration, which does not combine multiple systems. At the same time, our system is independent of the microphone configuration. We can thus use the same components for all three tracks.
AU - Heymann, Jahn
AU - Drude, Lukas
AU - Haeb-Umbach, Reinhold
ID - 11834
T2 - Computer Speech and Language
TI - Wide Residual BLSTM Network with Discriminative Speaker Adaptation for Robust Speech Recognition
ER -
TY - CONF
AU - Heymann, Jahn
AU - Drude, Lukas
AU - Haeb-Umbach, Reinhold
ID - 11812
T2 - Proc. IEEE Intl. Conf. on Acoustics, Speech and Signal Processing (ICASSP)
TI - Neural Network Based Spectral Mask Estimation for Acoustic Beamforming
ER -
TY - CONF
AB - A noise power spectral density (PSD) estimation is an indispensable component of speech spectral enhancement systems. In this paper we present a noise PSD tracking algorithm, which employs a noise presence probability estimate delivered by a deep neural network (DNN). The algorithm provides a causal noise PSD estimate and can thus be used in speech enhancement systems for communication purposes. An extensive performance comparison has been carried out with ten causal state-of-the-art noise tracking algorithms taken from the literature and categorized acc. to applied techniques. The experiments showed that the proposed DNN-based noise PSD tracker outperforms all competing methods with respect to all tested performance measures, which include the noise tracking performance and the performance of a speech enhancement system employing the noise tracking component.
AU - Chinaev, Aleksej
AU - Heymann, Jahn
AU - Drude, Lukas
AU - Haeb-Umbach, Reinhold
ID - 11744
T2 - 12. ITG Fachtagung Sprachkommunikation (ITG 2016)
TI - Noise-Presence-Probability-Based Noise PSD Estimation by Using DNNs
ER -
TY - CONF
AU - Drude, Lukas
AU - Boeddeker, Christoph
AU - Haeb-Umbach, Reinhold
ID - 11751
T2 - Proc. IEEE Intl. Conf. on Acoustics, Speech and Signal Processing (ICASSP)
TI - Blind Speech Separation based on Complex Spherical k-Mode Clustering
ER -
TY - CONF
AB - Although complex-valued neural networks (CVNNs) â?? networks which can operate with complex arithmetic â?? have been around for a while, they have not been given reconsideration since the breakthrough of deep network architectures. This paper presents a critical assessment whether the novel tool set of deep neural networks (DNNs) should be extended to complex-valued arithmetic. Indeed, with DNNs making inroads in speech enhancement tasks, the use of complex-valued input data, specifically the short-time Fourier transform coefficients, is an obvious consideration. In particular when it comes to performing tasks that heavily rely on phase information, such as acoustic beamforming, complex-valued algorithms are omnipresent. In this contribution we recapitulate backpropagation in CVNNs, develop complex-valued network elements, such as the split-rectified non-linearity, and compare real- and complex-valued networks on a beamforming task. We find that CVNNs hardly provide a performance gain and conclude that the effort of developing the complex-valued counterparts of the building blocks of modern deep or recurrent neural networks can hardly be justified.
AU - Drude, Lukas
AU - Raj, Bhiksha
AU - Haeb-Umbach, Reinhold
ID - 11756
T2 - INTERSPEECH 2016, San Francisco, USA
TI - On the appropriateness of complex-valued neural networks for speech enhancement
ER -
TY - CONF
AB - This paper describes automatic speech recognition (ASR) systems developed jointly by RWTH, UPB and FORTH for the 1ch, 2ch and 6ch track of the 4th CHiME Challenge. In the 2ch and 6ch tracks the final system output is obtained by a Confusion Network Combination (CNC) of multiple systems. The Acoustic Model (AM) is a deep neural network based on Bidirectional Long Short-Term Memory (BLSTM) units. The systems differ by front ends and training sets used for the acoustic training. The model for the 1ch track is trained without any preprocessing. For each front end we trained and evaluated individual acoustic models. We compare the ASR performance of different beamforming approaches: a conventional superdirective beamformer [1] and an MVDR beamformer as in [2], where the steering vector is estimated based on [3]. Furthermore we evaluated a BLSTM supported Generalized Eigenvalue beamformer using NN-GEV [4]. The back end is implemented using RWTH?s open-source toolkits RASR [5], RETURNN [6] and rwthlm [7]. We rescore lattices with a Long Short-Term Memory (LSTM) based language model. The overall best results are obtained by a system combination that includes the lattices from the system of UPB?s submission [8]. Our final submission scored second in each of the three tracks of the 4th CHiME Challenge.
AU - Menne, Tobias
AU - Heymann, Jahn
AU - Alexandridis, Anastasios
AU - Irie, Kazuki
AU - Zeyer, Albert
AU - Kitza, Markus
AU - Golik, Pavel
AU - Kulikov, Ilia
AU - Drude, Lukas
AU - Schlüter, Ralf
AU - Ney, Hermann
AU - Haeb-Umbach, Reinhold
AU - Mouchtaris, Athanasios
ID - 11908
T2 - Computer Speech and Language
TI - The RWTH/UPB/FORTH System Combination for the 4th CHiME Challenge Evaluation
ER -
TY - CONF
AU - Heymann, Jahn
AU - Drude, Lukas
AU - Chinaev, Aleksej
AU - Haeb-Umbach, Reinhold
ID - 11810
T2 - Automatic Speech Recognition and Understanding Workshop (ASRU 2015)
TI - BLSTM supported GEV Beamformer Front-End for the 3RD CHiME Challenge
ER -
TY - CONF
AB - This contribution presents a Direction of Arrival (DoA) estimation algorithm based on the complex Watson distribution to incorporate both phase and level differences of captured micro- phone array signals. The derived algorithm is reviewed in the context of the Generalized State Coherence Transform (GSCT) on the one hand and a kernel density estimation method on the other hand. A thorough simulative evaluation yields insight into parameter selection and provides details on the performance for both directional and omni-directional microphones. A comparison to the well known Steered Response Power with Phase Transform (SRP-PHAT) algorithm and a state of the art DoA estimator which explicitly accounts for aliasing, shows in particular the advantages of presented algorithm if inter-sensor level differences are indicative of the DoA, as with directional microphones.
AU - Drude, Lukas
AU - Jacob, Florian
AU - Haeb-Umbach, Reinhold
ID - 11755
T2 - 23th European Signal Processing Conference (EUSIPCO 2015)
TI - DOA-Estimation based on a Complex Watson Kernel Method
ER -
TY - CONF
AB - In this paper we present a source counting algorithm to determine the number of speakers in a speech mixture. In our proposed method, we model the histogram of estimated directions of arrival with a nonparametric Bayesian infinite Gaussian mixture model. As an alternative to classical model selection criteria and to avoid specifying the maximum number of mixture components in advance, a Dirichlet process prior is employed over the mixture components. This allows to automatically determine the optimal number of mixture components that most probably model the observations. We demonstrate by experiments that this model outperforms a parametric approach using a finite Gaussian mixture model with a Dirichlet distribution prior over the mixture weights.
AU - Walter, Oliver
AU - Drude, Lukas
AU - Haeb-Umbach, Reinhold
ID - 11919
T2 - 40th International Conference on Acoustics, Speech and Signal Processing (ICASSP 2015)
TI - Source Counting in Speech Mixtures by Nonparametric Bayesian Estimation of an infinite Gaussian Mixture Model
ER -
TY - CONF
AB - "In this contribution we derive a variational EM (VEM) algorithm for model selection in complex Watson mixture models, which have been recently proposed as a model of the distribution of normalized microphone array signals in the short-time Fourier transform domain. The VEM algorithm is applied to count the number of active sources in a speech mixture by iteratively estimating the mode vectors of the Watson distributions and suppressing the signals from the corresponding directions. A key theoretical contribution is the derivation of the MMSE estimate of a quadratic form involving the mode vector of the Watson distribution. The experimental results demonstrate the effectiveness of the source counting approach at moderately low SNR. It is further shown that the VEM algorithm is more robust w.r.t. used threshold values."
AU - Drude, Lukas
AU - Chinaev, Aleksej
AU - Tran Vu, Dang Hai
AU - Haeb-Umbach, Reinhold
ID - 11752
T2 - 39th International Conference on Acoustics, Speech and Signal Processing (ICASSP 2014)
TI - Source Counting in Speech Mixtures Using a Variational EM Approach for Complexwatson Mixture Models
ER -
TY - CONF
AB - This contribution describes a step-wise source counting algorithm to determine the number of speakers in an offline scenario. Each speaker is identified by a variational expectation maximization (VEM) algorithm for complex Watson mixture models and therefore directly yields beamforming vectors for a subsequent speech separation process. An observation selection criterion is proposed which improves the robustness of the source counting in noise. The algorithm is compared to an alternative VEM approach with Gaussian mixture models based on directions of arrival and shown to deliver improved source counting accuracy. The article concludes by extending the offline algorithm towards a low-latency online estimation of the number of active sources from the streaming input data.
AU - Drude, Lukas
AU - Chinaev, Aleksej
AU - Tran Vu, Dang Hai
AU - Haeb-Umbach, Reinhold
ID - 11753
KW - Accuracy
KW - Acoustics
KW - Estimation
KW - Mathematical model
KW - Soruce separation
KW - Speech
KW - Vectors
KW - Bayes methods
KW - Blind source separation
KW - Directional statistics
KW - Number of speakers
KW - Speaker diarization
T2 - 14th International Workshop on Acoustic Signal Enhancement (IWAENC 2014)
TI - Towards Online Source Counting in Speech Mixtures Applying a Variational EM for Complex Watson Mixture Models
ER -