mlsanityData to 7 Oct 2026

On Hamilton-Jacobi PDEs and image denoising models with certain non-additive noise

arXiv 2105.13997 ↗First posted 28 May 2021math.OC cs.CVcited by 3

Not on the map. Why?

Abstract (arXiv)

We consider image denoising problems formulated as variational problems. It is known that Hamilton-Jacobi PDEs govern the solution of such optimization problems when the noise model is additive. In this work, we address certain non-additive noise models and show that they are also related to Hamilton-Jacobi PDEs. These findings allow us to establish new connections between additive and non-additive noise imaging models. Specifically, we study how the solutions to these optimization problems depend on the parameters and the observed images. We show that the optimal values are ruled by some Hamilton-Jacobi PDEs, while the optimizers are characterized by the spatial gradient of the solution to the Hamilton-Jacobi PDEs. Moreover, we use these relations to investigate the asymptotic behavior of the variational model as the parameter goes to infinity, that is, when the influence of the noise vanishes. With these connections, some non-convex models for non-additive noise can be solved by applying convex optimization algorithms to the equivalent convex models for additive noise. Several numerical results are provided for denoising problems with Poisson noise or multiplicative noise.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 3 of its 46 references that are in the map. First posted on arXiv 28 May 2021.

Builds on

3 of 46 references.

References · 3

  1. 2016Algorithms for Overcoming the Curse of Dimensionality for Certain Hamilton-Jacobi Equations Arising in Control Theory and Elsewherecited by 21
  2. 2013Sparsity Based Poisson Denoising with Dictionary Learningcited by 9
  3. 2019On Decomposition Models in Imaging Sciences and Multi-time Hamilton-Jacobi Partial Differential Equationscited by 8

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 1; 2024: 0; 2025: 1.

3 papers.