Markovian source separation

نویسندگان

  • Shahram Hosseini
  • Christian Jutten
  • Dinh-Tuan Pham
چکیده

A maximum likelihood (ML) approach is used to separate the instantaneous mixtures of temporally correlated, independent sources with neither preliminary transformation nor a priori assumption about the probability distribution of the sources. A Markov model is used to represent the joint probability density of successive samples of each source. The joint probability density functions are estimated from the observations using a kernel method. For the special case of autoregressive models, the theoretical performance of the algorithm is computed and compared with the performance of second-order algorithms and i.i.d.-based separation algorithms.

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

ثبت نام

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

منابع مشابه

Markovian blind separation of non-stationary temporally correlated sources

In a previous work, we developed a quasi-efficient maximum likelihood approach for blindly separating stationary, temporally correlated sources modeled by Markov processes. In this paper, we propose to extend this idea to separate mixtures of non-stationary sources. To handle non-stationarity, two methods based respectively on blocking and kernel smoothing are used to find parametric estimates ...

متن کامل

Dynamic Multi Period Production Planning Problem with Semi Markovian Variable Cost (TECHNICAL NOTE)

This paper develops a method for solving the single product multi-period production-planning problem, in which the production and the inventory costs of each period arc concave and backlogging is not permitted. It is also assumed that the unit variable cost of the production evolves according to a continuous time Markov process. We prove that this production-planning problem can be Stated as a ...

متن کامل

Markovian Source Separation in Post-nonlinear Mixtures

In linear mixtures, priors, like temporal coloration of the sources, can be used for designing simpler and better algorithms. Especially, modeling sources by Markov models is very efficient, and Markov source separation can be achieved by minimizing the conditional mutual information [1, 2]. This model allows to separate temporally colored Gaussian sources. In this paper, we extend this result ...

متن کامل

Hierarchical Markovian Models for Hyperspectral Image Segmentation

Hyperspectral images can be represented either as a set of images or as a set of spectra. Spectral classification and segmentation and data reduction are the main problems in hyperspectral image analysis. In this paper we propose a Bayesian estimation approach with an appropriate hiearchical model with hidden markovian variables which gives the possibility to jointly do data reduction, spectral...

متن کامل

Large and Moderate Deviations for Joint Source-Channel Coding of Systems With Markovian Memory

We derive novel upper and lower finite length bounds of the error probability in joint source-channel coding when the source is distributed according to an ergodic Markov process and the channel is a Markovian additive channel or a Markovian conditional additive channel. We show that these bounds are tight in the moderate deviations regime and for a certain interval of rates, also in the large ...

متن کامل

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


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

عنوان ژورنال:
  • IEEE Trans. Signal Processing

دوره 51  شماره 

صفحات  -

تاریخ انتشار 2003