Sensor placement by maximal projection on minimum eigenspace for linear inverse problems
Chaoyang Jiang, Yeng Chai Soh, and Hua Li

TL;DR
This paper introduces two greedy sensor placement algorithms, MNEP and MPME, with MPME being highly efficient and outperforming existing methods in estimation accuracy for linear inverse problems, especially with limited sensors.
Contribution
The paper proposes the MPME algorithm that uses maximal projection on the minimum eigenspace for sensor placement, improving efficiency and accuracy over prior approaches.
Findings
MPME outperforms convex relaxation, SparSenSe, and FrameSense in WCEV and MSE.
MPME is computationally efficient and effective with limited sensors.
Sensor placement based on eigenspace projections enhances estimation accuracy.
Abstract
This paper presents two new greedy sensor placement algorithms, named minimum nonzero eigenvalue pursuit (MNEP) and maximal projection on minimum eigenspace (MPME), for linear inverse problems, with greater emphasis on the MPME algorithm for performance comparison with existing approaches. We select the sensing locations one-by-one. In this way, the least number of required sensors can be determined by checking whether the estimation accuracy is satisfied after each sensing location is determined. The minimum eigenspace is defined as the eigenspace associated with the minimum eigenvalue of the dual observation matrix. For each sensing location, the projection of its observation vector onto the minimum eigenspace is shown to be monotonically decreasing w.r.t. the worst case error variance (WCEV) of the estimated parameters. We select the sensing location whose observation vector has the…
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.
