pith. sign in

arxiv: 1707.03247 · v1 · pith:6X7TKYCCnew · submitted 2017-07-11 · 📊 stat.ME · cs.IT· math.IT

Designing Sampling Schemes for Multi-Dimensional Data

classification 📊 stat.ME cs.ITmath.IT
keywords parameterssamplingschemeinterestmulti-dimensionalproblemproposedwell
0
0 comments X
read the original abstract

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 Cram\'er-Rao lower bound 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.