A new class of phase-calibration algorithms is presented. The originality of these algorithms, as well as their efficiency, results from certain particular structures, the analysis of which calls on algebraic graph theory. The corresponding optimization process, which is based on the principle of the trust-region methods, proves to be well suited to these structures. The main message that emerges from the study is very clear: The traditional notions of phase closure imaging can be understood and refined in a wider framework. The implications of this research therefore concern all the fields in which the notion of phase closure plays a key role: weak-phase imaging in optical interferometry, radio imaging, remote sensing by aperture synthesis, etc.
© 1998 Optical Society of America
Original Manuscript: June 20, 1997
Revised Manuscript: September 12, 1997
Manuscript Accepted: August 25, 1997
Published: February 1, 1998
André Lannes, "Phase-closure imaging in algebraic graph theory: a new class of phase-calibration algorithms," J. Opt. Soc. Am. A 15, 419-429 (1998)