Work

A fast, large-scale optimal transport algorithm for holographic beam shaping

Year: 2026
Type: article
Abstract: Optimal transport methods have recently established state-of-the-art accuracy and efficiency for holographic laser beam shaping. However, use of such methods is hindered by severe O ( N 2 ) memory and O ( N 2 ) time requirements for large-scale input or output images with N total pixels. Here we leverage the dual formulation of the optimal transport problem and the separable structure of the cost to implement algorithms with greatly reduced O ( N ) memory and O ( N log ⁡ N ) to O ( N 3/2 ) time complexity. These algorithms are parallelizable and can solve megapixel-scale beam shaping problems in tens of seconds on a CPU or seconds on a GPU.
Institution: Stanford University
Language: English
Open Access status: gold
Estimated APC paid: $2,270
OpenAlex ID: W7126088209
FWCI: 2.764
Cites: 9
Cited by: 1
Related to: