MAP-Based Underdetermined Blind Source Separation of Convolutive Mixtures by Hierarchical Clustering and ![]()
-Norm Minimization
Article Quality & Performance Metrics
Abstract
We address the problem of underdetermined BSS. While most previous approaches are designed for instantaneous mixtures, we propose a time-frequency-domain algorithm for convolutive mixtures. We adopt a two-step method based on a general maximum a posteriori (MAP) approach. In the first step, we estimate the mixing matrix based on hierarchical clustering, assuming that the source signals are sufficiently sparse. The algorithm works directly on the complex-valued data in the time-frequency domain and shows better convergence than algorithms based on self-organizing maps. The assumption of Laplacian priors for the source signals in the second step leads to an algorithm for estimating the source signals. It involves the
| Reference Key |
walter2007mapbasedeurasip
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | Walter, Kellermann;Stefan, Winter;Hiroshi, Sawada;Shoji, Makino; |
| Journal | eurasip journal on advances in signal processing |
| Year | 2007 |
| DOI |
DOI not found
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.