Optimal Sampling Strategies for Multiscale Stochastic Processes
Ribeiro, Vinay Joseph
Riedi, Rudolf H.
Baraniuk, Richard G.
multiscale stochastic processes; finite population; spatial data; networks; sampling; convex; concave; optimization; trees; sensor networks
In this paper, we determine which non-random sampling of fixed size gives the best linear predictor of the sum of a finite spatial population. We employ different multiscale superpopulation models and use the minimum mean-squared error as our optimality criterion. In a multiscale superpopulation tree models, the leaves represent the units of the population, interior nodes represent partial sums of the population, and the root node represents the total sum of the population. We prove that the optimal sampling pattern varies dramatically with the correlation structure of the tree nodes. While <it> uniform sampling </it> is optimal for trees with "positive correlation progression," it provides the worst possible sampling with "negative correlation progression." As an analysis tool, we introduce and study a class of <it> independent innovations trees </it> that are of interest in their own right. We derive a fast water-filling algorithm to determine the optimal sampling of the leaves to estimate the root of an independent innovations tree.