Rectangular domain curl polynomial set for optical vector data processing and analysis

Abstract

Rectangular pupils are employed in many optical applications such as lasers and anamorphic optics, as well as for detection and metrology systems such as some Shack−Hartmann wavefront sensors and deflectometry systems. For optical fabrication, testing, and analysis in the rectangular domain, it is important to have a well-defined set of polynomials that are orthonormal over a rectangular pupil. Since we often measure the gradient of a wavefront or surface, it is necessary to have a polynomial set that is orthogonal over a rectangular pupil in the vector domain as well. We derive curl (called C) polynomials based on two-dimensional (2-D) versions of Chebyshev polynomials of the first kind. Previous work derived a set of polynomials (called G polynomials) that are obtained from the gradients of the 2-D Chebyshev polynomials. We show how the two sets together can be used as a complete representation of any vector data in the rectangular domain. The curl polynomials themselves or the complete set of G and C polynomials has many interesting applications. Two of those applications shown are systematic error analysis and correction in deflectometry systems and mapping imaging distortion.

Exploring Wavefront Detection in Imaging Systems with Rectangular Apertures Using Phase Diversity

“…Table 3 lists the 0–6 order terms of the unnormalized one-dimensional Chebyshev polynomial [ 23 ]. It can be seen that the Chebyshev polynomial has a similar form to the Legendre polynomial, except for the coefficients.…”

“…Table 2 lists the 1st-10th terms of the two-dimensional Legendre polynomial, and Figure 2 plots the 1st-10th terms. Table 3 lists the 0-6 order terms of the unnormalized one-dimensional Chebyshev polynomial [23]. It can be seen that the Chebyshev polynomial has a similar form to the Legendre polynomial, except for the coefficients.…”

Modal shape reconstruction method for deflectometry based on deep learning

“…Moreover, the computational complexity of modal methods is significantly reduced when compared with piecewise methods. The commonly used polynomials basis set includes Zernike polynomials [11,12], Legendre polynomials [13], and Chebyshev polynomials [14][15][16]. The corresponding coefficients of each polynomial mode are obtained by linear equations, which are consisted of the gradient of the polynomials and the measured slope data.…”

Shape reconstruction for deflectometry based on chebyshev polynomials and iteratively reweighted least squares regression

“…Modal approaches achieve better accuracy than zonal approaches when the modes can adequately describe the shape [9]. Recently, Zernike polynomials [10,11], Legendre polynomials [12], and Chebyshev polynomials [13][14][15] are widely used as the polynomial basis set in modal reconstruction. Chebyshev polynomials have many properties that make them suitable for shape reconstruction, especially with discrete measured data [16].…”