Image restoration based on the fast marching method and block based sampling

In this paper, we propose an efficient image inpainting algorithm by introducing important aspects and improvements corresponding to the filling order of the pixels in the target region and texture synthesis in a dynamic searching range. The algorithm consists of two parts. The first part decides th...

Full description

Saved in:
Bibliographic Details
Published in:Computer vision and image understanding 2010-08, Vol.114 (8), p.847-856
Main Authors: Huan, Xiaoli, Murali, Beddhu, Ali, Adel L.
Format: Article
Language:English
Subjects:
Algorithms
Applied sciences
Artificial intelligence
Blocking
C (programming language)
Computer science
control theory
systems
Exact sciences and technology
Fast marching methods
Inpainting
Mathematical models
Pattern recognition. Digital image processing. Computational geometry
Pixels
Restoration
Sum of squared difference
Surface layer
Texture
Texture synthesis
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we propose an efficient image inpainting algorithm by introducing important aspects and improvements corresponding to the filling order of the pixels in the target region and texture synthesis in a dynamic searching range. The algorithm consists of two parts. The first part decides the filling order of the pixels in the target regions based on the high accuracy fast marching method. The second part of the algorithm implicitly assumes a Markov random field model for textured image regions and computes blocks of texture using an efficient search process and the SSD (Sum of Squared Differences) measure. The algorithm is straightforward to implement and restores the target regions with visually plausible quality that is at par or better than several existing methods, with a lower execution cost.
ISSN:1077-3142
1090-235X
DOI:10.1016/j.cviu.2010.04.007