Open AccessMixing matrix estimation in UBSS based on homogeneous polynomials
Author(s) -
g Bin,
Fu Weihong
Publication year - 2018
Publication title -
iet signal processing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.384
H-Index - 42
ISSN - 1751-9683
DOI - 10.1049/iet-spr.2018.5207
Subject(s) - algorithm , mathematics , blind signal separation , mixing (physics) , cluster analysis , matrix (chemical analysis) , hyperplane , linear subspace , underdetermined system , robustness (evolution) , polynomial , scaling , computer science , combinatorics , mathematical analysis , computer network , channel (broadcasting) , statistics , physics , materials science , geometry , biochemistry , chemistry , quantum mechanics , composite material , gene
An algorithm is proposed for mixing matrix estimation in underdetermined blind source separation (UBSS) based on homogeneous polynomials representation, in order to blindly identify a mixing matrix in the case where the source signal is insufficiently sparse. First, the observed signal subspaces (hyperplanes) are identified by polynomial fitting, differentiation, and spectral clustering. Then, the intersection lines between clustering planes are estimated by using normal vectors of each subspace, which are finally proved to be column vectors of the mixing matrix up to scaling and ordering. Based on the algebraic‐geometric theory, the proposed algorithm can improve the accuracy of mixing matrix estimation, without being influenced by convergence. Simulation results indicate that the proposed algorithm has higher estimation accuracy than traditional algorithms. Additionally, the single‐source and multi‐source points of the source signal can be detected simultaneously, which increases the robustness of the algorithm.