Sign in

A fast asymptotically efficient algorithm for blind separation of a linear mixture of block-wise stationary autoregressive processes.

Petr TichavskýArie YeredorZbynek Koldovský
Published in: ICASSP (2009)
Keyphrases
  • block wise
  • non stationary
  • expectation maximization
  • autoregressive
  • computational complexity
  • segmentation algorithm
  • blind separation
  • similarity measure
  • k means
  • clustering method