Source Number Estimation and Clustering for Underdetermined Blind Source Separation

نویسندگان

  • Benedikt Loesch
  • Bin Yang
چکیده

Much research has been undertaken in the field of blind source separation (BSS) and a large number of algorithms have been developed. However, most of them assume that the number of sources is known. In this paper we present an algorithm to estimate the number of sources in the (over-)determined and underdetermined case. We call this algorithm NOSET (Number of Sources Estimation Technique). We start from a description of the BSS problem, give a short overview of the so-called observation vector clustering algorithm and then present our approach. It is based on direction-ofarrival (DOA) estimation from reliable time-frequency points and a clustering of the DOA estimates. The estimated DOAs can be used to recover the source signals by performing a nearest-neighbor classification of the observation vectors instead of the conventional kmeans clustering procedure which is sensitive to the choice of initial centroids.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Underdetermined Blind Source Separation of Synchronous Orthogonal Frequency Hopping Signals Based on Single Source Points Detection

This paper considers the complex-valued mixing matrix estimation and direction-of-arrival (DOA) estimation of synchronous orthogonal frequency hopping (FH) signals in the underdetermined blind source separation (UBSS). A novel mixing matrix estimation algorithm is proposed by detecting single source points (SSPs) where only one source contributes its power. Firstly, the proposed algorithm disti...

متن کامل

Underdetermined Convolutive Blind Source Separation via Time-Frequency Masking

In this paper we consider the problem of separation of unknown number of sources from their underdetermined convolutive mixtures via time-frequency (TF) masking. We propose two algorithms, one for the estimation of the masks which are to be applied to the mixture in the TF domain for the separation of signals in the frequency domain, and the other for solving the permutation problem. The algori...

متن کامل

An algorithm for mixing matrix estimation in instantaneous blind source separation

Sparsity of signals in the frequency domain is widely used for blind source separation (BSS) when the number of sources is more than the number of mixtures (underdetermined BSS). In this paper we propose a simple algorithm for detection of points in the time–frequency (TF) plane of the instantaneous mixtures where only single source contributions occur. Samples at these points in the TF plane c...

متن کامل

Contribution of statistical tests to sparseness-based blind source separation

We address the problem of blind source separation in the underdetermined mixture case. Two statistical tests are proposed to reduce the number of empirical parameters involved in standard sparsenessbased underdetermined blind source separation (UBSS) methods. The first test performs multisource selection of the suitable time-frequency points for source recovery and is full automatic. The second...

متن کامل

Underdetermined Blind Source Separation with Fuzzy Clustering for Arbitrarily Arranged Sensors

Recently, the concept of time-frequency masking has developed as an important approach to the blind source separation problem, particularly when in the presence of reverberation. However, previous research has been limited by factors such as the sensor arrangement and/or the mask estimation technique implemented. This paper presents a novel integration of two established approaches to BSS in an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008