English

Optimal Interpolation Data for PDE-based Compression of Images with Noise

Numerical Analysis 2022-02-23 v1 Numerical Analysis

Abstract

We introduce and discuss shape-based models for finding the best interpolation data in the compression of images with noise. The aim is to reconstruct missing regions by means of minimizing a data fitting term in the L2L^2-norm between the images and their reconstructed counterparts using time-dependent PDE inpainting. We analyze the proposed models in the framework of the Γ\Gamma-convergence from two different points of view. First, we consider a continuous stationary PDE model, obtained by focusing on the first iteration of the discretized time-dependent PDE, and get pointwise information on the "relevance" of each pixel by a topological asymptotic method. Second, we introduce a finite dimensional setting of the continuous model based on "fat pixels" (balls with positive radius), and we study by Γ\Gamma-convergence the asymptotics when the radius vanishes. Numerical computations are presented that confirm the usefulness of our theoretical findings for non-stationary PDE-based image compression.

Keywords

Cite

@article{arxiv.2202.10702,
  title  = {Optimal Interpolation Data for PDE-based Compression of Images with Noise},
  author = {Zakaria Belhachmi and Thomas Jacumin},
  journal= {arXiv preprint arXiv:2202.10702},
  year   = {2022}
}

Comments

arXiv admin note: text overlap with arXiv:2011.02363

R2 v1 2026-06-24T09:49:14.390Z