Abstract

We show that the minimum variance wavefront estimation problems permit localized approximate solutions, in the sense that the wavefront value at a point (excluding unobservable modes, such as the piston mode) can be approximated by a linear combination of the wavefront slope measurements in the point’s neighborhood. This enables us to efficiently compute a wavefront estimate by performing a single sparse matrix–vector multiplication. Moreover, our results open the possibility for the development of wavefront estimators that can be easily implemented in a decentralized/distributed manner, and in which the estimate optimality can be easily traded for computational efficiency. We numerically validate our approach on Hudgin wavefront sensor geometries, and the results can be easily generalized to Fried geometries.

© 2016 Optical Society of America

On distributed wavefront reconstruction for large-scale adaptive optics systems

Cornelis C. de Visser, Elisabeth Brunner, and Michel Verhaegen
J. Opt. Soc. Am. A 33(5) 817-831 (2016)

Estimating stochastic noise using in situ measurements from a linear wavefront slope sensor

Nazim Ali Bharmal and Andrew P. Reeves
Opt. Lett. 41(2) 428-431 (2016)

Sparse data-driven wavefront prediction for large-scale adaptive optics

Paulo Cerqueira, Pieter Piscaer, and Michel Verhaegen
J. Opt. Soc. Am. A 38(7) 992-1002 (2021)

Cumulative Reconstructor: fast wavefront reconstruction algorithm for Extremely Large Telescopes

Matthias Rosensteiner
J. Opt. Soc. Am. A 28(10) 2132-2138 (2011)

Optimal estimator for tomographic fluorescence lifetime multiplexing

Steven S. Hou, Brian J. Bacskai, and Anand T. N. Kumar
Opt. Lett. 41(7) 1352-1355 (2016)