Some algorithms for data analysis in interference wavefront detectors

Abstract

Several comments may be made. Two method of organizing interference-pattern scanning may be organized. The first entails invoking the points of a scan from a dense Cartesian raster stored in a computer memory, while for each subsequent point the given scan-selection condition must be verified. The second involves controlling the scanning aperture, when the satisfaction of the selection condition is verified by a servosystem, changing the scanning line as necessary. No excess information is stored in the computer here. The comparative characteristics of these two versions remain to be elucidated. Some difficulties are involved in obtaining a priori information on the position of the extremal points of the phase and the form of the extremum. These complications are not specific to any specific recovery algorithm but are characteristic for interferometry in general. It is evidently necessary to count on the possibility of introducing a linear phase shift between the reference and object waves, which is necessary to eliminate extrema. In addition, it is possible to construct a flexible mirror such that the phase extrema will coincide with the points of force application.