Papers › Fast and stable schemes for non-linear osmosis filtering

Fast and stable schemes for non-linear osmosis filtering

29 Mar 2022arXiv:2203.15570links table onlyarchive 2025-07-28

L. Calatroni, S. Morigi, S. Parisotto, G. A. Recupero

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

We consider a non-linear variant of the transport-diffusion osmosis model for solving a variety of imaging problems such as shadow/soft-light removal and compact data representation. The non-linear behaviour is encoded in terms of a general scalar function g with suitable properties, which allows to balance the diffusion intensity on the different regions of the image while preventing smoothing artefacts. For the proposed model, conservation properties (intensity and non-negativity) are proved and a variational interpretation is showed for specific choices of g. Upon suitable spatial discretisation, both an explicit and a semi-implicit iterative scheme are considered, for which convergence restrictions and unconditional stability are proved, respectively. To validate the proposed modelling and the computational speed of the numerical schemes considered, we report several results and comparisons for the problem of shadow/light-spot removal and compact data representation, showing that artefact-free and computationally efficient results are obtained in comparison to standard linear and anisotropic models, and state-of-the art approaches.

PaperPDFCode

Code

giusepperecupero/non-linear-osmosis officialmentioned on GitHub report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections