TY - GEN
T1 - Optimal acquisition policy for compressed measurements with limited observations
AU - Bhattacharya, Sourabh
AU - Nayyar, Ashutosh
AU - Basar, Tamer
PY - 2012
Y1 - 2012
N2 - In this paper, we explore the problem of optimizing the measurement policy in finite horizon sequential compressive sensing when the number of samples are strictly restricted to be less than the overall horizon of the problem. We assume that at each instant the sensor can decide whether or not to take an observation, based on the quality of the sensing parameters. The objective of the sensor is to minimize the coherence of the final sensing matrix. This problem lies at the intersection of usage limited sensing [6], [11] and sequential compressive sensing [3]. First, we consider the optimal acquisition problem in the class of open-loop policies. We show that every open-loop policy that satisfies the sensing constraints is optimal. Next, we consider the set of closed-loop policies. In order to solve the optimal acquisition problem, we formulate the corresponding dynamic program. Finally, we propose a greedy strategy for acquiring measurements, and show that it is optimal for low-dimensional problems.
AB - In this paper, we explore the problem of optimizing the measurement policy in finite horizon sequential compressive sensing when the number of samples are strictly restricted to be less than the overall horizon of the problem. We assume that at each instant the sensor can decide whether or not to take an observation, based on the quality of the sensing parameters. The objective of the sensor is to minimize the coherence of the final sensing matrix. This problem lies at the intersection of usage limited sensing [6], [11] and sequential compressive sensing [3]. First, we consider the optimal acquisition problem in the class of open-loop policies. We show that every open-loop policy that satisfies the sensing constraints is optimal. Next, we consider the set of closed-loop policies. In order to solve the optimal acquisition problem, we formulate the corresponding dynamic program. Finally, we propose a greedy strategy for acquiring measurements, and show that it is optimal for low-dimensional problems.
UR - http://www.scopus.com/inward/record.url?scp=84876237904&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84876237904&partnerID=8YFLogxK
U2 - 10.1109/ACSSC.2012.6489160
DO - 10.1109/ACSSC.2012.6489160
M3 - Conference contribution
AN - SCOPUS:84876237904
SN - 9781467350518
T3 - Conference Record - Asilomar Conference on Signals, Systems and Computers
SP - 968
EP - 972
BT - Conference Record of the 46th Asilomar Conference on Signals, Systems and Computers, ASILOMAR 2012
T2 - 46th Asilomar Conference on Signals, Systems and Computers, ASILOMAR 2012
Y2 - 4 November 2012 through 7 November 2012
ER -