Conservative iterative Fourier-transform algorithms in digital holography

Martin Hajek

doi:10.1117/12.138569

5 January 1993 Conservative iterative Fourier-transform algorithms in digital holography

Martin Hajek

Proceedings Volume 1718, Workshop on Digital Holography; (1993) https://doi.org/10.1117/12.138569
Event: Workshop on Digital Holography, 1992, Prague, Czech Republic

Abstract

Iterative Fourr Transform Algorithms provide an excellent tool for calculation of analog and quantized synthetic holograms. In principle the distributions in the object and the Fourier domain are modified to meet constraints given in both domains. In many practal situations these transformations of data belong to the class of the so called point tnuisformaticns which generally do not preserve L2 norm of data their total power or energy. It will be shown the usage of global transformations supplemented by tl ccnrvation constraint offers sorr advantages to point transformations with respect to the convergence of the algorithm. Resuitsof several numerical experiments will be given.

Citation Download Citation

Martin Hajek "Conservative iterative Fourier-transform algorithms in digital holography", Proc. SPIE 1718, Workshop on Digital Holography, (5 January 1993); https://doi.org/10.1117/12.138569

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available