scholarly journals Bayesian probabilistic approach by blind source separation for instantaneous mixtures

2018 ◽  
Vol 7 (4) ◽  
pp. 2848
Author(s):  
Pallavi Agrawal ◽  
Madhu Shandilya

In this work, the novel method of blind source separation using Bayesian Probabilistic approach is discussed for instantaneous mixtures. This work demonstrates the source separation problem which is well suited for the Bayesian approach. This work also provides a natural and logically consistent method in which prior knowledge can be incorporated to estimate the most probable solution. The distri-butions of the coefficients of the sources in the basis are modeled by a generalized Gaussian distribution (GGD) which is dependent on the sparsity parameter q. This method also utilizes prior distribution of the appropriate sparsity parameter of sources present in the mixture. Once, the prior distribution for each parameter (like mixing matrix, source matrix, sparsity parameter and error or noise covariance matrix) are defined, the Bayesian a posterior probabilistic approach using Markov chain Monte Carlo (MCMC) method is exploited in estimation of a posterior distribution of mixing matrix, source matrix, sparsity parameter and covariance matrix of error. The blind source separation provides the results in the form of signal to distortion ratio (SDR), signal to artifacts ratio (SAR) and signal to interference ratio (SIR) at different SNR.  

2012 ◽  
Vol 605-607 ◽  
pp. 2206-2210
Author(s):  
Ning Chen ◽  
Hong Yi Zhang

The blind source separation (BSS) using a two-stage sparse representation approach is discussed in this paper. We presented the algorithm based on linear membership function to estimate the unknown mixing matrix precisely, and then, the optimization algorithm based on integral to get the max value of the function is proposed. Another contribution described in this paper is the discussion of the impact of noise on the estimating the mixing matrix. Given the impact of noise, we set weights to put more emphasis on the more reliable data. Several experiments involving speech signals show the effectiveness and efficiency of this method.


2005 ◽  
Vol 17 (2) ◽  
pp. 321-330 ◽  
Author(s):  
Shengli Xie ◽  
Zhaoshui He ◽  
Yuli Fu

Stone's method is one of the novel approaches to the blind source separation (BSS) problem and is based on Stone's conjecture. However, this conjecture has not been proved. We present a simple simulation to demonstrate that Stone's conjecture is incorrect. We then modify Stone's conjecture and prove this modified conjecture as a theorem, which can be used a basis for BSS algorithms.


2004 ◽  
Vol 16 (9) ◽  
pp. 1827-1850 ◽  
Author(s):  
Fabian J. Theis

The goal of blind source separation (BSS) lies in recovering the original independent sources of a mixed random vector without knowing the mixing structure. A key ingredient for performing BSS successfully is to know the indeterminacies of the problem—that is, to know how the separating model relates to the original mixing model (separability). For linear BSS, Comon (1994) showed using the Darmois-Skitovitch theorem that the linear mixing matrix can be found except for permutation and scaling. In this work, a much simpler, direct proof for linear separability is given. The idea is based on the fact that a random vector is independent if and only if the Hessian of its logarithmic density (resp. characteristic function) is diagonal everywhere. This property is then exploited to propose a new algorithm for performing BSS. Furthermore, first ideas of how to generalize separability results based on Hessian diagonalization to more complicated nonlinear models are studied in the setting of postnonlinear BSS.


Author(s):  
Abouzid Houda ◽  
Chakkor Otman

Blind source separation is a very known problem which refers to finding the original sources without the aid of information about the nature of the sources and the mixing process, to solve this kind of problem having only the mixtures, it is almost impossible , that why using some assumptions is needed in somehow according to the differents situations existing in the real world, for exemple, in laboratory condition, most of tested algorithms works very fine and having good performence because the  nature and the number of the input signals are almost known apriori and then the mixing process is well determined for the separation operation.  But in fact, the real-life scenario is much more different and of course the problem is becoming much more complicated due to the the fact of having the most of the parameters of the linear equation are unknown. In this paper, we present a novel method based on Gaussianity and Sparsity for signal separation algorithms where independent component analysis will be used. The Sparsity as a preprocessing step, then, as a final step, the Gaussianity based source separation block has been used to estimate the original sources. To validate our proposed method, the FPICA algorithm based on BSS technique has been used.


2020 ◽  
Vol 131 (2) ◽  
pp. 425-436 ◽  
Author(s):  
Teppei Matsubara ◽  
Naruhito Hironaga ◽  
Taira Uehara ◽  
Hiroshi Chatani ◽  
Shozo Tobimatsu ◽  
...  

Author(s):  
D. SUGUMAR ◽  
NEETHU SUSAN RAJAN ◽  
P. T. VANATHI

Under-determined blind source separation aims to separate N non-stationary sources from M (M<N) mixtures.Paper presents a time-frequency approach (TF) to under-determined blind source separation of N non-stationary sources from M mixtures(M<N). It is based on Wigner-Ville distribution and Khatri-Rao product. Improved method involves a two step approach which involves the estimation of the mixing matrix where negative values of auto WVD of the sources are fully considered and secondly auto-term TF points are extracted.After extracting the auto-term TF points source WVD values at every TF point are computed using a new algorithm based on Khatri-Rao product. Thus sources are separated with the proposed approach no matter how many active sources there are as long as N≤ 2M-1.Simulation results are presented to show the superiority of the proposed algorithm by comparing it with the existing algorithms.


Sign in / Sign up

Export Citation Format

Share Document