Random sampling and reconstruction of concentrated signals in a reproducing kernel space (Q2036501)

The authors consider random sampling of signals concentrated on a bounded corkscrew domain of a metric measure space, and reconstructing concentrated signals from their (un)corrupted sampling data. They establish a weighted stability of bi-Lipschitz type for a random sampling scheme on the set of concentrated signals in a reproducing kernel space; this provides a weak robustness to the sampling scheme, however due to the nonconvexity of the set of concentrated signals, it does not imply the unique signal reconstruction. From (un)corrupted samples taken on a finite sampling set, the authors propose an algorithm to find approximations to signals concentrated on a bounded corkscrew domain. They show that, with high probability, such signals can be reconstructed approximately from their uncorrupted (or randomly corrupted) samples taken at i.i.d. random positions, provided that the sampling size has a minimum lower bound. The performance of the proposed approximations to the original concentrated signals is demonstrated when the sampling procedure is taken either with large density or randomly with large size.