Designing optimal sampling schemes. Swärd, J., Elvander, F., & Jakobsson, A. In 2017 25th European Signal Processing Conference (EUSIPCO), pages 912-916, Aug, 2017. Paper doi abstract bibtex In this work, we propose a method for finding an optimal, non-uniform, sampling scheme for a general class of signals in which the signal measurements may be non-linear functions of the parameters to be estimated. Formulated as a convex optimization problem reminiscent of the sensor selection problem, the method determines an optimal sampling scheme given a suitable estimation bound on the parameters of interest. The formulation also allows for putting emphasis on a particular set of parameters of interest by scaling the optimization problem in such a way that the bound to be minimized becomes more sensitive to these parameters. For the case of imprecise a priori knowledge of these parameters, we present a framework for customizing the sampling scheme to take such uncertainty into account. Numerical examples illustrate the efficiency of the proposed scheme.
@InProceedings{8081340,
author = {J. Swärd and F. Elvander and A. Jakobsson},
booktitle = {2017 25th European Signal Processing Conference (EUSIPCO)},
title = {Designing optimal sampling schemes},
year = {2017},
pages = {912-916},
abstract = {In this work, we propose a method for finding an optimal, non-uniform, sampling scheme for a general class of signals in which the signal measurements may be non-linear functions of the parameters to be estimated. Formulated as a convex optimization problem reminiscent of the sensor selection problem, the method determines an optimal sampling scheme given a suitable estimation bound on the parameters of interest. The formulation also allows for putting emphasis on a particular set of parameters of interest by scaling the optimization problem in such a way that the bound to be minimized becomes more sensitive to these parameters. For the case of imprecise a priori knowledge of these parameters, we present a framework for customizing the sampling scheme to take such uncertainty into account. Numerical examples illustrate the efficiency of the proposed scheme.},
keywords = {convex programming;signal sampling;signal measurements;nonlinear functions;convex optimization problem;sensor selection problem;optimal sampling schemes;Nuclear magnetic resonance;Optimization;Upper bound;Signal processing;Convex functions;Estimation;Uncertainty},
doi = {10.23919/EUSIPCO.2017.8081340},
issn = {2076-1465},
month = {Aug},
url = {https://www.eurasip.org/proceedings/eusipco/eusipco2017/papers/1570345475.pdf},
}
Downloads: 0
{"_id":"C6hMh6NdCsXAftgQ5","bibbaseid":"swrd-elvander-jakobsson-designingoptimalsamplingschemes-2017","authorIDs":[],"author_short":["Swärd, J.","Elvander, F.","Jakobsson, A."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["J."],"propositions":[],"lastnames":["Swärd"],"suffixes":[]},{"firstnames":["F."],"propositions":[],"lastnames":["Elvander"],"suffixes":[]},{"firstnames":["A."],"propositions":[],"lastnames":["Jakobsson"],"suffixes":[]}],"booktitle":"2017 25th European Signal Processing Conference (EUSIPCO)","title":"Designing optimal sampling schemes","year":"2017","pages":"912-916","abstract":"In this work, we propose a method for finding an optimal, non-uniform, sampling scheme for a general class of signals in which the signal measurements may be non-linear functions of the parameters to be estimated. Formulated as a convex optimization problem reminiscent of the sensor selection problem, the method determines an optimal sampling scheme given a suitable estimation bound on the parameters of interest. The formulation also allows for putting emphasis on a particular set of parameters of interest by scaling the optimization problem in such a way that the bound to be minimized becomes more sensitive to these parameters. For the case of imprecise a priori knowledge of these parameters, we present a framework for customizing the sampling scheme to take such uncertainty into account. Numerical examples illustrate the efficiency of the proposed scheme.","keywords":"convex programming;signal sampling;signal measurements;nonlinear functions;convex optimization problem;sensor selection problem;optimal sampling schemes;Nuclear magnetic resonance;Optimization;Upper bound;Signal processing;Convex functions;Estimation;Uncertainty","doi":"10.23919/EUSIPCO.2017.8081340","issn":"2076-1465","month":"Aug","url":"https://www.eurasip.org/proceedings/eusipco/eusipco2017/papers/1570345475.pdf","bibtex":"@InProceedings{8081340,\n author = {J. Swärd and F. Elvander and A. Jakobsson},\n booktitle = {2017 25th European Signal Processing Conference (EUSIPCO)},\n title = {Designing optimal sampling schemes},\n year = {2017},\n pages = {912-916},\n abstract = {In this work, we propose a method for finding an optimal, non-uniform, sampling scheme for a general class of signals in which the signal measurements may be non-linear functions of the parameters to be estimated. Formulated as a convex optimization problem reminiscent of the sensor selection problem, the method determines an optimal sampling scheme given a suitable estimation bound on the parameters of interest. The formulation also allows for putting emphasis on a particular set of parameters of interest by scaling the optimization problem in such a way that the bound to be minimized becomes more sensitive to these parameters. For the case of imprecise a priori knowledge of these parameters, we present a framework for customizing the sampling scheme to take such uncertainty into account. Numerical examples illustrate the efficiency of the proposed scheme.},\n keywords = {convex programming;signal sampling;signal measurements;nonlinear functions;convex optimization problem;sensor selection problem;optimal sampling schemes;Nuclear magnetic resonance;Optimization;Upper bound;Signal processing;Convex functions;Estimation;Uncertainty},\n doi = {10.23919/EUSIPCO.2017.8081340},\n issn = {2076-1465},\n month = {Aug},\n url = {https://www.eurasip.org/proceedings/eusipco/eusipco2017/papers/1570345475.pdf},\n}\n\n","author_short":["Swärd, J.","Elvander, F.","Jakobsson, A."],"key":"8081340","id":"8081340","bibbaseid":"swrd-elvander-jakobsson-designingoptimalsamplingschemes-2017","role":"author","urls":{"Paper":"https://www.eurasip.org/proceedings/eusipco/eusipco2017/papers/1570345475.pdf"},"keyword":["convex programming;signal sampling;signal measurements;nonlinear functions;convex optimization problem;sensor selection problem;optimal sampling schemes;Nuclear magnetic resonance;Optimization;Upper bound;Signal processing;Convex functions;Estimation;Uncertainty"],"metadata":{"authorlinks":{}},"downloads":0},"bibtype":"inproceedings","biburl":"https://raw.githubusercontent.com/Roznn/EUSIPCO/main/eusipco2017url.bib","creationDate":"2021-02-13T16:38:25.612Z","downloads":0,"keywords":["convex programming;signal sampling;signal measurements;nonlinear functions;convex optimization problem;sensor selection problem;optimal sampling schemes;nuclear magnetic resonance;optimization;upper bound;signal processing;convex functions;estimation;uncertainty"],"search_terms":["designing","optimal","sampling","schemes","swärd","elvander","jakobsson"],"title":"Designing optimal sampling schemes","year":2017,"dataSources":["2MNbFYjMYTD6z7ExY","uP2aT6Qs8sfZJ6s8b"]}