Near-Optimal Sensor Placement for Linear Inverse Problems
From MaRDI portal
Abstract: A classic problem is the estimation of a set of parameters from measurements collected by only a few sensors. The number of sensors is often limited by physical or economical constraints and their placement is of fundamental importance to obtain accurate estimates. Unfortunately, the selection of the optimal sensor locations is intrinsically combinatorial and the available approximation algorithms are not guaranteed to generate good solutions in all cases of interest. We propose FrameSense, a greedy algorithm for the selection of optimal sensor locations. The core cost function of the algorithm is the frame potential, a scalar property of matrices that measures the orthogonality of its rows. Notably, FrameSense is the first algorithm that is near-optimal in terms of mean square error, meaning that its solution is always guaranteed to be close to the optimal one. Moreover, we show with an extensive set of numerical experiments that FrameSense achieves state-of-the-art performance while having the lowest computational cost, when compared to other greedy methods.
Cited in
(14)- Observable dictionary learning for high-dimensional statistical inference
- Frame completion with prescribed norms via alternating projection method
- Optimal \(\alpha,\mathfrak{d})\)-multi-completion of \(\mathfrak{d}\)-designs
- Interactive planning and sensing in unknown static environments with task-driven sensor placement
- A generalized Schur-Horn theorem and optimal frame completions
- Stabilization of generalized empirical interpolation method (GEIM) in presence of noise: a novel approach based on Tikhonov regularization
- Linear and nonlinear sensor placement strategies for mean-flow reconstruction via data assimilation
- Data-Driven Sparse Sensor Placement for Reconstruction: Demonstrating the Benefits of Exploiting Known Patterns
- Efficient Sensor Placement for Signal Reconstruction Based on Recursive Methods
- A greedy Galerkin method to efficiently select sensors for linear dynamical systems
- Near-optimal task-driven sensor network configuration
- Greedy selection of optimal location of sensors for uncertainty reduction in seismic moment tensor inversion
- Random greedy deployment of heterogeneous UAVs
- Submodular optimization for heterogeneous UAV deployment
This page was built for publication: Near-Optimal Sensor Placement for Linear Inverse Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4579034)
