1963
DOI: 10.1364/ao.2.001257
|View full text |Cite
|
Sign up to set email alerts
|

A Flexible Automatic Lens Correction Procedure

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

1967
1967
2023
2023

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 27 publications
(5 citation statements)
references
References 8 publications
0
5
0
Order By: Relevance
“…The least‐squares solution can be found once the following merit (error) function ξ is minimized: where F is a 2 S ‐element vector of the values f j , and F T denotes the transposed vector F . In the damped least‐squares technique, an optimization follows in repeating iterations (Spencer, 1963): where X 0 and X are the initial and the new vectors of the optimization parameters accordingly, A is the Jacobian matrix, i.e. a matrix of first partial derivatives of performance functions with respect to optimization parameters; p 2 is the damping factor; I is the unit diagonal matrix; F 0 is a vector of performance functions evaluated under initial parameters; and k l is the factor which defines the length of the descent vector.…”
Section: Optimization Algorithm For Reconstruction Of the Anterior Sumentioning
confidence: 99%
See 1 more Smart Citation
“…The least‐squares solution can be found once the following merit (error) function ξ is minimized: where F is a 2 S ‐element vector of the values f j , and F T denotes the transposed vector F . In the damped least‐squares technique, an optimization follows in repeating iterations (Spencer, 1963): where X 0 and X are the initial and the new vectors of the optimization parameters accordingly, A is the Jacobian matrix, i.e. a matrix of first partial derivatives of performance functions with respect to optimization parameters; p 2 is the damping factor; I is the unit diagonal matrix; F 0 is a vector of performance functions evaluated under initial parameters; and k l is the factor which defines the length of the descent vector.…”
Section: Optimization Algorithm For Reconstruction Of the Anterior Sumentioning
confidence: 99%
“…where F is a 2S-element vector of the values f j , and F T denotes the transposed vector F. In the damped leastsquares technique, an optimization follows in repeating iterations (Spencer, 1963):…”
Section: Optimization Algorithm For Reconstruction Of the Anterior Sumentioning
confidence: 99%
“…We note that DLS optimization is fundamentally different than SGD in that it involves multidimensional loss functions and requires the computation of the Jacobian. In addition, DLS optimization offers the possibility of handling constraints through the mechanism of Lagrange multipliers, 12 which is not possible with SGD without resorting to penalty methods.…”
Section: Auxiliary Loss Based On Optical Performancementioning
confidence: 99%
“…After that, numerous methods, including altering the additive damping in the DLS into multiplicative damping [31], were proposed to improve the convergence of the DLS. Except for the LS methods, Spencer [37] has specified that computers could only be regarded as a tool capable of offering optical designers temporary solutions because qualitative judgments and compromises were required in the optimization of optical systems. A novel concept of aberrations brought up by David S. Grey [38,39] is prominent, and this is principally due to the practical realization of his computer program, where a novel orthonormal theory of aberrations was applied in the optimization of optical systems.…”
Section: Overview Of Optical Imaging System Designmentioning
confidence: 99%