Optimal sampling points in reproducing kernel Hilbert spaces

From MaRDI portal
Publication:272199

DOI10.1016/J.JCO.2015.11.010zbMATH Open1339.46024arXiv1207.5871OpenAlexW1634494975MaRDI QIDQ272199FDOQ272199


Authors: Haizhang Zhang, Rui Wang Edit this on Wikidata


Publication date: 20 April 2016

Published in: Journal of Complexity (Search for Journal in Brave)

Abstract: The recent developments of basis pursuit and compressed sensing seek to extract information from as few samples as possible. In such applications, since the number of samples is restricted, one should deploy the sampling points wisely. We are motivated to study the optimal distribution of finite sampling points. Formulation under the framework of optimal reconstruction yields a minimization problem. In the discrete case, we estimate the distance between the optimal subspace resulting from a general Karhunen-Loeve transform and the kernel space to obtain another algorithm that is computationally favorable. Numerical experiments are then presented to illustrate the performance of the algorithms for the searching of optimal sampling points.


Full work available at URL: https://arxiv.org/abs/1207.5871




Recommendations




Cites Work


Cited In (5)

Uses Software





This page was built for publication: Optimal sampling points in reproducing kernel Hilbert spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q272199)