Skip to content

CGH Algorithms

This section mainly focuses on the algorithmic aspect of holographic display systems.

Quick map:

  • Traditional Heuristic Methods: closed-form, geometry-driven, or display-inspired baselines.
  • Iterative Methods: optimize holograms by repeatedly propagating wavefields and enforcing constraints.
  • Learned Propagation Model Methods: learn the mismatch between ideal propagation and real hardware.
  • Learned Hologram Synthesis Methods: directly predict holograms or intermediate wavefields with neural networks.

Traditional Heuristic Methods

Point-based Methods

Polygon/Mesh-based Methods

Layer-based Methods

Holographic Stereograms

Iterative Methods

A family of iterative methods is based on the Gerchberg-Saxton (GS) Algorithm where the phase and amplitute patterns at two planes are updated iteratively as the wave propagates back and forth between the two planes:

Other optimization based methods leverage gradient descent or non-convex optimization techniques to optimize the phase pattern of the SLM:

Perceptual-driven loss designs

Others

Unfortunately, iterative methods are inherently slow and thus not suitble for real-time CGH. See this section for speeding up hologram synthesis using neural networks.

Learned Propagation Model Methods

There are often mismatches between a ideal wave propagation model (e.g. ASM) with the actual physical display setup. A major focus in deep learning for CGH is using camera-in-the-loop (CITL) training to learn an accurate free space wave propagation and optical hardware model for holographic displays:

Learned Hologram Synthesis Methods

These works often assume a naive wave propagation model (i.e. the angular spectrum method (ASM)), and directly regresses complex holograms using novel CNN architectures: