Mixing matrix estimation using discriminative clustering for blind source separation

Jayaraman J. Thiagarajan, Karthikeyan Natesan Ramamurthy, Andreas Spanias

Research output: Contribution to journalArticle

43 Citations (Scopus)

Abstract

Mixing matrix estimation in instantaneous blind source separation (BSS) can be performed by exploiting the sparsity and disjoint orthogonality of source signals. As a result, approaches for estimating the unknown mixing process typically employ clustering algorithms on the mixtures in a parametric domain, where the signals can be sparsely represented. In this paper, we propose two algorithms to perform discriminative clustering of the mixture signals for estimating the mixing matrix. For the case of overdetermined BSS, we develop an algorithm to perform linear discriminant analysis based on similarity measures and combine it with K-hyperline clustering. Furthermore, we propose to perform discriminative clustering in a high-dimensional feature space obtained by an implicit mapping, using the kernel trick, for the case of underdetermined source separation. Using simulations on synthetic data, we demonstrate the improvements in mixing matrix estimation performance obtained using the proposed algorithms in comparison to other clustering methods. Finally we perform mixing matrix estimation from speech mixtures, by clustering single source points in the time-frequency domain, and show that the proposed algorithms achieve higher signal to interference ratio when compared to other baseline algorithms.

Original languageEnglish (US)
Pages (from-to)9-18
Number of pages10
JournalDigital Signal Processing: A Review Journal
Volume23
Issue number1
DOIs
StatePublished - Jan 2013

Fingerprint

Blind source separation
Source separation
Discriminant analysis
Clustering algorithms

Keywords

  • Discriminative clustering
  • Instantaneous blind source separation
  • K-hyperline clustering
  • Kernel trick
  • Mixing matrix estimation

ASJC Scopus subject areas

  • Signal Processing
  • Electrical and Electronic Engineering

Cite this

Mixing matrix estimation using discriminative clustering for blind source separation. / J. Thiagarajan, Jayaraman; Natesan Ramamurthy, Karthikeyan; Spanias, Andreas.

In: Digital Signal Processing: A Review Journal, Vol. 23, No. 1, 01.2013, p. 9-18.

Research output: Contribution to journalArticle

J. Thiagarajan, Jayaraman ; Natesan Ramamurthy, Karthikeyan ; Spanias, Andreas. / Mixing matrix estimation using discriminative clustering for blind source separation. In: Digital Signal Processing: A Review Journal. 2013 ; Vol. 23, No. 1. pp. 9-18.
@article{79d27185ed1d4e9fb4756444ec115ea5,
title = "Mixing matrix estimation using discriminative clustering for blind source separation",
abstract = "Mixing matrix estimation in instantaneous blind source separation (BSS) can be performed by exploiting the sparsity and disjoint orthogonality of source signals. As a result, approaches for estimating the unknown mixing process typically employ clustering algorithms on the mixtures in a parametric domain, where the signals can be sparsely represented. In this paper, we propose two algorithms to perform discriminative clustering of the mixture signals for estimating the mixing matrix. For the case of overdetermined BSS, we develop an algorithm to perform linear discriminant analysis based on similarity measures and combine it with K-hyperline clustering. Furthermore, we propose to perform discriminative clustering in a high-dimensional feature space obtained by an implicit mapping, using the kernel trick, for the case of underdetermined source separation. Using simulations on synthetic data, we demonstrate the improvements in mixing matrix estimation performance obtained using the proposed algorithms in comparison to other clustering methods. Finally we perform mixing matrix estimation from speech mixtures, by clustering single source points in the time-frequency domain, and show that the proposed algorithms achieve higher signal to interference ratio when compared to other baseline algorithms.",
keywords = "Discriminative clustering, Instantaneous blind source separation, K-hyperline clustering, Kernel trick, Mixing matrix estimation",
author = "{J. Thiagarajan}, Jayaraman and {Natesan Ramamurthy}, Karthikeyan and Andreas Spanias",
year = "2013",
month = "1",
doi = "10.1016/j.dsp.2012.08.002",
language = "English (US)",
volume = "23",
pages = "9--18",
journal = "Digital Signal Processing: A Review Journal",
issn = "1051-2004",
publisher = "Elsevier Inc.",
number = "1",

}

TY - JOUR

T1 - Mixing matrix estimation using discriminative clustering for blind source separation

AU - J. Thiagarajan, Jayaraman

AU - Natesan Ramamurthy, Karthikeyan

AU - Spanias, Andreas

PY - 2013/1

Y1 - 2013/1

N2 - Mixing matrix estimation in instantaneous blind source separation (BSS) can be performed by exploiting the sparsity and disjoint orthogonality of source signals. As a result, approaches for estimating the unknown mixing process typically employ clustering algorithms on the mixtures in a parametric domain, where the signals can be sparsely represented. In this paper, we propose two algorithms to perform discriminative clustering of the mixture signals for estimating the mixing matrix. For the case of overdetermined BSS, we develop an algorithm to perform linear discriminant analysis based on similarity measures and combine it with K-hyperline clustering. Furthermore, we propose to perform discriminative clustering in a high-dimensional feature space obtained by an implicit mapping, using the kernel trick, for the case of underdetermined source separation. Using simulations on synthetic data, we demonstrate the improvements in mixing matrix estimation performance obtained using the proposed algorithms in comparison to other clustering methods. Finally we perform mixing matrix estimation from speech mixtures, by clustering single source points in the time-frequency domain, and show that the proposed algorithms achieve higher signal to interference ratio when compared to other baseline algorithms.

AB - Mixing matrix estimation in instantaneous blind source separation (BSS) can be performed by exploiting the sparsity and disjoint orthogonality of source signals. As a result, approaches for estimating the unknown mixing process typically employ clustering algorithms on the mixtures in a parametric domain, where the signals can be sparsely represented. In this paper, we propose two algorithms to perform discriminative clustering of the mixture signals for estimating the mixing matrix. For the case of overdetermined BSS, we develop an algorithm to perform linear discriminant analysis based on similarity measures and combine it with K-hyperline clustering. Furthermore, we propose to perform discriminative clustering in a high-dimensional feature space obtained by an implicit mapping, using the kernel trick, for the case of underdetermined source separation. Using simulations on synthetic data, we demonstrate the improvements in mixing matrix estimation performance obtained using the proposed algorithms in comparison to other clustering methods. Finally we perform mixing matrix estimation from speech mixtures, by clustering single source points in the time-frequency domain, and show that the proposed algorithms achieve higher signal to interference ratio when compared to other baseline algorithms.

KW - Discriminative clustering

KW - Instantaneous blind source separation

KW - K-hyperline clustering

KW - Kernel trick

KW - Mixing matrix estimation

UR - http://www.scopus.com/inward/record.url?scp=84869504065&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84869504065&partnerID=8YFLogxK

U2 - 10.1016/j.dsp.2012.08.002

DO - 10.1016/j.dsp.2012.08.002

M3 - Article

VL - 23

SP - 9

EP - 18

JO - Digital Signal Processing: A Review Journal

JF - Digital Signal Processing: A Review Journal

SN - 1051-2004

IS - 1

ER -