Abstract
AbstractGiven an instantaneous mixture of some source signals, the blind signal separation (BSS) problem consists of the identification of both the mixing matrix and the original sources. By itself, it is a non-unique matrix factorization problem, while unique solutions can be obtained by imposing additional assumptions such as statistical independence. By mapping the matrix data to a tensor and by using tensor decompositions afterwards, uniqueness is ensured under certain conditions. Tensor decompositions have been studied thoroughly in literature. We discuss the matrix to tensor step and present tensorization as an important concept on itself, illustrated by a number of stochastic and deterministic tensorization techniques.KeywordsBlind source separationIndependent component analysisTensorizationCanonical polyadic decompositionBlock term decompositionHigher-order tensorMultilinear algebra
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
