• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

A real-time blind source separation scheme and its application to reverberant and noisy acoustic environments,” 2008 (2008)

by R Aichner, H Buchner, F Yan, W Kellermann
Venue:IEEE Workshop on
Add To MetaCart

Tools

Sorted by:
Results 1 - 10 of 17
Next 10 →

Simultaneous localization of multiple sound sources using blind adaptive MIMO filtering

by Anthony Lombard, Herbert Buchner, Walter Kellermann - In IEEE Int. Conf. Acoustics, Speech, Signal Processing (ICASSP , 2005
"... Abstract — The TDOA-based acoustic source localization approach is a powerful and widely-used method which can be applied for one source in several dimensions or several sources in one dimension. However the localization turns out to be more challenging when multiple sound sources should be localize ..."
Abstract - Cited by 36 (17 self) - Add to MetaCart
Abstract — The TDOA-based acoustic source localization approach is a powerful and widely-used method which can be applied for one source in several dimensions or several sources in one dimension. However the localization turns out to be more challenging when multiple sound sources should be localized in multiple dimensions, due to a spatial ambiguity phenomenon which requires to perform an intermediate step after the TDOA estimation and before the calculation of the geometrical source positions. In order to obtain the required set of TDOA estimates for the multidimensional localization of multiple sound sources, we apply a recently presented TDOA estimation method based on blind adaptive multiple-input-multiple-output (MIMO) system identification. We demonstrate that this localization method also provides valuable side information which allows us to resolve the spatial ambiguity without any prior knowledge about the source positions. Furthermore we show that the blind adaptive MIMO system identification allows a high spatial resolution. Experimental results for the localization of two sources in a two-dimensional plane show the effectiveness of the proposed scheme. I.
(Show Context)

Citation Context

...Rss(i) =bdiagˆ D Ryy(i). Note that there are also efficient approximations of this algorithm with a reduced computational complexity allowing already real-time operation on a regular PC platform (see =-=[9]-=- for implementation details and parameterization). C. TDOA estimation For simplicity we focus here on the case of P =2 sources. In this case the SOS-based BSS algorithm described above ideally converg...

Exploiting Narrowband Efficiency for Broadband Convolutive Blind Source Separation

by Robert Aichner, Herbert Buchner, Walter Kellermann , 2007
"... Based on a recently presented generic broadband blind source separation (BSS) algorithm for convolutive mixtures, we propose in this paper a novel algorithm combining advantages of broadband algorithms with the computational efficiency of narrowband techniques. By selective application of the Szegö ..."
Abstract - Cited by 6 (5 self) - Add to MetaCart
Based on a recently presented generic broadband blind source separation (BSS) algorithm for convolutive mixtures, we propose in this paper a novel algorithm combining advantages of broadband algorithms with the computational efficiency of narrowband techniques. By selective application of the Szegö theorem which relates properties of Toeplitz and circulant matrices, a new normalization is derived as a special case of the generic broadband algorithm. This results in a computationally efficient and fast converging algorithm without introducing typical narrowband problems such as the internal permutation problem or circularity effects. Moreover, a novel regularization method for the generic broadband algorithm is proposed and subsequently also derived for the proposed algorithm. Experimental results in realistic acoustic environments show improved performance of the novel algorithm compared to previous approximations.

EVALUATION OF SIGNAL ENHANCEMENT ALGORITHMS FOR HEARING INSTRUMENTS

by Koen Eneman, Heleen Luts, Jan Wouters, Michael Büchler, Norbert Dillier, Wouter Dreschler, Matthias Froehlich, Giso Grimm, Volker Hohmann, Rolph Houben, Arne Leijon, Anthony Lombard, Dirk Mauler, Marc Moonen, Henning Puder, Michael Schulte, Ann Spriet, Matthias Vormann
"... In the frame of the HearCom 1 project five promising signal enhancement algorithms are validated for future use in hearing instrument devices. To assess the algorithm performance solely based on simulation experiments, a number of physical evaluation measures have been proposed that incorporate basi ..."
Abstract - Cited by 5 (1 self) - Add to MetaCart
In the frame of the HearCom 1 project five promising signal enhancement algorithms are validated for future use in hearing instrument devices. To assess the algorithm performance solely based on simulation experiments, a number of physical evaluation measures have been proposed that incorporate basic aspects of normal and impaired human hearing. Additionally, each of the algorithms has been implemented on a common real-time hardware/software platform, which facilitates a profound subjective validation of the algorithm performance. Recently, a multicenter study has been set up across five different test centers in Belgium, the Netherlands, Germany and Switzerland to perceptually evaluate the selected signal enhancement approaches with normally hearing and hearing impaired listeners. 1.
(Show Context)

Citation Context

...eveloped [14]. 1.3 Broadband blind source separation based on second-order statistics (BSS) The blind source separation (BSS) algorithm considered in the HearCom project is based on work published in =-=[1]-=- [2] [3] [4], and in [5, Sect. II-E], where a class of broadband time-domain and frequency-domain BSS algorithms were derived that are based on second-order statistics. These broadband BSS approaches ...

Robustness of Acoustic Multiple-Source Localization in Adverse Environments

by Robert Aichner, Herbert Buchner, Stefan Wehr, Walter Kellermann
"... In this paper the robustness of a previously introduced localization algorithm for multiple acoustic sources is investigated and compared to two popular single-source localization algorithms. To show the versatility of the proposed method, experiments are conducted in various environments with diffe ..."
Abstract - Cited by 3 (1 self) - Add to MetaCart
In this paper the robustness of a previously introduced localization algorithm for multiple acoustic sources is investigated and compared to two popular single-source localization algorithms. To show the versatility of the proposed method, experiments are conducted in various environments with different reverberation times and background noises. In addition, moving speakers are used to show the tracking capability. The application to binaural hearing aids shows the applicability of the algorithm to realistic adverse environments such as, e.g., a cafeteria. 1
(Show Context)

Citation Context

...used for the FIR filters wpq(n) is a broadband blind source separation algorithm derived from the framework in [4]. The adaptation algorithm and its real-time implementation is explained in detail in =-=[5]-=- where also a pseudo-code is included. It should be pointed out that due to the fact that the algorithm is based on timedomain optimization utilizing the broadband signal model, this approach aims at ...

Combination of Adaptive Feedback Cancellation and Binaural Adaptive Filtering in Hearing Aids

by Anthony Lombard, Klaus Reindl, Walter Kellermann , 2009
"... We study a system combining adaptive feedback cancellation and adaptive filtering connecting inputs from both ears for signal enhancement in hearing aids. For the first time, such a binaural system is analyzed in terms of system stability, convergence of the algorithms, and possible interaction effe ..."
Abstract - Cited by 3 (1 self) - Add to MetaCart
We study a system combining adaptive feedback cancellation and adaptive filtering connecting inputs from both ears for signal enhancement in hearing aids. For the first time, such a binaural system is analyzed in terms of system stability, convergence of the algorithms, and possible interaction effects. As major outcomes of this study, a new stability condition adapted to the considered binaural scenario is presented, some already existing and commonly used feedback cancellation performance measures for the unilateral case are adapted to the binaural case, and possible interaction effects between the algorithms are identified. For illustration purposes, a blind source separation algorithm has been chosen as an example for adaptive binaural spatial filtering. Experimental results for binaural hearing aids confirm the theoretical findings and the validity of the new measures.

The TRINICON framework for adaptive MIMO signal processing with focus on the generic Sylvester constraint

by Herbert Buchner, Robert Aichner, Walter Kellermann
"... This paper gives an overview on TRINICON, a generic framework for broadband adaptive MIMO filtering, and some of its applications in array processing for speech capture. The motivations for this framework are to bring together the various blind and supervised MIMO adaptation techniques which have be ..."
Abstract - Cited by 2 (2 self) - Add to MetaCart
This paper gives an overview on TRINICON, a generic framework for broadband adaptive MIMO filtering, and some of its applications in array processing for speech capture. The motivations for this framework are to bring together the various blind and supervised MIMO adaptation techniques which have been treated largely independently in the literature so far, in order to spotlight their commonalities and relationships, to derive them in a rigorous way from first principles, to facilitate the design of improved systems, and to exploit synergies. In this paper, a special focus is on new results on the so-called Sylvester constraint, an important element of the framework. 1
(Show Context)

Citation Context

...te can be written as ∆ ˇW ℓ (m) = SC {∇WJ (m,W)}| W=W ℓ (m) . (8) Depending on the particular realization of (SC), we are able to select both, well known and also novel improved adaptation algorithms =-=[10]-=- as we will demonstrate in Sect. 5. In [1] an explicit formulation of a generic Sylvester constraint was derived to further formalize and clarify this concept. It turns out that the generic Sylvester ...

Residual Cross-talk and Noise Suppression for Convolutive Blind Source Separation

by Robert Aichner, Meray Zourub, Herbert Buchner, Walter Kellermann
"... Blind source separation (BSS) refers to the problem of recovering signals from several observed linear mixtures (e.g., [1]). In this paper we deal with the convolutive mixing case as encountered, e.g., in acoustic environments, ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Blind source separation (BSS) refers to the problem of recovering signals from several observed linear mixtures (e.g., [1]). In this paper we deal with the convolutive mixing case as encountered, e.g., in acoustic environments,
(Show Context)

Citation Context

...l signalto-distortion ratio (SDR) between the desired signal at the input of the post-filter and the processed desired signal was used. For the BSS stage the algorithm and the parameters described in =-=[5]-=- have been used, and for the post-processing algorithm, γ = 0.9, Υ = 0.9 and a block length of N = 1024 were chosen. In Fig. 3 it can be seen SIR in dB 20 15 10 5 0 0 1 2 3 4 5 6 7 8 9 Time in seconds...

A Class of Frobenius Norm-Based Algorithms Using Penalty Term and Natural Gradient for Blind Signal Separation

by Uttachai Manmontri, Patrick A. Naylor
"... Abstract—We consider the blind signal separation (BSS) problem of instantaneous mixtures using penalty term and natural gradient. A class of Frobenius norm-based algorithms consisting of the offline/block processing (BP), online processing (OP) algorithms, and their normalized versions is proposed f ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract—We consider the blind signal separation (BSS) problem of instantaneous mixtures using penalty term and natural gradient. A class of Frobenius norm-based algorithms consisting of the offline/block processing (BP), online processing (OP) algorithms, and their normalized versions is proposed for separating nonstationary and nonwhite signals. The BP and OP algorithms, respectively, suitable for blind separation with offline and online data, are derived by using the nonstationarity and nonwhiteness of signals and the natural gradient method in conjunction with an appropriate penalty term. Associated with almost all algorithms employing a gradient method is a gradient noise problem. We thus develop, from BP and OP, their normalized versions in which the update of an unknown demixing matrix is based on the minimal disturbance principle. We show that the resulting updates are in the same direction as those of the original algorithms but with a scaling factor whose upper bound is unity. Algorithms using the nonstationarity and nonwhiteness properties have been proposed before but, due to the use of logarithms in their derivation, they are not capable of separating signals that are not persistently active and require regularization parameters to mitigate the problem. In this paper, the superior performance of the proposed algorithms to the previously proposed logarithm-based algorithms with and without regularization when separating nonpersistently active source signals is presented through some illustrative numerical experiments. Index Terms—Blind signal separation (BSS), natural gradient methods, penalty term, second-order statistics. I.
(Show Context)

Citation Context

...ence, all source signals are required to be persistently active with variances always greater than zero so that the logarithm-based cost function will be differentiable. This problem, as suggested in =-=[14]-=-, raises the need for regularization parameters to take care of nonpersistently active signals when performing the logarithm-based algorithm. The regularization parameters can, however, lead to biased...

Separation with Systolic Architecture

by H. Jeong, Y. Kim, H. J. Jang
"... The purpose of Blind Source Separation (BSS) is to obtain separated sources from convolutive mixture in-puts. Among the various available BSS methods, Independent Component Analysis (ICA) is one of the rep-resentative methods. Its key idea is to repetitively update and calculate the measures. Howeve ..."
Abstract - Add to MetaCart
The purpose of Blind Source Separation (BSS) is to obtain separated sources from convolutive mixture in-puts. Among the various available BSS methods, Independent Component Analysis (ICA) is one of the rep-resentative methods. Its key idea is to repetitively update and calculate the measures. However, dealing with the measures obtained from multi-array sensors causes obstacles for real-time use. In order to solve this problem, it is necessary to convert the software implementation of BSS algorithm into the hardware archi-tecture. Through the use of hardware architecture, the BSS algorithm can efficiently work within a relatively short time. In this study, we investigate a practical method using a parallel algorithm and architecture for hardware use in a blind source separation. We design a feedback network for real-time speech signal proc-essing. The network is composed of forward and updates algorithms. The architecture of the network is sys-tolic and therefore it is suitable for parallel processing. We only have to add and connect modules for scaling. This paper covers the process from the systolic design of BSS to the hardware implementation using Xilinx FPGAs. The simulation results of our proposed implementation are also represented in the experimental sec-tion. In that section, our architecture returns satisfying results with robust qualities.

Authors (Affiliation)

by Lutz Marquardt, Edwin Mab, Klaus Reindl, Yuanhang Zheng, Alessio Brutti, Piergiorgio Svaizer, Walter Kellermann, Fp Ist, Lutz Marquardt, Edwin Mab, Anthony Lombard, Yuanhang Zheng, Martin Schneider, Alessio Brutti, Piergiorgio Svaizer (fbk , 2009
"... WP Task responsible ..."
Abstract - Add to MetaCart
WP Task responsible
(Show Context)

Citation Context

...icients is then realized using the natural-gradient-descent approach [32]. In the DICIT project, we considered an efficient Second-Order-Statistics (SOS) realization of the TRINICON update rule [31], =-=[33]-=-. Due to its broadband formulation (derived in the time domain, hence treating all frequency bins simultaneously), this TRINICON-based implementation does not suffer from the critical permutation prob...

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University