Data-Driven Sensor Selection Method Based on Proximal Optimization for High-Dimensional Data With Correlated Measurement Noise
arXiv:2205.06067 · doi:10.1109/TSP.2022.3212150
Abstract
The present paper proposes a data-driven sensor selection method for a high-dimensional nondynamical system with strongly correlated measurement noise. The proposed method is based on proximal optimization and determines sensor locations by minimizing the trace of the inverse of the Fisher information matrix under a block-sparsity hard constraint. The proposed method can avoid the difficulty of sensor selection with strongly correlated measurement noise, in which the possible sensor locations must be known in advance for calculating the precision matrix for selecting sensor locations. The problem can be efficiently solved by the alternating direction method of multipliers, and the computational complexity of the proposed method is proportional to the number of potential sensor locations when it is used in combination with a low-rank expression of the measurement noise model. The advantage of the proposed method over existing sensor selection methods is demonstrated through experiments using artificial and real datasets.
References in corpus (14)
- Data-Driven Sparse Sensor Placement for Reconstruction
- Design of Optimal Sparse Feedback Gains via the Alternating Direction Method of Multipliers
- A New Selection Operator for the Discrete Empirical Interpolation Method -- improved a priori error bound and extensions
- Global convergence of splitting methods for nonconvex composite optimization
- Sensor Selection for Estimation with Correlated Measurement Noise
- Sensor Selection Based on Generalized Information Gain for Target Tracking in Large Sensor Networks
- Jump-sparse and sparse recovery using Potts functionals
- Determinant-based Fast Greedy Sensor Selection Algorithm
- Fast Greedy Optimization of Sensor Selection in Measurement with Correlated Noise
- Effect of Objective Function on Data-Driven Greedy Sparse Sensor Optimization
- Data-driven sparse sensor placement based on A-optimal design of experiment with ADMM
- Data-driven Vector-measurement-sensor Selection based on Greedy Algorithm
- Randomized Subspace Newton Convex Method Applied to Data-Driven Sensor Selection Problem
- Nondominated-Solution-based Multi-objective Greedy Sensor Selection for Optimal Design of Experiments
Cited by in corpus (6)
- Nondominated-Solution-based Multi-objective Greedy Sensor Selection for Optimal Design of Experiments
- Optimization of Sparse Sensor Placement for Estimation of Wind Direction and Surface Pressure Distribution Using Time-Averaged Pressure-Sensitive Paint Data on Automobile Model
- Proof-of-concept Study of Sparse Processing Particle Image Velocimetry for Real Time Flow Observation
- Randomized Group-Greedy Method for Large-Scale Sensor Selection Problems
- Observation Site Selection for Physical Model Parameter Estimation toward Process-Driven Seismic Wavefield Reconstruction
- Fast Data-driven Greedy Sensor Selection for Ridge Regression