Directional sparse filtering for blind estimation of under-determined complex-valued mixing matrices
We propose an algorithm that exploits the benefits of sparse filtering and directional clustering when estimating under-determined mixing matrix from mixtures of sufficiently sparse sources. To express the direction of each sample by only a few vectors in which one vector is more dominant than the r...
Saved in:
Main Authors: | , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
2020
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/138107 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
id |
sg-ntu-dr.10356-138107 |
---|---|
record_format |
dspace |
spelling |
sg-ntu-dr.10356-1381072020-04-24T06:08:37Z Directional sparse filtering for blind estimation of under-determined complex-valued mixing matrices Nguyen, Anh Hai Trieu Reju, Vaninirappuputhenpurayil Gopalan Khong, Andy W. H. School of Electrical and Electronic Engineering Engineering::Electrical and electronic engineering ICA Directional Clustering We propose an algorithm that exploits the benefits of sparse filtering and directional clustering when estimating under-determined mixing matrix from mixtures of sufficiently sparse sources. To express the direction of each sample by only a few vectors in which one vector is more dominant than the remaining ones, we propose to minimize the power mean of the magnitude-squared cosine distances between the estimated mixing matrix and the data. For the special case of estimating determined mixing matrix, we derive a stability condition for methods based on the magnitude-squared cosine metric. Our stability condition shows that the proposed approach, K-hyperlines, and sparse filtering can recover the invertible mixing matrix when the sources are i.i.d. super-Gaussian. Simulations using both synthetic data and recorded speech mixtures show that the proposed algorithm outperforms existing algorithms with lower computational complexity. Accepted version 2020-04-24T06:08:37Z 2020-04-24T06:08:37Z 2020 Journal Article Nguyen, A. H. T., Reju, V. G., & Khong, A. W. H. (2020). Directional sparse filtering for blind estimation of under-determined complex-valued mixing matrices. IEEE Transactions on Signal Processing, 68, 1990- 2003. doi:10.1109/TSP.2020.2979550 1053-587X https://hdl.handle.net/10356/138107 10.1109/TSP.2020.2979550 68 1990 2003 en SLE-RP5 IEEE Transactions on Signal Processing © 2020 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The published version is available at: https://doi.org/10.1109/TSP.2020.2979550 application/pdf |
institution |
Nanyang Technological University |
building |
NTU Library |
country |
Singapore |
collection |
DR-NTU |
language |
English |
topic |
Engineering::Electrical and electronic engineering ICA Directional Clustering |
spellingShingle |
Engineering::Electrical and electronic engineering ICA Directional Clustering Nguyen, Anh Hai Trieu Reju, Vaninirappuputhenpurayil Gopalan Khong, Andy W. H. Directional sparse filtering for blind estimation of under-determined complex-valued mixing matrices |
description |
We propose an algorithm that exploits the benefits of sparse filtering and directional clustering when estimating under-determined mixing matrix from mixtures of sufficiently sparse sources. To express the direction of each sample by only a few vectors in which one vector is more dominant than the remaining ones, we propose to minimize the power mean of the magnitude-squared cosine distances between the estimated mixing matrix and the data. For the special case of estimating determined mixing matrix, we derive a stability condition for methods based on the magnitude-squared cosine metric. Our stability condition shows that the proposed approach, K-hyperlines, and sparse filtering can recover the invertible mixing matrix when the sources are i.i.d. super-Gaussian. Simulations using both synthetic data and recorded speech mixtures show that the proposed algorithm outperforms existing algorithms with lower computational complexity. |
author2 |
School of Electrical and Electronic Engineering |
author_facet |
School of Electrical and Electronic Engineering Nguyen, Anh Hai Trieu Reju, Vaninirappuputhenpurayil Gopalan Khong, Andy W. H. |
format |
Article |
author |
Nguyen, Anh Hai Trieu Reju, Vaninirappuputhenpurayil Gopalan Khong, Andy W. H. |
author_sort |
Nguyen, Anh Hai Trieu |
title |
Directional sparse filtering for blind estimation of under-determined complex-valued mixing matrices |
title_short |
Directional sparse filtering for blind estimation of under-determined complex-valued mixing matrices |
title_full |
Directional sparse filtering for blind estimation of under-determined complex-valued mixing matrices |
title_fullStr |
Directional sparse filtering for blind estimation of under-determined complex-valued mixing matrices |
title_full_unstemmed |
Directional sparse filtering for blind estimation of under-determined complex-valued mixing matrices |
title_sort |
directional sparse filtering for blind estimation of under-determined complex-valued mixing matrices |
publishDate |
2020 |
url |
https://hdl.handle.net/10356/138107 |
_version_ |
1681059012655710208 |