• DocumentCode
    3010192
  • Title

    A k-subspace based tensor factorization approach for under-determined blind identi??cation

  • Author

    Makkiabadi, Bahador ; Sanei, Saeid ; Marshall, David

  • fYear
    2010
  • fDate
    7-10 Nov. 2010
  • Firstpage
    18
  • Lastpage
    22
  • Abstract
    In the paper, a novel k-subspaces based tensor factorization method is developed to tackle the underdetermined blind source separation (UBSS) and specially underdetermined blind identification (UBI) problems where k sources are active in each signal segment. This approach improves the general upper bound for maximum possible number of sources both in UBI and UBSS problems. The method is applied to mixtures of synthetic and real signals and the results are illustrated. Compared with other well-established approaches, the proposed method is able to identify the channels and separate the sources for more number of source signals.
  • Keywords
    blind source separation; matrix decomposition; tensors; k-subspace based tensor factorization approach; signal segment; source signals; underdetermined blind identification problem; underdetermined blind source separation; upper bound; Channel estimation; Estimation; Matrix decomposition; Minimization; Speech; Tensile stress; Upper bound; PARAFAC; Underdetermined blind identification; blind source separation; k-subspaces sparse component analysis; tensor factorization;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Signals, Systems and Computers (ASILOMAR), 2010 Conference Record of the Forty Fourth Asilomar Conference on
  • Conference_Location
    Pacific Grove, CA
  • ISSN
    1058-6393
  • Print_ISBN
    978-1-4244-9722-5
  • Type

    conf

  • DOI
    10.1109/ACSSC.2010.5757457
  • Filename
    5757457