Subspace averaging and order determination for source enumeration Articles uri icon

publication date

  • June 2019

start page

  • 3028

end page

  • 3041

issue

  • 11

volume

  • 67

International Standard Serial Number (ISSN)

  • 1053-587X

Electronic International Standard Serial Number (EISSN)

  • 1941-0476

abstract

  • In this paper, we address the problem of subspace averaging, with special emphasis placed on the question of estimating the dimension of the average. The results suggest that the enumeration of sources in a multi-sensor array, which is a problem of estimating the dimension of the array manifold, and as a consequence the number of radiating sources, may be cast as a problem of averaging subspaces. This point of view stands in contrast to conventional approaches, which cast the problem as one of identifiying covariance models in a factor model. We present a robust formulation of the proposed order fitting rule based on majorization-minimization algorithms. A key element of the proposed method is to construct a bootstrap procedure, based on a newly proposed discrete distribution on the manifold of projection matrices, for stochastically generating subspaces from a function of experimentally determined eigenvalues. In this way, the proposed subspace averaging (SA) technique determines the order based on the eigenvalues of an average projection matrix, rather than on the likelihood of a covariance model, penalized by functions of the model order. By means of simulation examples, we show that the proposed SA criterion is especially effective in high-dimensional scenarios with low sample support.

keywords

  • array processing; dimension; grassmann manifold; order estimation; source enumeration; subspace averaging