An Image Inpainting Technique Based on the Fast Marching Method

@article{Telea2004AnII,
  title={An Image Inpainting Technique Based on the Fast Marching Method},
  author={Alexandru Cristian Telea},
  journal={Journal of Graphics Tools},
  year={2004},
  volume={9},
  pages={23 - 34}
}
  • A. Telea
  • Published 1 January 2004
  • Computer Science
  • Journal of Graphics Tools
Digital inpainting provides a means for reconstruction of small damaged portions of an image. [] Key Method Our algorithm is very simple to implement, fast, and produces nearly identical results to more complex, and usually slower, known methods. Source code is available online.

Digital images inpainting using modified convolution based method

The modification to Oliveira inpainting model is introduced and produces fast and good quality with one iteration without blur and removes large object with symmetric background.

An Image Inpainting Technique Based on Parallel Projection Methods

  • Irina Maria ArtinescuC. Boldea
  • Computer Science
    2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)
  • 2018
A new method of image reconstruction by inpainting small pattern over a damaged scratch, using a variant of the parallel projection method (PPM) for solving the convex feasibility problem.

A Fast Image Inpainting Algorithm Based on TV Model

Abstract—A fast image inpainting algorithm based on TV model is proposed on the basis of analysis of local characteristics, which shows the more information around damaged pixels appears, the faster

A Rapid Image Inpainting Algorithm Based on TV Model

 Abstract—A fast image inpainting algorithm based on TV model is proposed on the basis of analysis of local characteristics, which shows the more information around damaged pixels appears, the

A Fast Image Inpainting Algorithm Based on Structure

The current image inpainting algorithm based on structure, TV (total variation) algorithm is commonly used, and result is better. But TV algorithm is too slow, this paper presents a fast algorithm to

A Fast Inpainting Algorithm Using Half-Point Gradient

In the inpainting algorithm proposed, gradients of half-points in the neighborhood of a damaged point and its matching point are used to estimate thegray value of the damaged point, instead of replacing the gray value with that of the matching point directly.

Analysis of Exemplar Based Image Inpainting

In this paper here they provide an analysis of different Exemplar based techniques used for image Inpainting and present a brief comparative study of the techniques.

Inpainting Thick Image Regions using Isophote Propagation

A novel inpainting algorithm, termed as isophote propagation, is presented to solve the problem of over-smoothing effects in the filled areas, which is simple and fast, and performs better in preserving sharp edges than existing algorithms.

Image inpainting with structure and texture propagation

Novel image reconstruction method based on modified exemplar-based technique to find an example (patch) from an image using local binary patterns, and replacing non-existed data with it.

Image Inpainting Based FMM Algorithm by a Direction Selection Method

An improved image inpainting method based on FMM algorithm that uses gradient matrix to detect the texture direction and reduces the noise pixels’ influence can yield a better edge effect for inpainted procedure than the traditional approach.
...

References

SHOWING 1-10 OF 16 REFERENCES

Image inpainting

A novel algorithm for digital inpainting of still images that attempts to replicate the basic techniques used by professional restorators, and does not require the user to specify where the novel information comes from.

Nontexture Inpainting by Curvature-Driven Diffusions

This third-order PDE model improves the second-order total variation inpainting model introduced earlier by Chan and Shen and is guided by the connectivity principle of human visual perception.

Fast Digital Image Inpainting

We present a very simple inpainting algorithm for reconstruction of small missing and damaged portions of images that is two to three orders of magnitude faster than current methods while producing

Navier-stokes, fluid dynamics, and image and video inpainting

A class of automated methods for digital inpainting using ideas from classical fluid dynamics to propagate isophote lines continuously from the exterior into the region to be inpainted is introduced.

Distance transformations in digital images

  • G. Borgefors
  • Computer Science
    Comput. Vis. Graph. Image Process.
  • 1986

A fast marching level set method for monotonically advancing fronts.

  • J. Sethian
  • Computer Science
    Proceedings of the National Academy of Sciences of the United States of America
  • 1996
A fast marching level set method is presented for monotonically advancing fronts, which leads to an extremely fast scheme for solving the Eikonal equation. Level set methods are numerical techniques

A General Algorithm for Computing Distance Transforms in Linear Time

A new general algorithm for computing distance transforms of digital images is presented, which can be used for the computation of the exact Euclidean, Manhattan, and chessboard distance transforms.

Distance transformations in arbitrary dimensions

STL tutorial and reference guide - C++ programming with the standard template library

This second edition of the STL Tutorial and Reference Guide is fully updated to reflect all of the changes made to STL for the final ANSI/ISO C++ language standard and has been expanded with new chapters and appendices.