@inproceedings{8c9cb7c70cc94a168917708e6c4cfba2,
title = "Sensor scheduling via compressed sensing",
abstract = "We present a novel approach for sensor scheduling which is, in general, a NP-hard problem involving the selection of S out of N sensors such that an optimal filtering performance is attained. Our approach utilizes a heuristic measure that quantifies the incoherence of the vector space defined by the sensors with respect to the system principal directions. This in turn facilitates the formulation of a convex relaxation that can be efficiently solved using a myriad of compressed sensing algorithms.",
keywords = "Compressed sensing, Estimability, Sensor networks, Sensor selection",
author = "Avishy Carmi",
year = "2010",
month = jan,
day = "1",
doi = "10.1109/icif.2010.5712027",
language = "English",
isbn = "9780982443811",
series = "13th Conference on Information Fusion, Fusion 2010",
publisher = "Institute of Electrical and Electronics Engineers",
booktitle = "13th Conference on Information Fusion, Fusion 2010",
address = "United States",
}