12 citations · 12 across the 2 of their papers we have counts for
3 papers
math.CO2025
A polynomial bound on the pathwidth of graphs edge-coverable by shortest paths
Julien Baste, Lucas De Meyer, Ugo Giocanti +2
Dumas, Foucaud, Perez and Todinca (2024) recently proved that every graph whose edges can be covered by shortest paths has pathwidth at most . In this paper, we improve…
eess.IV2022
Target Aware Poisson-Gaussian Noise Parameters Estimation from Noisy Images
Étienne Objois, Kaan Okumuş, Nicolas Bähler
Digital sensors can lead to noisy results under many circumstances. To be able to remove the undesired noise from images, proper noise modeling and an accurate noise parameter esti…
cs.CV2022★ 12 cited
PoGaIN: Poisson-Gaussian Image Noise Modeling from Paired Samples
Nicolas Bähler, Majed El Helou, Étienne Objois +2
Image noise can often be accurately fitted to a Poisson-Gaussian distribution. However, estimating the distribution parameters from a noisy image only is a challenging task. Here,…