.png){kind=icon}
.png){kind=icon}
Return
Probabilistic Simplex Component Analysis by Importance Sampling
.png){kind=icon}
OA
AI
DOI：10.1109/LSP.2023.3282166.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this letter we consider the problem of linear unmixing hidden random variables defined over the simplex with additive Gaussian noise, also known as probabilistic simplex component analysis (PRISM). Previous solutions to tackle this challenging problem were based on geometrical approaches or computationally intensive variational methods. In contrast, we propose a conventional expectation maximization (EM) algorithm which embeds importance sampling. For this purpose, the proposal distribution is chosen as a simple surrogate distribution of the target posterior that is guaranteed to lie in the simplex. It is based on fitting the Dirichlet parameters to the linear minimum mean squared error (LMMSE) approximation, which is accurate at high signal-to-noise ratio. Numerical experiments in different settings demonstrate the advantages of this adaptive surrogate over state-of-the-art methods.
Keywords:
Expectation maximization
importance sampling
simplex-structured matrix factorization
Journal
IF:
9.6
Papers:
1.1W
Citations:
1.7W