A one-shot inpainting algorithm based on the topological asymptotic analysis
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.
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Digital revista |
| Language: | English |
| Published: |
Sociedade Brasileira de Matemática Aplicada e Computacional
2006
|
| Online Access: | http://old.scielo.br/scielo.php?script=sci_arttext&pid=S1807-03022006000200008 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|