.png){kind=icon}
.png){kind=icon}
Return
Designing sampling schemes for multi-dimensional data
.png){kind=icon}
OA
AI
DOI：10.1016/j.sigpro.2018.03.011.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this work, we propose a method for determining a non-uniform sampling scheme for multi-dimensional signals by solving a convex optimization problem reminiscent of the sensor selection problem. The resulting sampling scheme minimizes the sum of the Cramer-Rao lower bounds for the parameters of interest, given a desired number of sampling points. The proposed framework allows for selecting an arbitrary subset of the parameters detailing the model, as well as weighing the importance of the different parameters. Also presented is a scheme for incorporating any imprecise a priori knowledge of the locations of the parameters, as well as defining estimation performance bounds for the parameters of interest. Numerical examples illustrate the efficiency of the proposed scheme. (C) 2018 Elsevier B.V. All rights reserved.
Keywords:
Sampling schemes
Convex optimization
Cramer-Rao lower bound
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.