Determination of optimal sensor configuration is an important issue in many remote imaging modalities, such as tomographic and interferometric imaging. In this paper, a statistical optimality criterion is defined and a search is performed over the space of candidate sensor locations to determine the configuration that optimizes the criterion over all candidates. To make the search process computationally feasible, a modified version of a previously proposed suboptimal backward greedy algorithm is used. A statistical framework is developed which allows for inclusion of several widely used image constraints. Computational complexity of the proposed algorithm is discussed and a fast implementation is described. Furthermore, upper bounds on the sum of the squared error of the proposed algorithm are derived. Connections of the method to the deterministic backward greedy algorithm for the subset selection problem are presented, and two application examples are described. Five compelling optimality criteria are considered, and their performance is investigated through numerical experiments for a tomographic imaging scenario. In all cases, it is verified that the configuration designed by the proposed algorithm performs better than wisely chosen alternatives.