Article thumbnail

Designing sampling schemes for multi-dimensional data

By Johan Swärd, Filip Elvander and Andreas Jakobsson


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ér–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

Topics: Signal Processing, Sampling schemes, Convex optimization, Cramér–Rao lower bound
Publisher: 'Elsevier BV'
Year: 2018
DOI identifier: 10.1016/j.sigpro.2018.03.011
OAI identifier:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.