2014
DOI: 10.1109/tsp.2014.2299518
|View full text |Cite
|
Sign up to set email alerts
|

Near-Optimal Sensor Placement for Linear Inverse Problems

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 … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

1
215
0
2

Year Published

2014
2014
2024
2024

Publication Types

Select...
4
3
1

Relationship

1
7

Authors

Journals

citations
Cited by 200 publications
(218 citation statements)
references
References 35 publications
1
215
0
2
Order By: Relevance
“…Using the above notations, we can write the discrete-domain version of (1) as (2) We need to design how to choose the minimum number of sampling locations out of initial ones such that a desired estimation performance of the inverse problem (2) can be guaranteed. This problem is referred to as sensor selection.…”
Section: A Sensor Selectionmentioning
confidence: 99%
See 1 more Smart Citation
“…Using the above notations, we can write the discrete-domain version of (1) as (2) We need to design how to choose the minimum number of sampling locations out of initial ones such that a desired estimation performance of the inverse problem (2) can be guaranteed. This problem is referred to as sensor selection.…”
Section: A Sensor Selectionmentioning
confidence: 99%
“…The problem of choosing the best subset of sampling locations (or sensors) out of given locations is combinatorial in nature. To simplify this problem, solutions based on greedy methods [1], [2] and convex optimization [4], [5], [7]- [9] are proposed. Sensor selection can be formulated as the design of a Boolean selection vector.…”
Section: A Sensor Selectionmentioning
confidence: 99%
“…One such computationally less intensive implementation of the relaxed sensor selection problem is based on the projected subgradient algorithm [13]. Alternative approaches to convex optimization based sensor selection exploit the submodularity of the objective function using proxies for the MSE, like the mutual information [19] or the frame potential [7]. The submodularity of the objective function helps in developing low-complexity greedy algorithms, which sequentially adds sensors that maximize the increase in the cost.…”
Section: A Sensor Selection For Estimationmentioning
confidence: 99%
“…Sensor deployment can also be interpreted as a sensor selection problem in which the best subset of the available sensor locations are selected subject to a performance constraint. Sensor selection has been applied to a wide variety of problems: dynamical systems [1]- [5], network monitoring [6], field estimation [7], array optimization [8], sourceinformative sensor identification [9], anchor placement [10], and outlier detection [11].…”
Section: Introductionmentioning
confidence: 99%
“…However, there are two aspects that are often neglected and may significantly impact the performance of the system: the optimization of the sensors' locations, to improve the reconstruction of the physical field from the measurements, and of the sources' locations, to improve the control of the physical field itself. While the first problem has recently received some attention [1][2][3][4], the second one is rarely discussed in the literature. …”
Section: Introductionmentioning
confidence: 99%