A one-shot inpainting algorithm based on the topological asymptotic analysis

AUTOR(ES)

Auroux, Didier, Masmoudi, Mohamed

FONTE

Computational & Applied Mathematics

DATA DE PUBLICAÇÃO

2006

RESUMO

The aim of this article is to propose a new method for the inpainting problem. Inpainting is the problem of filling-in holes in images. We consider in this article the crack localization problem, which can be solved using the Dirichlet to Neumann approach and the topological gradient. In a similar way, we can define a Dirichlet and a Neumann inpainting problem. We then define a cost function measuring the discrepancy between the two corresponding solutions. The minimization is done using the topological asymptotic analysis, and is performed in only one iteration. The optimal solution provides the best localization of the missing edges, and it is then easy to inpaint the holes.

Documentos Relacionados

• A NOVEL RAISIN SEGMENTATION ALGORITHM BASED ON DEEP LEARNING AND MORPHOLOGICAL ANALYSIS
• An algebra for Opengis coverages based on topological predicates
• On asymptotic analysis of spectral problems in elasticity
• A new probabilistic public key algorithm based on elliptic logarithms
• Research on manufacturing text classification based on improved genetic algorithm