Joint Detection and Localization of an Unknown Number of Sources Using Algebraic Structure of the Noise Subspace
Matthew W. Morency, Sergiy A. Vorobyov, Geert Leus

TL;DR
This paper introduces a novel algebraic approach to source localization that adaptively determines the number of sources and their locations, outperforming traditional methods like root-MUSIC especially in challenging scenarios.
Contribution
It presents a new localization criterion based on the algebraic structure of the noise subspace and develops algorithms that do not require prior knowledge of the number of sources.
Findings
Significant improvement over root-MUSIC in detecting and localizing sources.
Effective in scenarios with closely located sources and varying SNRs.
No performance loss in simple scenarios.
Abstract
Source localization and spectral estimation are among the most fundamental problems in statistical and array signal processing. Methods which rely on the orthogonality of the signal and noise subspaces, such as Pisarenko's method, MUSIC, and root-MUSIC are some of the most widely used algorithms to solve these problems. As a common feature, these methods require both apriori knowledge of the number of sources, and an estimate of the noise subspace. Both requirements are complicating factors to the practical implementation of the algorithms, and when not satisfied exactly, can potentially lead to severe errors. In this paper, we propose a new localization criterion based on the algebraic structure of the noise subspace that is described for the first time to the best of our knowledge. Using this criterion and the relationship between the source localization problem and the problem of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
