Neural-network methods for two-dimensional finite-source reflector design

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Hacking, Roel, Kusch, Lisa, Mitra, Koondanibha, Anthonissen, Martijn, IJzerman, Wilbert
Natura: Preprint
Pubblicazione: 2026
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866917507333357568
author Hacking, Roel
Kusch, Lisa
Mitra, Koondanibha
Anthonissen, Martijn
IJzerman, Wilbert
author_facet Hacking, Roel
Kusch, Lisa
Mitra, Koondanibha
Anthonissen, Martijn
IJzerman, Wilbert
contents We address the inverse problem of designing two-dimensional reflectors that transform light from a finite, extended source into a prescribed far-field distribution. The reflector height is represented by a neural network and optimized with two objective functions: a direct change-of-variables loss based on the closed-form inverse ray map, and a mesh-based loss that maps target cells back to the source and remains usable for discontinuous sources. Gradients are computed by automatic differentiation and minimized with a robust quasi-Newton method. As a baseline, we adapt a deconvolution pipeline built on a simplified finite-source approximation: a one-dimensional monotone map is recovered from flux balance, converted to a reflector by an integrating-factor ODE solve, and embedded in a modified Van Cittert iteration with nonnegativity clipping and ray-traced feedback. Across four benchmarks, covering continuous and discontinuous sources and minimum-height constraints, accuracy is measured by ray-traced normalized mean absolute error. On the two main benchmarks, the neural method reaches errors of about 2e-5 and 5e-5 within a few seconds on one NVIDIA RTX 4090 GPU, compared with 4e-3 and 5e-2 for the deconvolution baseline after several hundred seconds. The results show that the neural formulation is both more accurate and substantially faster, while still supporting practical height constraints. We also discuss extensions to rotationally symmetric and full three-dimensional reflector design through iterative correction schemes.
format Preprint
id arxiv_https___arxiv_org_abs_2604_02184
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Neural-network methods for two-dimensional finite-source reflector design
Hacking, Roel
Kusch, Lisa
Mitra, Koondanibha
Anthonissen, Martijn
IJzerman, Wilbert
Machine Learning
78A46, 65K10, 68T07
We address the inverse problem of designing two-dimensional reflectors that transform light from a finite, extended source into a prescribed far-field distribution. The reflector height is represented by a neural network and optimized with two objective functions: a direct change-of-variables loss based on the closed-form inverse ray map, and a mesh-based loss that maps target cells back to the source and remains usable for discontinuous sources. Gradients are computed by automatic differentiation and minimized with a robust quasi-Newton method. As a baseline, we adapt a deconvolution pipeline built on a simplified finite-source approximation: a one-dimensional monotone map is recovered from flux balance, converted to a reflector by an integrating-factor ODE solve, and embedded in a modified Van Cittert iteration with nonnegativity clipping and ray-traced feedback. Across four benchmarks, covering continuous and discontinuous sources and minimum-height constraints, accuracy is measured by ray-traced normalized mean absolute error. On the two main benchmarks, the neural method reaches errors of about 2e-5 and 5e-5 within a few seconds on one NVIDIA RTX 4090 GPU, compared with 4e-3 and 5e-2 for the deconvolution baseline after several hundred seconds. The results show that the neural formulation is both more accurate and substantially faster, while still supporting practical height constraints. We also discuss extensions to rotationally symmetric and full three-dimensional reflector design through iterative correction schemes.
title Neural-network methods for two-dimensional finite-source reflector design
topic Machine Learning
78A46, 65K10, 68T07
url https://arxiv.org/abs/2604.02184