Sampled fourier transform hologram generated by computer.

  title={Sampled fourier transform hologram generated by computer.},
  author={W H Lee},
  journal={Applied optics},
  volume={9 3},
  • W. H. Lee
  • Published 1 March 1970
  • Physics
  • Applied optics
A technique to determine a real nonnegative function representing the transmittance of a synthesized hologram is described. The technique uses the positions of the samples in the synthesized hologram to record the phase information of a complex wavefront. Synthesized holograms are displayed on a flying spot scanner and recorded on film. The transmittance of the synthesized hologram is quantized into 256 levels because of a hardware limitation of the scanner. 

Figures from this paper

Fourier-transform computer-generated hologram: a variation on the off-axis principle

A new simple and efficient technique based on Fourier transform to generate holograms by computer that does not take into account the classical techniques of phase codification is presented.

New coding technique for computer generated holograms.

A coding technique is developed for recording computer generated holograms on a computer controlled CRT in which each resolution cell contains two beam spots of equal size and equal intensity. This

Synthesis of computer-generated holograms: coding and Fourier domain optimization

A coding and Fourier domain iterative optimization method are introduced in the paper that can implement the hologram coding and optimization by minimizing the Fourierdomain mean- squared error iterative.

Computer-generated double-phase holograms.

A method of computer generating binary holograms based on the decomposition of a complex value into two phase quantities is described, and noise due to the displacement of the subcells and the phase coding is discussed.

Digital holography

The basic techniques in generating and reconstructing holograms on a digital computer are described. Some applications of computer holography, including optical spatial filtering and the testing of

Modulated-grating hologram.

A modulated-grating hologram has been synthesized from three computer-generated transmission masks, designed primarily for spatial filtering applications, in which a hologram with large dynamic range and large free-spectral-range is needed.

Optimum quantization in digital holography.

Methods for predicting optimum quantization schemes and associated mean squared errors are simplified to table-lookup procedures.

Reconstruction errors in computer generated binary holograms: a comparative study.

The image degradation encountered in reconstructing computer-generated binary holograms is compared for the Lohmann-Paris, Lee, and Burckhardt-type hologram plots. The results reported here assist



Reconstructed Wavefronts and Communication Theory

A two-step imaging process discovered by Gabor involves photographing the Fresnel diffraction pattern of an object and using this recorded pattern, called a hologram, to construct an image of this

Computer generated spatial filters for coherent optical data processiing.

This work shows that their filters, despite containing only amplitude values zero and one, can perform any data processing operation which could be performed by any complex filter.

Spatial Filtering for Detection of Signals Submerged in Noise

Matched filtering is described as a spatial filtering operation. A technique for producing a matched filter, wherein the filter transfer function is modulated onto a spatial carrier and the resulting

A Quantum Mechanical Evaluation of Line Breadths Involved in Tuned-Laser Absorption and Stimulated Emission Spectroscopy

An analysis is given of collision- and power-broadening effects in Tuned-Laser Absorption Spectroscopy using time-dependent perturbation theory. The results are compared with the earlier analysis

An algorithm for the machine calculation of complex Fourier series

Good generalized these methods and gave elegant algorithms for which one class of applications is the calculation of Fourier series, applicable to certain problems in which one must multiply an N-vector by an N X N matrix which can be factored into m sparse matrices.

Proc. IEEE 56

  • Proc. IEEE 56
  • 1968

Math. Comput

  • Math. Comput
  • 1965

J. Opt. Soc. Amer

  • J. Opt. Soc. Amer
  • 1962

Quarterly Progress Rept

  • Quarterly Progress Rept
  • 1966

Proc. IEEE 55

  • Proc. IEEE 55
  • 1965