Determinant-Based Fast Greedy Sensor Selection Algorithm

@article{Saito2019DeterminantBasedFG,
  title={Determinant-Based Fast Greedy Sensor Selection Algorithm},
  author={Yuji Saito and Taku Nonomura and Keigo Yamada and Kumi Nakai and Takayuki Nagata and Keisuke Asai and Yasuo Sasaki and Daisuke Tsubakino},
  journal={IEEE Access},
  year={2019},
  volume={9},
  pages={68535-68551}
}
In this paper, the sparse sensor placement problem for least-squares estimation is considered, and the previous novel approach of the sparse sensor selection algorithm is extended. The maximization of the determinant of the matrix which appears in pseudo-inverse matrix operations is employed as an objective function of the problem in the present extended approach. The procedure for the maximization of the determinant of the corresponding matrix is proved to be mathematically the same as that of… 

Greedy Sensor Placement for Weighted Linear-Least Squares Estimation under Correlated Noise

A fast algorithm for greedy sensor selection is presented for a linear reducedordered reconstruction under the assumption of correlated noise on the sensor signals, which accomplishes the maximization of the determinant of the Fisher information matrix in the linear inverse problem.

Effect of Objective Function on Data-Driven Greedy Sparse Sensor Optimization

The problem of selecting an optimal set of sensors estimating a high-dimensional data is considered and a unified formulation of the objective function based on A-optimality is introduced and proved to be submodular, which provides the lower bound on the performance of the greedy method.

Data-Driven Sparse Sensor Selection Based on A-Optimal Design of Experiment With ADMM

The present study proposes a sensor selection method based on the proximal splitting algorithm and the A-optimal design of experiment using the alternating direction method of multipliers (ADMM) algorithm that is better than the existing greedy and convex relaxation methods in terms ofThe-optimality criterion.

Efficient Sensor Placement for Signal Reconstruction Based on Recursive Methods

A novel sensor placement method using signal reconstruction error as the cost function, sequentially minimize it with greedy procedures, and develops a fast reconstruction–oriented local optimization technique, by deriving update formulae for computationally intensive items.

Effect of Objective Function on Data-Driven Sparse Sensor Optimization

The results indicate that the greedy method based on D-optimality is the most suitable for high accurate reconstruction with low computational cost.

Randomized Subspace Newton Convex Method Applied to Data-Driven Sensor Selection Problem

The randomized subspace Newton convex methods for the sensor selection problem are proposed and the customized method shows superior performance to the straightforward implementation in terms of the quality of sensors and the computational time.

Data-driven optimal sensor placement for high-dimensional system using annealing machine

Nondominated-Solution-Based Multi-Objective Greedy Sensor Selection for Optimal Design of Experiments

The results of the test case show that the proposed method not only gives the Pareto-optimal front of the multi-objective optimization problem but also produces sets of sensors in terms of D-, A-, and E-optimality, that are superior to the sets selected by pure greedy methods that consider only a single objective function.

Randomized Group-Greedy Method for Data-Driven Sensor Selection

Randomized group-greedy methods for sensor selection problems are proposed and can provide better optimization results than those obtained by the original group-Greedy method when a similar computational cost is spent as for the original Groupgreedy method.

References

SHOWING 1-10 OF 38 REFERENCES

Effect of Objective Function on Data-Driven Greedy Sparse Sensor Optimization

The problem of selecting an optimal set of sensors estimating a high-dimensional data is considered and a unified formulation of the objective function based on A-optimality is introduced and proved to be submodular, which provides the lower bound on the performance of the greedy method.

Data-Driven Sparse Sensor Selection Based on A-Optimal Design of Experiment With ADMM

The present study proposes a sensor selection method based on the proximal splitting algorithm and the A-optimal design of experiment using the alternating direction method of multipliers (ADMM) algorithm that is better than the existing greedy and convex relaxation methods in terms ofThe-optimality criterion.

Randomized Subspace Newton Convex Method Applied to Data-Driven Sensor Selection Problem

The randomized subspace Newton convex methods for the sensor selection problem are proposed and the customized method shows superior performance to the straightforward implementation in terms of the quality of sensors and the computational time.

Sensor Selection via Convex Optimization

This paper describes a heuristic, based on convex optimization, that gives a subset selection as well as a bound on the best performance that can be achieved by any selection of k sensor measurements.

Multi-Fidelity Sensor Selection: Greedy Algorithms to Place Cheap and Expensive Sensors With Cost Constraints

This work evaluates the composition of cheap and expensive sensors, along with their placement, required to achieve accurate reconstruction of a high-dimensional state, and presents a systematic exploration of the effects of the number of modes and sensors on reconstruction error when using one type of sensor.

Greedy Sensor Placement With Cost Constraints

A relaxation of the full optimization formulation of this problem is considered and a well-established greedy algorithm is extended for the optimal sensor placement problem without cost constraints, which is scalable and often identifies sparse sensors with near-optimal reconstruction performance, while dramatically reducing the overall cost.

An analysis of approximations for maximizing submodular set functions—I

It is shown that a “greedy” heuristic always produces a solution whose value is at least 1 −[(K − 1/K]K times the optimal value, which can be achieved for eachK and has a limiting value of (e − 1)/e, where e is the base of the natural logarithm.

A New Selection Operator for the Discrete Empirical Interpolation Method - Improved A Priori Error Bound and Extensions

A new framework for constructing the discrete empirical interpolation method (\sf DEIM) projection operator is introduced, formulated using the QR factorization with column pivoting, and it enjoys a sharper error bound for the \sfDEIM projection error.

Data-Driven Sparse Sensor Placement for Reconstruction: Demonstrating the Benefits of Exploiting Known Patterns

This article explores how to design optimal sensor locations for signal reconstruction in a framework that scales to arbitrarily large problems, leveraging modern techniques in machine learning and sparse sampling.