Data-Driven Vector-Measurement-Sensor Selection Based on Greedy Algorithm

  title={Data-Driven Vector-Measurement-Sensor Selection Based on Greedy Algorithm},
  author={Yuji Saito and Taku Nonomura and Koki Nankai and Keigo Yamada and Keisuke Asai and Yasuo Sasaki and Daisuke Tsubakino},
  journal={IEEE Sensors Letters},
A vector-measurement-sensor problem for the least squares estimation is considered, by extending a previous novel approach in this letter. An extension of the vector-measurement-sensor selection of the greedy algorithm is proposed and is applied to particle-image-velocimetry data to reconstruct the full state based on the information given by sparse vector-measurement sensors. 

Figures from this paper

Data-Driven Sensor Selection Method Based on Proximal Optimization for High-Dimensional Data With 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 and can avoid the difficulty of sensor selection with strongly correlated measurement noise.

Greedy Sensor Selection for Weighted Linear Least Squares Estimation Under Correlated Noise

The present study reveals that the objective function with correlated noise is neither submodular nor supermodular, and the effectiveness of the selection algorithm in terms of accuracy in the estimation of the states of large-dimensional measurement data is shown.

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.

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.

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.

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.

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.

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

Proof-of-concept study of sparse processing particle image velocimetry for real time flow observation

In this paper, we overview, evaluate, and demonstrate the sparse processing particle image velocimetry (SPPIV) as a real-time flow field estimation method using the particle image velocimetry (PIV),



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.

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.

Extended-Kalman-filter-based dynamic mode decomposition for simultaneous system identification and denoising

EKFDMD performs better than existing algorithms for the case in which system noise is present and requires significant numerical resources for many-degree-of-freedom (many-DoF) problems and the combination with truncated proper orthogonal decomposition (trPOD) helps the algorithm to apply to many- doF problems, though it prevents the algorithm from being fully online.

Dynamic mode decomposition - data-driven modeling of complex systems

This first book to address the DMD algorithm presents a pedagogical and comprehensive approach to all aspects of DMD currently developed or under development, and blends theoretical development, example codes, and applications to showcase the theory and its many innovations and uses.

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.

Construction of the Linear Reduced-order Model based on PIV Data of Flow Field around Airfoil

In this study, a linear reduced-order model of fl ow fi elds around a NACA0015 is constructed based on time-resolved particle image velocimetry (PIV) data. The PIV data were obtained at the chord

Dynamic mode decomposition of numerical and experimental data

  • P. Schmid
  • Physics, Engineering
    Journal of Fluid Mechanics
  • 2010
The description of coherent features of fluid flow is essential to our understanding of fluid-dynamical and transport processes. A method is introduced that is able to extract dynamic information

Modal Analysis of Fluid Flows: An Overview

The intent of this document is to provide an introduction to modal analysis that is accessible to the larger fluid dynamics community and presents a brief overview of several of the well-established techniques.

Dynamic mode decomposition using a Kalman filter for parameter estimation

The fast algorithm of the proposed Kalman filter DMD (KFDMD) in combination with truncated proper orthogonal decomposition for many-degree-of-freedom problems is explained and is a promising tool with strong antinoise characteristics for analyzing sequential datasets.