arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2003.10424eess.IVastro-ph.IMcs.CVcs.LGeess.SP

Learning a Probabilistic Strategy for Computational Imaging Sensor Selection

California Institute of Technology(加州理工学院);Harvard Medical School(哈佛医学院);Massachusetts Institute of Technology(麻省理工学院)

He Sun, Adrian V. Dalca, Katherine L. Bouman

英文摘要:

Optimized sensing is important for computational imaging in low-resource environments, when images must be recovered from severely limited measurements. In this paper, we propose a physics-constrained, fully differentiable, autoencoder that learns a probabilistic sensor-sampling strategy for optimized sensor design. The proposed method learns a system's preferred sampling distribution that characterizes the correlations between different sensor selections as a binary, fully-connected Ising model. The learned probabilistic model is achieved by using a Gibbs sampling inspired network architecture, and is trained end-to-end with a reconstruction network for efficient co-design. The proposed framework is applicable to sensor selection problems in a variety of computational imaging applications. In this paper, we demonstrate the approach in the context of a very-long-baseline-interferometry (VLBI) array design task, where sensor correlations and atmospheric noise present unique challenges. We demonstrate results broadly consistent with expectation, and draw attention to particular structures preferred in the telescope array geometry that can be leveraged to plan future observations and design array expansions.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑