Optimal Sensor Array Configuration in Remote Image Formation

Optimal Sensor Array Configuration in Remote Image Formation
复制标题

远程成像中的最佳传感器阵列配置

DOI:
10.1109/tip.2007.914225
复制
发表时间:
2008
影响因子:
10.6
通讯作者:
F. Kamalabadi
F. Kamalabadi
中科院分区:
计算机科学1区
文献类型:
--
作者:
B. Sharif;F. Kamalabadi

文献摘要

被引文献

相似文献

在许多远程成像模式中,如层析成像和干涉成像,确定最佳传感器配置是一个重要问题。在本文中,定义了一个统计最优性准则,并在候选传感器位置空间上执行搜索,以确定在所有候选传感器位置上优化该准则的配置。为了使搜索过程在计算上可行,使用了先前提出的次优后向贪婪算法的改进版本。开发了一个统计框架,允许包括几个广泛使用的图像约束。讨论了该算法的计算复杂度,并给出了一种快速实现方法。此外,还推导了该算法的误差平方和的上界。将该方法与求解子集选择问题的确定性后向贪婪算法联系起来,并给出了两个应用实例。考虑了五种最优性准则,并通过层析成像场景的数值实验研究了它们的性能。在所有情况下,验证了所提出算法设计的配置比明智选择的替代方案性能更好。
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.