Diffraction field computation from arbitrarily distributed data points in space

Computation of the diffraction field from a given set of arbitrarily distributed data points in space is an important signal processing problem arising in digital holographic 3D displays. The field arising from such distributed data points has to be solved simultaneously by considering all mutual couplings to get correct results. In our approach, the discrete form of the plane wave decomposition is used to calculate the diffraction field. Two approaches, based on matrix inversion and on projections on to convex sets (POCS), are studied. Both approaches are able to obtain the desired field when the number of given data points is larger than the number of data points on a transverse cross-section of the space. The POCS-based algorithm outperforms the matrix-inversion-based algorithm when the number of known data points is large.

[1]  J. Navarro-Pedreño.  Numerical Methods for Least Squares Problems , 1996 .

[2]  F. Wyrowski,et al.  Fast calculation method for optical diffraction on tilted planes by use of the angular spectrum of plane waves. , 2003, Journal of the Optical Society of America. A, Optics, image science, and vision.

[3]  T. Tommasi,et al.  Computer-generated holograms of tilted planes by a spatial frequency approach , 1993 .

[4]  A W Lohmann,et al.  Fresnel ping-pong algorithm for two-plane computer-generated hologram display. , 1994, Applied optics.

[5]  N. Delen,et al.  Free-space beam propagation between arbitrarily oriented planes based on full diffraction theory: a fast Fourier transform approach , 1998 .

[6]  David Mas,et al.  Fast numerical calculation of Fresnel patterns in convergent systems , 2003 .

[7]  Levent Onural,et al.  DIGITAL DECODING OF IN-LINE HOLOGRAMS , 1987 .

[8]  Mark Lucente.  Diffraction-specific fringe computation for electro-holography , 1994 .

[9]  É. Lalor,et al.  Conditions for the Validity of the Angular Spectrum of Plane Waves , 1968 .

[10]  D. Youla,et al.  Image Restoration by the Method of Convex Projections: Part 1ߞTheory , 1982, IEEE Transactions on Medical Imaging.

[11]  R. Gerchberg.  A practical algorithm for the determination of phase from image and diffraction plane pictures , 1972 .

[12]  M. Teich,et al.  Fundamentals of Photonics , 1991 .

[13]  G. Sherman,et al.  Application of the convolution theorem to Rayleigh's integral formulas. , 1967, Journal of the Optical Society of America.

[14]  M. Huebschman,et al.  Dynamic holographic 3-D image projection. , 2003, Optics express.

[15]  Levent Onural,et al.  Computation of holographic patterns between tilted planes , 2006, International Conference on Holography, Optical Recording, and Processing of Information.

[16]  W. Godwin.  Article in Press , 2000 .

[17]  J. Goodman.  Introduction to Fourier optics , 1969 .

[18]  Y. Censor,et al.  Block-iterative projection methods for parallel computation of solutions to convex feasibility problems , 1989 .

[19]  Aykut Koç,et al.  Efficient computation of quadratic-phase integrals in optics. , 2006, Optics letters.

[20]  M. Born.  Principles of Optics : Electromagnetic theory of propagation , 1970 .

[21]  Boris Polyak,et al.  The method of projections for finding the common point of convex sets , 1967 .

[22]  Åke Björck,et al.  Numerical methods for least square problems , 1996 .