Penalized least-squares for imaging with hypertelescopes

被引:1
|
作者
Webb, Adam J. [1 ]
Roggemann, Michael C. [2 ]
机构
[1] Michigan Technol Univ, Michigan Tech Res Inst, Houghton, MI 49931 USA
[2] Michigan Technol Univ, Dept Elect & Comp Engn, Houghton, MI 49931 USA
关键词
HIGHLY DILUTED APERTURES; RECONSTRUCTION;
D O I
10.1364/AO.456193
中图分类号
O43 [光学];
学科分类号
070207 ; 0803 ;
摘要
Practical considerations such as cost constrain the aperture size of conventional telescopes, which, combined with atmospheric turbulence effects, even in the presence of adaptive optics, limit achievable angular resolution. Sparse aperture telescopes represent a viable alternative for achieving improved angular resolution by combining light collected from small apertures distributed over a wide spatial area either using amplitude interferometry or a direct imaging approach to beam-combining. The so-called densified hypertelescope imaging concept in particular provides a methodology for direct image formation from large sparse aperture arrays. The densification system suppresses wide-angle side lobes and concentrates that energy in the center of the focal plane, significantly improving the signal-to-noise ratio of the measurement. Even with densification, an inevitable consequence of sparse aperture sampling is that the point-spread function associated with the direct image contains an additional structure not present in full aperture imaging systems. Postdetection image reconstruction is performed here to compute a high-fidelity estimate of the measured object in the presence of noise. In this paper, we describe a penalized least-squares object-estimation approach and compare the results with the classical Richardson-Lucy deconvolution algorithm as it is applied to hypertelescope image formation. The parameters of the algorithm are selected based on a comprehensive simulation study using the structure similarity metric to assess reconstruction performance. We find that the penalized least-squares formulation with optimized parameters provides significantly improved reconstructions compared with the conventional Richardson-Lucy algorithm. (C) 2022 Optica Publishing Group
引用
收藏
页码:5350 / 5357
页数:8
相关论文
共 50 条
  • [31] Penalized weighted least-squares estimate for variable selection on correlated multiply imputed data
    Li, Yang
    Yang, Haoyu
    Yu, Haochen
    Huang, Hanwen
    Shen, Ye
    JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES C-APPLIED STATISTICS, 2023, 72 (03) : 703 - 717
  • [32] LEAST-SQUARES ALGORITHMS
    WAMPLER, RH
    AMERICAN STATISTICIAN, 1977, 31 (01): : 52 - 53
  • [33] THEOREM IN LEAST-SQUARES
    WILLIAMS, HS
    PHOTOGRAMMETRIC ENGINEERING, 1972, 38 (11): : 1127 - &
  • [34] LEAST-SQUARES ESTIMATION
    SORENSON, HW
    IEEE SPECTRUM, 1971, 8 (01) : 12 - &
  • [35] Least-squares meshes
    Sorkine, O
    Cohen-Or, D
    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON SHAPE MODELING AND APPLICATIONS, 2004, : 191 - 199
  • [36] Least-Squares History
    Wiberg, Donald
    IEEE CONTROL SYSTEMS MAGAZINE, 2017, 37 (01): : 14 - 14
  • [37] THE LOGIC OF LEAST-SQUARES
    BARNARD, GA
    JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES B-STATISTICAL METHODOLOGY, 1963, 25 (01) : 124 - 127
  • [38] On the least-squares method
    Jiang, BN
    COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 1998, 152 (1-2) : 239 - 257
  • [39] LEAST-SQUARES REFINEMENT
    SPARKS, RA
    METHODS IN ENZYMOLOGY, 1985, 115 : 23 - 41
  • [40] On the least-squares method
    NASA Lewis Research Cent, Cleveland, United States
    Computer Methods in Applied Mechanics and Engineering, 1999, 152 (1-2): : 239 - 257