• DocumentCode
    2741875
  • Title

    Online subspace and sparse filtering for target tracking in reverberant environment

  • Author

    Li, Weichang ; Subrahmanya, Niranjan ; Xu, Feng

  • Author_Institution
    ExxonMobil Corp. Strategic Res., Annandale, VA, USA
  • fYear
    2012
  • fDate
    17-20 June 2012
  • Firstpage
    329
  • Lastpage
    332
  • Abstract
    This paper proposes a class of joint subspace and sparse filtering algorithms with an example application in tracking moving targets in highly reverberant environment. Motivated by recent work in low-rank and sparse matrix decomposition, we have developed filtering algorithms that alternate between tracking the low-rank subspace and estimating the instantaneously sparse components, both of which are recursively updated as new data arrives. The algorithms are particularly suitable for online applications with streaming data or sequential processing of extremely large data sets for which matrix decomposition is computationally infeasible. In contrast to simple signal and noise subspace decomposition in traditional subspace processing, the algorithms we describe here assume a generative model consisting of a low-rank subspace, an additional sparse component and noise. This approach is well suited for tracking a sparse moving target signal in the presence of low-rank reverberations. We demonstrate the target tracking performance via a set of beam space field data.
  • Keywords
    filtering theory; matrix decomposition; reverberation; target tracking; reverberant environment; sparse filtering; sparse matrix decomposition; sparse moving target signal tracking; subspace filtering; target tracking; Approximation algorithms; Approximation methods; Matrix decomposition; Noise; Reverberation; Sparse matrices; Target tracking;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Sensor Array and Multichannel Signal Processing Workshop (SAM), 2012 IEEE 7th
  • Conference_Location
    Hoboken, NJ
  • ISSN
    1551-2282
  • Print_ISBN
    978-1-4673-1070-3
  • Type

    conf

  • DOI
    10.1109/SAM.2012.6250502
  • Filename
    6250502