A fast, large-scale optimal transport algorithm for holographic beam shaping
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866912914745589760 |
|---|---|
| author | Torchylo, Andrii Swan, Hunter Tellez, Lucas Hogan, Jason M. |
| author_facet | Torchylo, Andrii Swan, Hunter Tellez, Lucas Hogan, Jason M. |
| contents | 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 $\mathcal{O}(N^2)$ memory and $\mathcal{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 $\mathcal{O}(N)$ memory and $\mathcal{O}(N\log N)$ to $\mathcal{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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_19072 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A fast, large-scale optimal transport algorithm for holographic beam shaping Torchylo, Andrii Swan, Hunter Tellez, Lucas Hogan, Jason M. Optics Atomic Physics Quantum Physics 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 $\mathcal{O}(N^2)$ memory and $\mathcal{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 $\mathcal{O}(N)$ memory and $\mathcal{O}(N\log N)$ to $\mathcal{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. |
| title | A fast, large-scale optimal transport algorithm for holographic beam shaping |
| topic | Optics Atomic Physics Quantum Physics |
| url | https://arxiv.org/abs/2512.19072 |